arXiv:2611.03845v1 Announce Type: new 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.
Quantum Research · 2026-11-04
Entanglement-Aware Quantum Circuit Optimization through Globally Optimal Partitioning
arXiv:2611.03845v1 Announce Type: new 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.
Source and attribution
Original source: arXiv Quantum ↗
This is an attributed editorial digest. For the complete study and original reporting, follow the source link.
Reader feedback
0 likes · 0 dislikes