Quantum computing and hidden variables

Physical Review A - Atomic, Molecular, and Optical Physics

Volumn 71, Issue 3, 2005, Pages

  Aaronson, Scott ^a  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISCRETE TIME; HIDDEN VARIABLES; ISOMORPHISM; NETWORK FLOWS;

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; MATRIX ALGEBRA; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; STATE ASSIGNMENT; THEOREM PROVING;

QUANTUM THEORY;

EID: 18444407431     PISSN: 10502947     EISSN: 10941622     Source Type: Journal    
DOI: 10.1103/PhysRevA.71.032325     Document Type: Article

References (40)

1. E. Schrödinger, Sitzungsber, K. Preuss. Sitzungsber. Preuss. Akad. Wiss., Phys. Math. Kl. 1, 144 (1931).
2. D. Bohm, Phys. Rev. 85, 166 (1952).
3. J. S. Bell, Speakable and Unspeakable in Quantum Mechanics (Cambridge University Press, Cambridge, England, 1987).
4. E. Nelson, Quantum Fluctuations (Princeton University Press, Princeton, 1985).
5. D. Dieks, Phys. Rev. A 49, 2290 (1994).
6. S. Aaronson, e-print quant-ph/0111102.
7. L. K. Grover, e-print quant-ph/9605043.
8. D. S. Abrams and S. Lloyd, Phys. Rev. Lett. 81, 3992 (1998).
9. T. Brun, Found. Phys. Lett. 16, 245 (2003).
10. D. Bacon, e-print quant-ph/0309189.
11. D. Deutsch, Phys. Rev. D 44, 3197 (1991).
12. S. Aaronson e-print quant-ph/0412187.
13. C. Philippidis, C. Dewdney, and B. J. Hiley, Nuovo Cimento Soc. Ital. Fis., B 52, 15 (1979).
14. E. Guay and L. Marchildon, J. Phys. A 36, 5617 (2003).
15. M. Nagasawa, Prob. Theory Related Fields 82, 109 (1989).
16. R. Sinkhorn, Ann. Math. Stat. 35, 876 (1964).
17. L. G. Valiant and V. V. Vazirani, Theor. Comput. Sci. 47, 85 (1986).
18. C. Rovelli and L. Smolin, Nucl. Phys. B 442, 593 (1995);
19. C. Rovelli and L. Smolin, Nucl. Phys. B 456, 753 (1990).
20. D. Bohm and B. Hiley, The Undivided Universe (Routledge, London, 1993).
21. M. Dickson, in Stanford Encyclopedia of Philosophy (Stanford University, Standford, 2002), at http://plato.stanford.edu/entries/qm-modal/.
22. G. Bacciagaluppi and M. Dickson, Found. Phys. 29, 1165 (1999).
23. R. B. Griffiths, Phys. Rev. A 57, 1604 (1998).
24. M. Gell-Mann and J. Hartle, in Complexity, Entropy, and the Physics of Information, edited by W. H. Zurek (Addison-Wesley, Redwood City, CA, 1990).
25. D. T. Gillespie, Phys. Rev. A 49, 1607 (1994).
26. A. Kitaev, Russ. Math. Surveys 52, 1191 (1997).
27. M. Nielsen and I. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, England, 2000).
28. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed. (MIT Press, Cambridge, MA, 2001).
29. L. R. Ford and D. R. Fulkerson, Flows in Networks (Princeton University Press, Princeton, 1962).
30. R. Fortet, J. Math. Pures Appl. 9, 83 (1940).
31. A. Beurling, Ann. Math. 72, 189 (1960).
32. J. Franklin and J. Lorenz, Linear Algebr. Appl. 114/115, 717 (1989).
33. N. Linial, A. Samorodnitsky, and A. Wigderson, Combinatorica 20, 545 (2000).
34. A. Sahai and S. Vadhan, J. ACM 50, 196 (2003).
35. O. Goldreich and S. Goldwasser (unpublished).
36. D. Aharonov and A. Ta-Shma, e-print quant-ph/0301023.
37. Y. Shi, e-print quant-ph/0112086.
38. G. Brassard, P. Høyer, and A. Tapp, SIGACT News 28, 14 (1997).
39. C. Bennett, E. Bernstein, G. Brassard, and U. Vazirani, SIAM J. Comput 26, 1510 (1997).
40. T. Baker, J. Gill, and R. Solovay, SIAM J. Comput. 4, 431 (1975).