30 citations · 34 across the 6 of their papers we have counts for
1 paper · 2 filters
Christoph M. Kirsch, Stefanie Muroya Lei
We show that the algorithmic complexity of any classical algorithm written in a Turing-complete programming language polynomially bounds the number of quantum bits that are require…