Can quantum computing solve classically unsolvable problems?
量子物理
2007-05-23 v1
摘要
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.
引用
@article{arxiv.quant-ph/0512248,
title = {Can quantum computing solve classically unsolvable problems?},
author = {Andrew Hodges},
journal= {arXiv preprint arXiv:quant-ph/0512248},
year = {2007}
}