Quantum computing without entanglement

Theoretical Computer Science

Volumn 320, Issue 1, 2004, Pages 15-33

  Biham, Eli ^a   Brassard, Gilles ^b   Kenigsberg, Dan ^a   Mor, Tal ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Quantum computation Entanglement Pseudo pure states

Indexed keywords

ALGORITHMS; INFORMATION ANALYSIS; PROBABILISTIC LOGICS; PROBLEM SOLVING; QUANTUM THEORY; TENSORS;

COMPUTING PROBLEMS; ENTANGLEMENT; PSEUDO-PURE STATES; QUANTUM COMPUTATION;

COMPUTATIONAL METHODS;

EID: 2442490637     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.03.041     Document Type: Article

References (23)

1. A. Ambainis, L.J. Schulman, U.V. Vazirani, Computing with highly mixed states, Proc. 32nd Annu. ACM Symp. on the Theory of Computing, 2000, pp. 697-704.
2. Berthiaume A., Brassard G. Oracle quantum computing. J. Modern Opt. 41(12):1994;2521-2535.
3. Brassard G. Quantum communication complexity. Found. Phys. 33(11):2003;1593-1616.
4. Braunstein S.L., Caves C.M., Jozsa R., Linden N., Popescu S., Schack R. Separability of very noisy mixed states and implications for NMR quantum computing. Phys. Rev. Lett. 83:1999;1054-1057.
5. Braunstein S.L., Mann A., Revzen M. Maximal violation of Bell inequalities for mixed states. Phys. Rev. Lett. 68:1992;3259-3261.
6. Braunstein S.L., Pati A.K. Speed-up and entanglement in quantum searching. Quantum Inform. Comp. 2:2002;399-409.
7. Cory D.G., Fahmy A.F., Havel T.F. Ensemble quantum computing by nuclear magnetic resonance spectroscopy. Proc. US Nat. Acad. Sci. 94:1997;1634-1639.
8. Deutsch D. Quantum computational networks. Proc. Roy. Soc. London A. 425:1989;73-90.
9. Deutsch D., Jozsa R. Rapid solution of problems by quantum computation. Proc. Roy. Soc. London A. 439:1992;553-558.
10. Diffie W., Hellman M.E. New directions in cryptography. IEEE Trans. Inform. Theory. IT-22(6):1976;644-654.
11. Ekert A., Jozsa R. Quantum algorithms. entanglement enhanced information processing Philos. Trans. Roy. Soc. London A. 356:1998;1779-1782.
12. Gershenfeld N.A., Chuang I.L. Bulk spin-resonance quantum computation. Science. 275:1997;350-356.
13. Gruska J. Quantum Computing. 1999;McGraw-Hill, London.
14. Jozsa R., Linden N. On the role of entanglement in quantum computational speed-up. Proc. Roy. Soc. London A. 459:2003;2011-2032.
15. Linden N., Popescu S. Good dynamics versus bad kinematics. is entanglement needed for quantum computation? Phys. Rev. Lett. 87:2001;047901.
16. Nielsen M.A., Chuang I.L. Quantum Computation and Quantum Information. 2000;Cambridge University Press, Cambridge.
17. Rivest R.L., Shamir A., Adleman L.M. A method for obtaining digital signatures and public-key cryptosystems. Comm. ACM. 21(2):1978;120-126.
18. Schack R., Caves C.M. Classical model for bulk-ensemble NMR quantum computation. Phys. Rev. A. 60:1999;4354-4362.
19. Schack R., Caves C.M. Explicit product ensembles for separable quantum states. J. Modern Opt. 47:2000;387-399.
20. Shor P.W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26:1997;1484-1509.
21. Simon D.R. On the power of quantum computation. SIAM J. Comput. 26:1997;1474-1483.
22. Vidal G. Efficient classical simulation of slightly entangled quantum computations. Phys. Rev. Lett. 91(14):2003;14.
23. Werner R.F. Quantum states with Einstein-Podolsky-Rosen correlations admitting a hidden-variable model. Phys. Rev. A. 40(8):1989;4277-4281.