Metraipolis › archive › dc_812f2d95ff09
SUTURE: Syndrome-Guided Repair for Segmented Feasibility-Preserving VQAs on Noisy Hardware — arXiv:2609.13935
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.13935
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T02:24:16.744Z
- SHA-256 of the archived text
2d5cc40edfda2c9ce5bd86b5947fa7dc147a12b41fc41349af5b24555f058a48- Stable URL of this page
https://metraipolis.com/documento/dc_812f2d95ff09
How to cite
SUTURE: Syndrome-Guided Repair for Segmented Feasibility-Preserving VQAs on Noisy Hardware — arXiv:2609.13935 — arXiv (en), https://arxiv.org/abs/2609.13935 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_812f2d95ff09 (Metraipolis archive dc_812f2d95ff09, sha256 2d5cc40edfda2c9ce5bd86b5947fa7dc147a12b41fc41349af5b24555f058a48)
BibTeX
@misc{dc812f2d95ff09,
title = {SUTURE: Syndrome-Guided Repair for Segmented Feasibility-Preserving VQAs on Noisy Hardware — arXiv:2609.13935},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.13935},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_812f2d95ff09; sha256 2d5cc40edfda2c9ce5bd86b5947fa7dc147a12b41fc41349af5b24555f058a48},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.13935. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Constrained binary optimization is a representative class of NP-hard problems in scheduling, resource allocation, and finance. Segmented feasibility-preserving variational quantum algorithms (VQAs) are a promising approach that restricts ideal circuit evolution to feasible assignments and executes short measure-and-reseed segments. The existing boundary runtime enforces feasibility through purification, which discards measurements that violate the constraints. As problem size and noise increase, feasible measurements become rare; if no shot survives, the execution chain terminates. In our 72-qubit graph-coloring experiment on a real-device IBM Heron, 11 of 12 purification chains terminate before completing all segments. We propose SUTURE: syndrome-guided repair, a runtime that repairs infeasible measurements instead of discarding them and is deployable on current quantum devices. SUTURE exploits a parity-check-like structure induced by the problem constraints: violated constraints form a syndrome that detects and localizes corruption and, under suitable structural conditions, often identifies a correction. SUTURE combines three stages: (1) a compile-time profiler that uses the compiled constraints and feasible initialization samples to predict single-flip recovery, with a maximum error of 0.011 across four constraint families; (2) a bounded runtime decoder that replaces purification inside the segmented execution loop; and (3) a regime analysis that identifies when repair is preferable to purification. In simulation up to 120 qubits, SUTURE continues the execution chain far beyond the noise level at which purification collapses. In the same 72-qubit experiment on IBM Heron hardware, SUTURE completes all segments in all 12 runs, and hardware timing experiment, decoding adds 1.6% to execution-path latency and less than 1% to total pipeline latency. Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-15 in quant-ph). Categorie arXiv: Quantum Physics (quant-ph). Pagina del lavoro: https://arxiv.org/abs/2609.13935 — 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-16T01:57:57.002Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).