Optimal quantum circuit cutting to minimize cuts is NP-complete, with an SMT solver for bounded-size partitions.
Complexity results for multiprocessor scheduling under resource constraints
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Quantum Circuit Cutting: Complexity and Optimization
Optimal quantum circuit cutting to minimize cuts is NP-complete, with an SMT solver for bounded-size partitions.