Metraipolis › archive › dc_54d2daab132a

Entanglement-Aware Quantum Circuit Optimization through Globally Optimal Partitioning — arXiv:2611.03845

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.03845
License (as archived)
CC0-1.0
Archived
2026-11-04T13:01:39.286Z
SHA-256 of the archived text
6a0a6fdf133c2d29bd6e08846115f9e6cc77c32bdb0989cb9878dac16b25879c
Stable URL of this page
https://metraipolis.com/documento/dc_54d2daab132a

How to cite

Entanglement-Aware Quantum Circuit Optimization through Globally Optimal Partitioning — arXiv:2611.03845 — arXiv (en), https://arxiv.org/abs/2611.03845 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_54d2daab132a (Metraipolis archive dc_54d2daab132a, sha256 6a0a6fdf133c2d29bd6e08846115f9e6cc77c32bdb0989cb9878dac16b25879c)
BibTeX
@misc{dc54d2daab132a,
  title = {Entanglement-Aware Quantum Circuit Optimization through Globally Optimal Partitioning — arXiv:2611.03845},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.03845},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_54d2daab132a; sha256 6a0a6fdf133c2d29bd6e08846115f9e6cc77c32bdb0989cb9878dac16b25879c},
  year = {2026}
}

Archived text

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

We introduce a scalable framework for globally optimal quantum-circuit partitioning and entanglement-aware block resynthesis. The partitioning problem is formulated as an integer linear program over qubit-feasible convex subcircuits, supporting objectives such as minimizing the number of partitions or a weighted execution cost. The resulting partition selection is exact over the enumerated feasible candidates and their computed costs when the ILP is solved to proven optimality. The selected partitions are resynthesized using an operator-Schmidt rank (OSR) based synthesis technique, which exploits their internal entanglement structure. We compare the end-to-end integer linear programming (ILP)--OSR workflow with BQSKit while identifying their different routing methods, and separately compare local OSR and BQSKit synthesis on matched three- and four-qubit unitaries. On the frozen sample of 772 local unitary targets, OSR produces 741 verified syntheses versus 617 for BQSKit, and matches or improves the CNOT count in all 617 jointly verified pairs. These results demonstrate that globally optimal partition selection combined with entanglement-aware resynthesis improves circuit quality and extends block-based optimization to problem sizes that are impractical for existing optimization workflows.

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.03845 — 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-04T12:36:48.020Z dalla pagina https://arxiv.org/list/quant-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).