dorsal/arxiv
View SchemaQuantum Algorithm for Hilbert's Tenth Problem
| Authors | Tien D Kieu |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0110136 |
| URL | https://arxiv.org/abs/quant-ph/0110136 |
| Journal | Int.J.Theor.Phys. 42 (2003) 1461-1478 |
Abstract
We explore in the framework of Quantum Computation the notion of {\em Computability}, which holds a central position in Mathematics and Theoretical Computer Science. A quantum algorithm for Hilbert's tenth problem, which is equivalent to the Turing halting problem and is known to be mathematically noncomputable, is proposed where quantum continuous variables and quantum adiabatic evolution are employed. If this algorithm could be physically implemented, as much as it is valid in principle--that is, if certain hamiltonian and its ground state can be physically constructed according to the proposal--quantum computability would surpass classical computability as delimited by the Church-Turing thesis. It is thus argued that computability, and with it the limits of Mathematics, ought to be determined not solely by Mathematics itself but also by Physical Principles.
{
"annotation_id": "837bb57d-134e-4225-a523-fd1869b72b87",
"date_created": "2026-03-02T18:01:46.119000Z",
"date_modified": "2026-03-02T18:01:46.119000Z",
"file_hash": "287ac2d97b234e684c1b676072765bc0b8ab03b4725a53a4d61b98c54c91ca44",
"private": false,
"record": {
"abstract": "We explore in the framework of Quantum Computation the notion of {\\em\nComputability}, which holds a central position in Mathematics and Theoretical\nComputer Science. A quantum algorithm for Hilbert\u0027s tenth problem, which is\nequivalent to the Turing halting problem and is known to be mathematically\nnoncomputable, is proposed where quantum continuous variables and quantum\nadiabatic evolution are employed. If this algorithm could be physically\nimplemented, as much as it is valid in principle--that is, if certain\nhamiltonian and its ground state can be physically constructed according to the\nproposal--quantum computability would surpass classical computability as\ndelimited by the Church-Turing thesis. It is thus argued that computability,\nand with it the limits of Mathematics, ought to be determined not solely by\nMathematics itself but also by Physical Principles.",
"arxiv_id": "quant-ph/0110136",
"authors": [
"Tien D Kieu"
],
"categories": [
"quant-ph",
"cs.LO",
"hep-th",
"math.LO",
"math.NT"
],
"journal_ref": "Int.J.Theor.Phys. 42 (2003) 1461-1478",
"title": "Quantum Algorithm for Hilbert\u0027s Tenth Problem",
"url": "https://arxiv.org/abs/quant-ph/0110136"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "ee510565-82c9-4b06-9ba8-c9eae7e5e34a",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}