dorsal/arxiv
View SchemaCan quantum computing solve classically unsolvable problems?
| Authors | Andrew Hodges |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0512248 |
| URL | https://arxiv.org/abs/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.
{
"annotation_id": "8fd87678-93c9-4e07-bcaf-e4027dd21ccb",
"date_created": "2026-03-02T18:02:23.775000Z",
"date_modified": "2026-03-02T18:02:23.775000Z",
"file_hash": "f57b43f899127103a6dcf859e2cfde2c6748ebb83b3ece92b073a3d6cffa4f19",
"private": false,
"record": {
"abstract": "T. D. Kieu has claimed that a quantum computing procedure can solve a\nclassically unsolvable problem. Recent work of W. D. Smith has shown that\nKieu\u0027s central mathematical claim cannot be sustained. Here, a more general\ncritique is given of Kieu\u0027s proposal and some suggestions are made regarding\nthe Church-Turing thesis.",
"arxiv_id": "quant-ph/0512248",
"authors": [
"Andrew Hodges"
],
"categories": [
"quant-ph"
],
"title": "Can quantum computing solve classically unsolvable problems?",
"url": "https://arxiv.org/abs/quant-ph/0512248"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "a9fcfc9d-07d4-43b6-8744-e489dd89b268",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}