Quantum Algorithm for Hilbert's Tenth Problem
| dc.creator | Kieu, Tien D | |
| dc.date | 2001-10-24 | |
| dc.date | 2003-10-08 | |
| dc.date.accessioned | 2026-07-07T06:02:54Z | |
| dc.date.available | 2026-07-07T06:02:54Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0110136 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0110136 | |
| dc.identifier | Int.J.Theor.Phys. 42 (2003) 1461-1478 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/89788 | |
| dc.subject | Quantum Physics | |
| dc.subject | Logic in Computer Science | |
| dc.subject | High Energy Physics - Theory | |
| dc.subject | Logic | |
| dc.subject | Number Theory | |
| dc.title | Quantum Algorithm for Hilbert's Tenth Problem | |
| dc.type | text |