Metraipolis › archive › dc_3ddc04fe1aa6
QASPA-MaxCut on Unweighted Graphs: Edge Encoding and QAOA Restarts — arXiv:2611.06698
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.06698
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-05T18:33:00.311Z
- SHA-256 of the archived text
23da64c948a9c7aac58a97c7b6b63b0850e82208425ee2e9f77dc5b29867f9ff- Stable URL of this page
https://metraipolis.com/documento/dc_3ddc04fe1aa6
How to cite
QASPA-MaxCut on Unweighted Graphs: Edge Encoding and QAOA Restarts — arXiv:2611.06698 — arXiv (en), https://arxiv.org/abs/2611.06698 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3ddc04fe1aa6 (Metraipolis archive dc_3ddc04fe1aa6, sha256 23da64c948a9c7aac58a97c7b6b63b0850e82208425ee2e9f77dc5b29867f9ff)
BibTeX
@misc{dc3ddc04fe1aa6,
title = {QASPA-MaxCut on Unweighted Graphs: Edge Encoding and QAOA Restarts — arXiv:2611.06698},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.06698},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3ddc04fe1aa6; sha256 23da64c948a9c7aac58a97c7b6b63b0850e82208425ee2e9f77dc5b29867f9ff},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.06698. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Max-Cut is a common testbed for near-term quantum optimization because it has a simple Ising Hamiltonian, established classical baselines, and a parameterized quantum circuit whose performance depends on the outer classical optimizer. This paper develops QASPA-MaxCut, a shift-phase circuit for Max-Cut that encodes graph edges through controlled $R_y$ rotations of the form $\mathrm{CX}_{ij}R_y(\theta_{ij})\mathrm{CX}_{ij}$. We derive the exact two-qubit algebra of the edge block, trace an unweighted four-vertex example, and compare one-layer QASPA-MaxCut with depth-one QAOA by exact state-vector simulation. The protocol uses seed 42, evaluates connected backbone-augmented random graphs with additional-edge probabilities $p_{\mathrm{edge}}\in\{0.1,0.3,0.5,0.7\}$, and adds nineteen custom unweighted topologies. The QASPA-MaxCut score is reported after the algorithm's classical selection stage: the four leading QASPA bit strings are evaluated by the Max-Cut objective, and the best cut is retained. The QAOA score is the expected approximation ratio after local optimization, reported as a best-of-$k$ curve over one to ten restarts. In these small exact simulations, fixed-angle QASPA-MaxCut produces reported group-mean selection ratios between $0.955$ and $1.000$, the topology-level readout is unchanged in the retained finite-shot checks under the rule $\lceil 0.03047\cdot 2^n+1016.2\rceil$, and depth-one QAOA improves with additional classical restarts while remaining lower than the QASPA selection score in the reported mean summaries. This comparison motivates further study of the classical search budget needed to obtain competitive Max-Cut samples at shallow circuit depth.
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.06698 — 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-05T18:22:49.025Z dalla pagina https://arxiv.org/list/quant-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).