Clifford synthesis is NP-complete

@misc{jorgensen2026clifford,
  title = {{Clifford synthesis is NP-complete}},
  author = {Søren Fuglede Jørgensen},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.40886},
  eprint = {2610.40886},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.40886},
}

TY  - UNPB
TI  - Clifford synthesis is NP-complete
AU  - Søren Fuglede Jørgensen
PY  - 2026
DA  - 2026/10/29
PB  - arXiv
DO  - 10.48550/arxiv.2610.40886
UR  - https://arxiv.org/abs/2610.40886
AB  - We show that the problem of synthesizing a quantum circuit for a given Clifford operator using at most a specified amount of resources is NP-complete for several resource models of practical interest. Specifically, we study synthesis of a given Clifford operator using single-qubit Clifford gates and two-qubit Clifford gates, with full qubit connectivity and no additional ancilla qubits. With single-qubit gates free and CNOT as the only two-qubit gate, we show that deciding whether a given target admits an implementation using at most a specified number of CNOT gates is NP-complete, and we show that the problem remains NP-complete when any two-qubit Clifford gate is allowed and the budget counts all such gates. Moreover, we show that both results continue to hold when SWAP gates may be inserted for free, and when single-qubit gates are also considered part of the budget. In each case, we build on recent work by Li and Guan and show that there are polynomial-time reductions from Hamiltonian path in grid graphs to these decision problems, using a number of qubits quadratic in the number of grid vertices.
ER  -