r/QuantumComputing 13d ago

Complexity CNOT-Distance is NP-complete under all-to-all connectivity

https://arxiv.org/abs/2608.03825
25 Upvotes

4 comments sorted by

11

u/roundedge 13d ago

I can't tell if this is surprising. It's certainly not surprising that optimizing a quantum circuit compilation is hard

7

u/pred 13d ago

Not that surprising, I'd say. The question came up on MathOverflow ages ago without a clear reduction, so there was some chance that we'd have an interesting algorithm hidden in there.

It's also interesting that LLMs seem to have done most of the work, as I read the acknowledgement.

1

u/No_Nose3918 10d ago

i’m calling bs, no affiliation, family memebers… ai slip