Metraipolis › archive › dc_8aef4efbb3b5

Mitigating small gaps in quantum annealing through recursive $XX-$catalyst construction — arXiv:2611.04840

Source: arXiv (en)
Original: https://arxiv.org/abs/2611.04840
License (as archived): CC0-1.0
Archived: 2026-11-04T13:02:25.642Z
SHA-256 of the archived text: 022765e9ac77aa41aadd022614e0eeab0184eb1ed1d8d5f29853361b04acd91a
Stable URL of this page: https://metraipolis.com/documento/dc_8aef4efbb3b5

How to cite

Mitigating small gaps in quantum annealing through recursive $XX-$catalyst construction — arXiv:2611.04840 — arXiv (en), https://arxiv.org/abs/2611.04840 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8aef4efbb3b5 (Metraipolis archive dc_8aef4efbb3b5, sha256 022765e9ac77aa41aadd022614e0eeab0184eb1ed1d8d5f29853361b04acd91a)

BibTeX

@misc{dc8aef4efbb3b5,
  title = {Mitigating small gaps in quantum annealing through recursive $XX-$catalyst construction — arXiv:2611.04840},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.04840},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8aef4efbb3b5; sha256 022765e9ac77aa41aadd022614e0eeab0184eb1ed1d8d5f29853361b04acd91a},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.04840. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The introduction of $XX-$interactions, typically in the form of an additional catalyst Hamiltonian, has shown promise as a tool for gap enhancement in quantum annealing, allowing the algorithm to obtain optimal solutions with shorter run-times. However, the optimal placements of these couplings within the problem graph has been found to be highly setting-dependent. In this work, we propose an iterative catalyst-construction protocol for the removal of a common quantum annealing bottleneck known as perturbative crossings. The method utilises the measurements returned by successive annealing runs to effectively steer the algorithm away from the local optima in which it becomes trapped. First, we motivate a framework for $XX-$term selection based on perturbation theory and establish its effectiveness at removing perturbative crossings on scalable toy instances with up to $39$ spins, demonstrating a consistent performance both with increasing system size and number of local optima. We then simulate the recursive catalyst-construction method on a test set of $18-$spin maximum-weight independent set problems that are generated to produce annealing spectra with multiple perturbative crossings. We find that the protocol significantly outperforms both catalyst-free annealing and annealing with catalysts containing randomly selected $XX-$terms.

Tema degli esploratori: fisica e astronomia (elenco arXiv quant-ph, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2611.04840 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-04T12:36:48.050Z dalla pagina https://arxiv.org/list/quant-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).