CNOT-Distance, deciding whether a given invertible binary matrix can be implemented with at most K CNOT gates under all-to-all connectivity, is NP-complete.
We first prove the decision result and its ancillary vari- ants, and then derive hardness for exact computation, fixed-additive approximation, and multiplicative approx- imation
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2026 1verdicts
ACCEPT 1roles
background 1polarities
support 1representative citing papers
citing papers explorer
-
CNOT-Distance is NP-complete under all-to-all connectivity
CNOT-Distance, deciding whether a given invertible binary matrix can be implemented with at most K CNOT gates under all-to-all connectivity, is NP-complete.