Multilinear formulas and skepticism of quantum computing

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 118-127

  Aaronson, Scott ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Error correcting codes; Matrix rank; Multilinear formula size; Quantum computing

Indexed keywords

APPROXIMATION THEORY; COMPUTABILITY AND DECIDABILITY; ERROR CORRECTION; MATRIX ALGEBRA; MAXWELL EQUATIONS;

ERROR-CORRECTING CODES; MATRIX RANK; MULTILINEAR FORMULA SIZE; QUANTUM COMPUTING;

QUANTUM THEORY;

EID: 4544369758     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007352.1007378     Document Type: Conference Paper

References (39)

1. S. Aaronson. Book review on A New Kind of Science, Quantum Information and Computation (QIC) 2(5), 2002. quant-ph/0206089.
2. D. S. Abrams and S. Lloyd. Nonlinear quantum mechanics implies polynomial-time solution for NP-complete and #P problems, Phys. Rev. Lett. 81:3992-3995, 1998. quant-ph/9801041.
3. D. Aharonov and M. Ben-Or. Fault-tolerant quantum computation with constant error, Proc. ACM STOC, pp. 176-188. 1997. quant-ph/9906129.
4. D. Aharonov and A. Ta-Shma. Adiabatic quantum state generation and statistical zero knowledge, Proc. ACM STOC, pp. 20-29, 2003. quant-ph/0301023.
5. A. Ambainis, L. Schulman, A. Ta-Shma, U. Vazirani, and A. Wigderson. The quantum communication complexity of sampling, SIAM J. Comput. 32:1570-1585, 2003.
6. 60 molecules, Nature 401:680-682. 1999.
7. A. Aspect, P. Grangier, and G. Roger. Experimental realization of Einstein-Podolsky-Rosen-Bohm gedankenexperiment: a new violation of Bell's inequalities, Phys. Rev. Lett. 49:91-94, 1982.
8. S. L. Braunstein, C. M. Caves, N. Linden, S. Popescu. and R. Schack. Separability of very noisy mixed states and implications for NMR quantum computing, Phys. Rev. Lett. 83:1054-1057. 1999. quant-ph/9811018.
9. H. J. Briegel and R. Raussendorf. Persistent entanglement in arrays of interacting particles, Phys. Rev. Lett. 86:910-913, 2001. quant-ph/0004051.
10. P. Bürgisser, M. Clausen, and M. A. Shokrollahi. Algebraic Complexity Theory, Springer-Verlag, 1997.
11. A. R. Calderbank and P. W. Shor Good quantum error-correcting codes exist, Phys. Rev. A 54:1098-1105, 1996.
12. J. Cronin. CP symmetry violation - the search for its origin, Nobel Lecture, December 8, 1980.
13. W. Dur and H. J. Briegel. Stability of macroscopic entanglement under decoherence, submitted, 2003. quant-ph/0307180.
14. V. Fitch. The discovery of charge-conjugation parity asymmetry, Nobel Lecture, December 8, 1980.
15. J. R. Friedman, V. Patel, W. Chen, S. K. Tolpygo, and J. E. Lukens. Quantum superposition of distinct macroscopic states, Nature 406:43-46, 2000.
16. M. Furst, J. B. Saxe, and M. Sipser. Parity, circuits, and the polynomial time hierarchy, Math. Systems Theory 17:13-27, 1984.
17. G. C. Ghirardi, A. Rimini, and T. Weber. Unified dynamics for microscopic and macroscopic systems, Phys. Rev. D, 34:470, 1986.
18. S. Ghosh, T. F. Rosenbaum, G. Aeppli, and S. N. Coppersmith. Entangled quantum state of magnetic dipoles, Nature 425:48-51, 2003. cond-mat/0402456.
19. O. Goldreich. On quantum computing, 2004. www.wisdom.weizmann.ac.il/ ~oded/on-qc.html
20. D. Gottesman. Class of quantum error-correcting codes saturating the quantum Hamming bound, Phys. Rev. A. 54:1862-1868, 1996. quant-ph/9604038.
21. D. Gottesman. The Heisenberg representation of quantum computers, Int. Conf. on Group Theoretic Methods in Physics, 1998. quant-ph/9807006.
22. F. Green, S. Homer, C. Moore, and C. Pollett. Counting, fanout, and the complexity of quantum ACC, Quantum Information and Computation 2(1):35-65, 2002. quant-ph/0106017.
23. G. 't Hooft. Quantum gravity as a dissipative deterministic system, Classical and Quantum Gravity 16:3263-3279, 1999.
24. D. Janzing, P. Wocjan, and T. Beth. Cooling and low energy state preparation for 3-local Hamiltonians are FQMA-complete, manuscript, 2003. quant-ph/0303186.
25. A. Yu. Kitaev. Quantum computation: algorithms and error correction, Russian Math. Surveys 52(6):1191-1249, 1997.
26. E. Knill, R. Laflamme, R. Martinez, and C. Negrevergne. Implementation of the five qubit error correction benchmark, Phys. Rev. Lett. 86:5811, 2001. quant-ph/0101034.
27. E. Knill, R. Laflamme, R. Martinez, and C.-H. Tseng. An algorithmic benchmark for quantum, information processing, Nature 404:368-370, 2000. quant-ph/9908051.
28. E. Knill, R. Laflamme, and W. Zurek. Resilient quantum computation, Science 279:342, 1998. quant-ph/9702058.
29. A. J. Leggett. Testing the limits of quantum mechanics: motivation, state of play, prospects, J. Phys. Condensed Matter 14:R415-451, 2002.
30. L. Levin. Polynomial time and extravagant models, in The tale of one-way functions, Problems of Information Transmission 39(1), 2003.
31. L. Levin, D. Gottesman, P. Shor, et al. Discussion on sci.physics.research newsgroup, February-March 2000.
32. M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information, Cambridge Univ. Press, 2000.
33. R. Penrose. The Emperor's New Mind, Oxford Univ. Press, 1989.
34. R. Raussendorf, D. E. Browne, and H. J. Briegel. Measurement-based quantum computation on cluster states, Phys. Rev. A 68:022312, 2003. quant-ph/0301052.
35. R. Raz. Multi-linear formulas for permanent and determinant are of super-polynomial size, this Proceedings, 2004.
36. P. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comput. 26(5):1484-1509, 1997. quant-ph/9508027.
37. A. Steane. Multiple particle interference and quantum error correction, Proc. Roy. Soc. Lond. A, 452:2551-2577, 1996. quant-ph/9601029.
38. G. Vidal. Efficient classical simulation of slightly entangled quantum computations, Phys. Rev. Lett. 91:147902, 2003. quant-ph/0301063.
39. S. Wolfram, A New Kind of Science, Wolfram Media, 2002.