Can quantum computing solve classically unsolvable problems?

Simple item page
dc.creatorHodges, Andrew
dc.date2005-12-29
dc.date.accessioned2026-07-07T07:00:11Z
dc.date.available2026-07-07T07:00:11Z
dc.descriptionT. 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.
dc.identifierhttps://arxiv.org/abs/quant-ph/0512248
dc.identifierhttp://arxiv.org/abs/quant-ph/0512248
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/107979
dc.subjectQuantum Physics
dc.titleCan quantum computing solve classically unsolvable problems?
dc.typetext

Files

Collections

arXiv