Optimal partitioning of quantum circuits using gate cuts and wire cuts

· 2023

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

browse 1 citing papers

representative citing papers

quant-ph · 2026-04-26 · unverdicted · novelty 7.0

Optimal quantum circuit cutting to minimize cuts is NP-complete, with an SMT solver for bounded-size partitions.

Showing 1 of 1 citing paper.

Quantum Circuit Cutting: Complexity and Optimization quant-ph · 2026-04-26 · unverdicted · none · ref 15
Optimal quantum circuit cutting to minimize cuts is NP-complete, with an SMT solver for bounded-size partitions.