Metraipolis › archive › dc_bdab2cdd0b20

Leaving Quantum Bias on the Table: Pushforwards as a Path to Quantum Advantage in Constrained Optimization — arXiv:2611.00759

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.00759
License (as archived)
CC0-1.0
Archived
2026-11-03T11:39:18.646Z
SHA-256 of the archived text
9324e61dca2b82d1df14bac162076ddcfcefbec3f3f6b5314c4163760115247f
Stable URL of this page
https://metraipolis.com/documento/dc_bdab2cdd0b20

How to cite

Leaving Quantum Bias on the Table: Pushforwards as a Path to Quantum Advantage in Constrained Optimization — arXiv:2611.00759 — arXiv (en), https://arxiv.org/abs/2611.00759 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bdab2cdd0b20 (Metraipolis archive dc_bdab2cdd0b20, sha256 9324e61dca2b82d1df14bac162076ddcfcefbec3f3f6b5314c4163760115247f)
BibTeX
@misc{dcbdab2cdd0b20,
  title = {Leaving Quantum Bias on the Table: Pushforwards as a Path to Quantum Advantage in Constrained Optimization — arXiv:2611.00759},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.00759},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bdab2cdd0b20; sha256 9324e61dca2b82d1df14bac162076ddcfcefbec3f3f6b5314c4163760115247f},
  year = {2026}
}

Archived text

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

Constrained quantum samplers often produce infeasible outputs that retain information about good feasible solutions. We develop a post-measurement framework that constructs problem-dependent classical feasibility maps from constraint-violation statistics and pushes the raw quantum sampling law forward onto the feasible set. The probability of each repaired solution is the total raw mass of its repair preimage, enlarging the successful sampling event from a target feasible set to its full repair preimage. We derive exact identities for repaired success and expected cost, and separate repair-basin geometry from sampler-dependent probability concentration. For noisy implementations, we distinguish leakage from the encoded subspace from concentration loss within it. For permutation constraints, Hungarian maximum-overlap repair provides an O(n^3) implementation, which we study on traveling-salesman problems (TSP). We derive conditional repaired-success bounds and quantify how basin aggregation reduces the absolute-transfer budget required by these bounds. Noiseless simulations show that optimal repair basins contain selectively overweighted infeasible contributors. For an n=10 TSP instance, pushforward repair recovered the optimum using approximately 10^3 shots, compared with 10^6 shots in the original CE-QAOA workflow without repair. On a 127-qubit IBM processor, using encodings of up to 100 qubits, repaired candidates match reference tours on smaller benchmarks and improve them on larger instances. These results establish concentration of quantum probability on useful repair preimages as a design principle for constrained quantum optimization.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph) ; Computational Complexity (cs.CC); Information Theory (cs.IT); Mathematical Physics (math-ph).
Pagina del lavoro: https://arxiv.org/abs/2611.00759 — 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-03T11:05:37.209Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).