On the role of entanglement in quantum-computational speed-up

Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences

Volumn 459, Issue 2036, 2003, Pages 2011-2032

  Jozsa, Richard ^a   Linden, Noah ^a  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Entanglement; Quantum algorithms; Quantum complexity; Quantum computational speed up

Indexed keywords

ALGORITHM; ARTICLE; MATHEMATICAL ANALYSIS; MATHEMATICAL COMPUTING; QUANTUM MECHANICS; SIMULATION; VELOCITY;

EID: 1542516146     PISSN: 13645021     EISSN: 14712946     Source Type: Journal    
DOI: 10.1098/rspa.2002.1097     Document Type: Article

References (31)

1. Abrams, D. & Lloyd, S. 1998 Phys. Rev. Lett. 81, 3992-3995.
2. Ambainis, A., Schulman, L. & Vazirani, U. 2000 Proc. 32nd Annual ACM Symp. Theory of Computing. New York: ACM Press.
3. Barenco, A. 1995 Proc. R. Soc. Lond. A 449, 679-683.
4. Bennett, C. H., Bernstein, E., Brassard, G. & Vazirani, U. 1997 SIAM J. Computing 26, 1510-1523.
5. Bernstein, E. & Vazirani, U. 1997 SIAM J. Computing 26, 1411-1473.
6. Bhatia, R. 1997 Matrix analysis. Graduate Texts in Mathematics, vol. 169. Springer.
7. Braunstein, S. & Pati, A. 2002 Quant. Informat. Computat. 2, 399.
8. Braunstein, S., Caves, C., Jozsa, R., Linden, N., Popescu, S. & Schack, R. 1999 Phys. Rev. Lett. 83, 1054-1057.
9. Deutsch, D. 1985 Proc. R. Soc. Lond. A 400, 96-117.
10. Deutsch, D. & Jozsa, R. 1992 Proc. R. Soc. Lond. A 439, 553-558.
11. Ekert, A. & Jozsa, R. 1998 Phil. Trans. R. Soc. Lond. A 356, 1769-1782.
12. Feynman, R. P. 1982 Int. J. Theor. Phys. 21, 467-488.
13. Garey, M. & Johnson, D. 1979 Computers and intractability: a guide to the theory of NP completeness. San Francisco, CA: Freeman.
14. Gottesman, D. 1997 Stabiliser codes and quantum error correction. PhD thesis, California Institute of Technology, Pasadena, CA.
15. Grover, L. 1996 Proc. 28th Annual ACM Symp. Theory of Computing, pp. 212-219. New York: ACM Press.
16. Grover, L. 1997 Phys. Rev. Lett. 78, 325-328.
17. Jozsa, R. 1998 The geometric universe (ed. S. Huggett, L. Mason, K. P. Tod, S. T. Tsou & N. Woodhouse), pp. 369-379. Oxford University Press.
18. Jozsa, R. 1998 Proc. R. Soc. Lond. A 454, 323-337.
19. Knill, E. & Laflamme, R. 1998 Phys. Rev. Lett. 81, 5672-5675.
20. Linden, N. & Popescu, S. 2001 Phys. Rev. Lett. 87, 047901.
21. Nielsen, M. 2001 Universal quantum computation using only projective measurement, quantum memory, and preparation of the 0 state. (Available at http://xxx.arXiv.org/abs/quant-ph/0108020.)
22. Nielsen, M. & Chuang, I. 2000 Quantum computation and quantum information. Cambridge University Press.
23. Raussendorf, R. & Briegel, H. 2001 Phys. Rev. Lett. 86, 5188-5191.
24. Raz, R. 1999 Proc. 31st Annual ACM Symp. Theory of Computing, pp. 358-367. New York: ACM Press.
25. Shor, P. 1997 SIAM J. Computing 26, 1484-1510.
26. Simon, D. 1997 SIAM J. Computing 26, 1474-1483.
27. Terhal, B. & DiVincenzo, D. 2001 Phys. Rev. A 65, 032325.
28. Valiant, L. 2001 Proc. 33rd Annual ACM Symp. Theory of Computing. New York: ACM Press.
29. Vazirani, U. 1998 Phil. Trans. R. Soc. Lond. A 356, 1759-1768.
30. Vidal, G. & Tarrach, R. 1999 Phys. Rev. A 59, 141-155.
31. Zyczkowski, K., Horodecki, P., Sanpera, A. & Lewenstein, M. 1999 Phys. Rev. A 58, 883-892.