Metraipolis › archive › dc_58d6aabdfcde

Scaling Quantum Optimization to the Thousand-Qubit Scale with Distributed Quantum Sampling — arXiv:2610.10772

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.10772
License (as archived)
CC0-1.0
Archived
2026-10-09T06:28:10.384Z
SHA-256 of the archived text
3abe4a4f4c732bd5576f4731ea8f385b2f8eb89ff94fba0b6837408221d4d59e
Stable URL of this page
https://metraipolis.com/documento/dc_58d6aabdfcde

How to cite

Scaling Quantum Optimization to the Thousand-Qubit Scale with Distributed Quantum Sampling — arXiv:2610.10772 — arXiv (en), https://arxiv.org/abs/2610.10772 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_58d6aabdfcde (Metraipolis archive dc_58d6aabdfcde, sha256 3abe4a4f4c732bd5576f4731ea8f385b2f8eb89ff94fba0b6837408221d4d59e)
BibTeX
@misc{dc58d6aabdfcde,
  title = {Scaling Quantum Optimization to the Thousand-Qubit Scale with Distributed Quantum Sampling — arXiv:2610.10772},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.10772},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_58d6aabdfcde; sha256 3abe4a4f4c732bd5576f4731ea8f385b2f8eb89ff94fba0b6837408221d4d59e},
  year = {2026}
}

Archived text

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

The Minimum Birkhoff Decomposition (MBD) seeks a sparse weighted sum of matchings and is a challenging optimization problem with applications in network scheduling and energy trading. We scale a quantum-assisted decomposition method by combining single-layer QAOA sampling with Extended Fully-Corrective Frank-Wolfe (E-FCFW) optimization, spectral graph partitioning, and greedy feasibility repair. We demonstrate the pipeline on the 1,354-node PEGASE bus test case (representing a 1,354-bus transmission grid with 1,710 transmission lines), whose 1,710 edges define a native 1,710-variable matching optimization problem requiring 1,710 qubits in the unpartitioned encoding. Partitioning enables distributed execution on IBM superconducting quantum processors. The best reported hardware result uses a 50-qubit partition bound, while reducing partitions to 20 qubits degrades convergence in the partition-size comparison. Larger partitions are more demanding for matrix product state (MPS) simulation, and bond-dimension tests show that truncating quantum correlations reduces candidate quality. The results therefore motivate retaining a substantive quantum sampling task within each partition as the overall problem scales. On the PEGASE-1354 benchmark, repaired QAOA samples achieve lower residual decomposition error than both simulated annealing and uniform random sampling baselines, while spatial circuit packing reduces hardware execution time by approximately a factor of three. These results demonstrate that combining spectral partitioning, spatial circuit packing, and classical feasibility repair provides an executable path for deploying gate-based quantum sampling on thousand-variable constrained optimization problems on current hardware.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph) ; Emerging Technologies (cs.ET); Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2610.10772 — 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-09T05:52:31.691Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).