Quantum Algorithm for Hilbert's Tenth Problem

International Journal of Theoretical Physics

Volumn 42, Issue 7, 2003, Pages 1461-1478

  Kieu, Tien D ^a  

^a SWINBURNE UNIVERSITY OF TECHNOLOGY   (Australia)

Author keywords

Computability; Hypercomputation; Quantum adiabatic computation; Quantum algorithms

Indexed keywords

EID: 0347756905     PISSN: 00207748     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1025780028846     Document Type: Article

References (27)

1. Benioff, P. (1980). The computer as a physical system. Journal of Statistical Physics 22, 563-591.
2. Bernstein, E. and Vazirani, U. (1997). Quantum complexity theory. SIAM Journal of Computing 26, 1411.
3. Braunstein, S. (1998). Error correction for continuous variables. Physical Review Letters 80, 4084.
4. Calude, C. S. and Pavlov, B. (2001). Coins, quantum measurements and Turing's barrier. Preprint quant-ph/0112087.
5. Childs, A. M., Farhi, E., and Preskill, J. (2001). Robusteness of adiabatic quantum computation. Preprint quant-ph/0108048.
6. Davis, M. (1982). Computability and Unsolvability, Dover, New York.
7. Etesi, G. and Németi, I. (2001). Non-Turing computations via Malament-Hogarth space-times, gr-qc/0104023.
8. Farhi, E., Goldstone, J., Gutmann, S., and Sipser, M. (2000). Quantum computation by adiabatic evolution. Preprint quant-ph/0001106.
9. Feynman, R. P. (1982). Simulating physics with computers. International Journal of Theoretical Physics 21, 467.
10. Grover, L. K. (1997). Quantum mechanics helps in searching for a needle in a haystack. Physical Review Letters 79, 325-328.
11. Itzykson, C. and Zuber, J.-B. (1985). Quantum Field Theory, McGraw-Hill, New York.
12. Kadowaki, T. and Nishimori, H. (1998). Quantum annealing in the transverse Ising model. Physical Review E 58, 5355.
13. Kieu, T. D. (2001a). A reformulation of the Hilbert's tenth problem through Quantum Mechanics. Preprint quant-ph/0111063.
14. Kieu, T. D. (2001b). Gödel's Indompleteness, Chaitin's Ω and Quantum Physics, quant-ph/0111062.
15. Kieu, T. D. (2002). Computing the noncomputable. Contemporary Physics 44, 51-71.
16. Kieu, T. D. (2003). Numerical simulations of a quantum algorithm for Hilbert's tenth problem. Preprint quant-ph/0304114.
17. Lloyd, S. and Braunstein, S. L. (1999). Quantum computation over continuous variables. Physical Review Letters 82, 1784.
18. Matiyasevich, Y. V. (1993). Hilbert's Tenth Problem, MIT Press, Cambridge, MA.
19. Nielsen, M. A. (1997). Computable functions, quantum measurements, and quantum dynamics, Physical Review, Letters 79, 2915-2918.
20. Nielsen, M. and Chuang, I. L. (2000). Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, UK.
21. Ord, T. and Kieu, T. D. (2003). The diagonal method and hypercomputation. Preprint math-LO/0307020.
22. Ozawa, M. (1998). Measurability and computability. Preprint quant-ph/9809048.
23. Renyi, A. (1970). Probability Theory, North-Holland, New York.
24. Rogers, H., Jr. (1987). Theory of Recursive Functions and Effective Computability, MIT Press, Cambridge, MA.
25. Ruskai, M. B. (2002). Comments on adiabatic quantum algorithms. Preprint quant-ph/0203127.
26. Shor, P. W. (1997). Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal of Computing 26, 1484-1509.
27. Wooters, W. K. and Zurek, W. H. (1982). A single quantum cannot be cloned. Nature 299, 802-803.