Metraipolis › archive › dc_fc5dca3b89eb

Two-Stage Quantum-Classical Distribution Network Reconfiguration via Cycle-Edge Encoding — arXiv:2609.40264

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.40264
License (as archived)
CC0-1.0
Archived
2026-10-07T15:22:29.544Z
SHA-256 of the archived text
b46df8e2ba865e7ebb155d3a0b3056b633fe094672d6e99b326f8758e3b3ba79
Stable URL of this page
https://metraipolis.com/documento/dc_fc5dca3b89eb

How to cite

Two-Stage Quantum-Classical Distribution Network Reconfiguration via Cycle-Edge Encoding — arXiv:2609.40264 — arXiv (en), https://arxiv.org/abs/2609.40264 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fc5dca3b89eb (Metraipolis archive dc_fc5dca3b89eb, sha256 b46df8e2ba865e7ebb155d3a0b3056b633fe094672d6e99b326f8758e3b3ba79)
BibTeX
@misc{dcfc5dca3b89eb,
  title = {Two-Stage Quantum-Classical Distribution Network Reconfiguration via Cycle-Edge Encoding — arXiv:2609.40264},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.40264},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fc5dca3b89eb; sha256 b46df8e2ba865e7ebb155d3a0b3056b633fe094672d6e99b326f8758e3b3ba79},
  year = {2026}
}

Archived text

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

Distribution network reconfiguration (DNR) is a combinatorial optimization problem that seeks a low-loss network topology subject to topological and electrical operating constraints. In this work, we propose a two-stage quantum-classical method for DNR. First, an iterative linear-ramp Quantum Alternating Operator Ansatz (LR-QAOA) searches topologically feasible subspaces constructed using a novel cycle-edge encoding. The encoding guarantees that every represented configuration is a spanning tree while allowing the size and coverage of each subspace to be adjusted to the available qubit budget. Second, the resulting sample distribution is used to guide a mixed-integer second-order-cone programming (MISOCP) solver. The method is evaluated on six distribution networks ranging from 33 to 417 buses through simulation and execution on trapped-ion quantum hardware. Across all six test systems, the MISOCP solver guided by hardware-derived distributions reaches an incumbent within 1\% of the best-known solution in less median solver time than the corresponding unguided solver.

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