Entanglement-Aware Quantum Circuit Optimization through Globally Optimal Partitioning
Abstract
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.
Related
- Towards Reproducible Evaluation of Distributed Quantum Circuit Partitioning Algorithms
- Fourier-Geometric Circuit Design for Gate and Entanglement Placement in Quantum Neural Networks
- Entanglement-Capability-Aware Finite-Bond Circuit Cutting for Distributed Quantum Computing
- Bridge of Ψ's: Quantum Circuit Optimization with Schrödinger Bridges
- Circuit Design Problems in Binary Polynomial Quantum Optimization
BibTeX
@misc{morse2026entanglementaware,
title = {{Entanglement-Aware Quantum Circuit Optimization through Globally Optimal Partitioning}},
author = {Gregory Morse and Muhammad Al Farizi and Jakab Nádori and László Hajas and Tamás Kozsik and Peter Rakyta},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.03845},
eprint = {2611.03845},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.03845},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Entanglement-Aware Quantum Circuit Optimization through Globally Optimal Partitioning
AU - Gregory Morse
AU - Muhammad Al Farizi
AU - Jakab Nádori
AU - László Hajas
AU - Tamás Kozsik
AU - Peter Rakyta
PY - 2026
DA - 2026/11/02
PB - arXiv
DO - 10.48550/arxiv.2611.03845
UR - https://arxiv.org/abs/2611.03845
AB - 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.
ER -