Can quantum computing solve classically unsolvable problems?
arXiv:quant-ph/0512248
Abstract
T. D. Kieu has claimed that a quantum computing procedure can solve a classically unsolvable problem. Recent work of W. D. Smith has shown that Kieu's central mathematical claim cannot be sustained. Here, a more general critique is given of Kieu's proposal and some suggestions are made regarding the Church-Turing thesis.
References in corpus (7)
- Quantum Computation by Adiabatic Evolution
- Hypercomputation: computing more than the Turing machine
- A fast quantum mechanical algorithm for database search
- A reformulation of Hilbert's tenth problem through Quantum Mechanics
- Quantum adiabatic algorithm for Hilbert's tenth problem: I. The algorithm
- Quantum Algorithm for Hilbert's Tenth Problem
- An anatomy of a quantum adiabatic algorithm that transcends the Turing computability