Despite the recursive non-computability of Hilbert's tenth problem, we outline and argue for a quantum algorithm that is based on the Quantum Adiabatic Theorem. It is explained how this algorithm can solve Hilbert's tenth problem. The algorithm is then considered in the context of several "no-go" arguments against such hypercomputation. Logical arguments are usually based on Cantor's diagonal technique used for proving non-computability of the Turing halting problem, which is related to Hilbert's tenth problem. Physical arguments are related to the limited computability of a class of quantum computation based on qubits and dimensionally finite quantum logical gates. © 2003 Elsevier B.V. All rights reserved.
Kieu, T. D. (2004). Hypercomputation with quantum adiabatic processes. In Theoretical Computer Science (Vol. 317, pp. 93–104). https://doi.org/10.1016/j.tcs.2003.12.006