Numerical simulations of a quantum algorithm for Hilbert's tenth problem
<|reference_start|>Numerical simulations of a quantum algorithm for Hilbert's tenth problem: We employ quantum mechanical principles in the computability exploration of the class of classically noncomputable Hilbert's tenth problem which is equivalent to the Turing halting problem in Computer Science. The Quantum Adiabatic Theorem enables us to establish a connection between the solution for this class of problems and the asymptotic behaviour of solutions of a particular type of time-dependent Schr\"odinger equations. We then present some preliminary numerical simulation results for the quantum adiabatic processes corresponding to various Diophantine equations.<|reference_end|>
@article{kieu2003numerical,
    title={Numerical simulations of a quantum algorithm for Hilbert's tenth problem},
    author={Tien D Kieu},
    journal={in Proceedings of SPIE Vol. 5105 Quantum Information and
  Computation, edited by Eric Donkor, Andrew R. Pirich, Howard E. Brandt,
  (SPIE, Bellingham, WA, 2003), pp. 89-95.},
    year={2003},
    doi={10.1117/12.486889},
    archivePrefix={arXiv},
    eprint={quant-ph/0304114},
    primaryClass={quant-ph cs.LO math.LO math.NT}
}