Metraipolis › archive › dc_013ce3d3e1fe

Parity Mapping for Quantum Optimization on Frustrated Ising Rings — arXiv:2608.12213

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.12213
License (as archived)
CC0-1.0
Archived
2026-10-19T05:54:29.923Z
SHA-256 of the archived text
673b549b61012ff5ad00543561e2563de238ac386158dbbc820d3187f68dd5c0
Stable URL of this page
https://metraipolis.com/documento/dc_013ce3d3e1fe

How to cite

Parity Mapping for Quantum Optimization on Frustrated Ising Rings — arXiv:2608.12213 — arXiv (en), https://arxiv.org/abs/2608.12213 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_013ce3d3e1fe (Metraipolis archive dc_013ce3d3e1fe, sha256 673b549b61012ff5ad00543561e2563de238ac386158dbbc820d3187f68dd5c0)
BibTeX
@misc{dc013ce3d3e1fe,
  title = {Parity Mapping for Quantum Optimization on Frustrated Ising Rings — arXiv:2608.12213},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.12213},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_013ce3d3e1fe; sha256 673b549b61012ff5ad00543561e2563de238ac386158dbbc820d3187f68dd5c0},
  year = {2026}
}

Archived text

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

The frustrated Ising ring is one of the simplest models exhibiting exponential closing spectral gaps, making it a paradigmatic and challenging benchmark for quantum annealing (QA). Ground-state preparation for this model has therefore been studied extensively in both continuous-time QA and digitized protocols such as the Quantum Approximate Optimization Algorithm (QAOA). Here, we use the frustrated Ising ring to investigate how the parity mapping affects the performance of both QA and QAOA. For QA, finite-size calculations show that the parity mapping increases the minimum spectral gap under the energy normalization used in this work, thereby enabling faster continuous-time ground state preparation protocols. An ideal implementation of Parity-QA, with a single global constraint, shows no evidence of exponential gap closing over the accessible system sizes, whereas a hardware-motivated decomposition into local constraints restores the exponential decrease, albeit with a smaller fitted exponent than conventional QA. For the digitized protocol, we find that the number of Parity-QAOA layers required to prepare the exact ground state remains constant over the simulated sizes, improving upon the quadratic scaling required by conventional QAOA. To investigate the role of constraints in Parity-QAOA, we further consider a modified Ising ring instance in which the constraint term is essential for preparing the target ground state. We then compare the corresponding resource requirements with those of conventional QAOA.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-08-13 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2608.12213 — 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-10-19T05:50:27.099Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-08-13?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).