Quantum hypercomputation

Minds and Machines

Volumn 12, Issue 4, 2002, Pages 541-561

  Kieu, Tien D ^a  

^a SWINBURNE UNIVERSITY OF TECHNOLOGY   (Australia)

Author keywords

Hilbert's tenth problem; Quantum adiabatic theorem; Quantum computation

Indexed keywords

COMPUTABILITY AND DECIDABILITY; EIGENVALUES AND EIGENFUNCTIONS; HAMILTONIANS; MATRIX ALGEBRA; PARTIAL DIFFERENTIAL EQUATIONS; PROBABILITY DISTRIBUTIONS; QUANTUM THEORY; TURING MACHINES;

HILBERT TENTH PROBLEM; QUANTUM ADIABATIC THEOREM; QUANTUM HYPERCOMPUTATION;

ALGORITHMS;

EID: 0036868306     PISSN: 09246495     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1021130831101     Document Type: Article

References (39)

1. Bell, J.S. (1987), Speakable and Unspeakable in Quantum Mechanics, Cambridge: Cambridge University Press.
2. Benioff, P. (1980), 'The Computer as a Physical System.' Journal of Statistical Physics 22, pp. 563-591.
3. Bernstein, E. and Vazirani, U. (1997), Quantum Complexity Theory. SIAM Journal on Computing 26, pp. 1411.
4. Calude, C.S. and Paun, G. (2001), Computing with Cells and Atoms, Oxford: Taylor and Francis.
5. Calude, C.S. and Pavlov, B. (2001), 'Coins, Quantum Measurements and Turing's Barrier', Archive quant-ph/0112087.
6. Casti, J.L. (2001), Mathematical Mountaintops, Oxford/New York: Oxford University Press.
7. Chaitin, G.J. (1992), Algorithmic Information Theory, Cambridge: Cambridge University Press.
8. Copeland, B.J. and Sylvan, R. (1999), Beyond the Universal Turing Machine', Australasian Journal of Philosophy 77, 46-66.
9. Davis, M. and Hersh, R. (1973), 'Hilbert's 10th Problem', Scientific American, pp. 84-91.
10. Davis, M. (1982), Computability and Unsolvability, New York: Dover.
11. Davis, M. (2000), Engines of Logic, New York: Norton.
12. Deutsch, D., Ekert, A. and Lupacchini, R. (2000), 'Machines, Logic and Quantum Physics', The Bulletin of Symbolic Logic 6, pp. 265-283. See also a review of this paper by E. Knill on http://quickreviews.org/cgi/display.cgi?reviewID=knill.bsl.6.265
13. Enk, S.J. van and Fuchs, C.A. (2001), Archive quant-ph/0111157.
14. Etesi, G. and Németi, I. (2001), 'Non-Turing Computations via Malament-Hogarth Space-times', Archive gr-qc/0104023.
15. Farhi, E., Goldstone, J., Gutmann, S. and Sipser, M. (2000), 'Quantum Computation by Adiabatic Evolution', Archive quant-ph/0001106.
16. Feynman, R.P. (1982), 'Simulating Physics with Computers' International Journal of Theoretical Physics 21, pp. 467.
17. Gandy, R.O. (1980), 'Church's Thesis and Principles for Mechanisms', in J. Barwise, H.J. Keisler and K. Kunen, eds. The Kleene Symposium, Amsterdam: North-Holland
18. Gandy, R.O. (1993) On the impossibility of using analogue machines to calculate non-computable functions, (Gandy handed this paper to Jack Copeland about two weeks before he died, I am grateful to Jack Copeland for giving me access to this hand-written manuscript.)
19. Geroch, R., and Hartle, J.B. (1986), 'Computability and Physical Theories', J. Found. Phys. 16, pp. 533-550.
20. Grover, L.K. (1997), 'Quantum Mechanics Helps in Searching for a Needle in a Haystack', Physical Review Letters. 79, pp. 325-328.
21. Guillen, M. (1983), Bridges to Infinity, Rider & Company.
22. Kieu, T.D. (2001a), 'Quantum Algorithm for the Hilbert's Tenth Problem', Archive quant-ph/0110136.
23. Kieu, T.D. (2002), 'Computing the Noncomputable', Archive quant-ph/0203034, to appear in Contemporary Physics.
24. Kieu, T.D. (2001b), 'A Reformulation of the Hilbert's Tenth Problem Through Quantum Mechanics', Archive quant-ph/0111063.
25. Kieu, T.D. (2002), 'Quantum Principles and Mathematical Computability', Archive quant-ph/0205093.
26. Lewis, H.R. and Papadimitriou, C.H. (1981), Elements of the Theory of Computation, Englewood Cliffs, NJ: Prentice Hall.
27. Lloyd, S. and Braunstein, S.L. (1998), 'Quantum Computation over Continuous Variables', Archive quant-ph/9810082.
28. Matiyasevich, Y.V. (1993), Hilbert's Tenth Problem, Cambridge, MA: MIT Press.
29. Messiah, A. (1976), Quantum Mechanics, Amsterdam: North Holland.
30. Nagel, E. and Newman, J.R. (1958), Gödel's Proof, New York: New York University Press.
31. Nielsen, M.A. (1997), 'Computable Functions, Quantum Measurements, and Quantum Dynamics', Physical Review Letters 79, pp. 2915-2918.
32. Nielsen, M.A. and Chuang, I.L. (2000), Quantum Computation and Quantum Information, Cambridge: Cambridge University Press.
33. Pour-El, M. and Richards, I. (1979), Computability in Analysis and Physics, Berlin: Springer.
34. Scriven, M. (1964), 'The Mechanical Concept of Mind', in A.R. Anderson, ed., Mind and Machines, Englewood Cliffs, NJ: Prentice-Hall.
35. Shor, P.W. (1997), 'Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer', SIAM Journal on Computing 26, pp. 1484-1509.
36. Siegelmann, H.T. (1995), 'Computation Beyond the Turing Limit', Science 268, pp. 545-548.
37. Stannett, M., (2001), 'Hypercomputation is Experimentally Irrefutable.' Tech. Report CS-01-04 Dept of Computer Science, Sheffield University.
38. Svozil, K. (1998), 'The Church-Turing Thesis as a Guiding Principle for Physics', in C.S. Calude, J. Casti and M.J. Dinneen, eds., Unconventional Models of Computation, Singapore: Springer, pp. 371-385.
39. Walls, D.F. and Milburn, G.J. (1995), Quantum Optics, Berlin: Springer.