Quantum advantage without entanglement

Quantum Information and Computation

Volumn 6, Issue 7, 2006, Pages 606-615

  Kenigsberg, Dan ^a   Mor, Tal ^a   Ratsaby, Gil ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Entanglement; Quantum algorithms; Separability; Tensor product states

Indexed keywords

QUANTUM COMPUTERS;

DEUTSCH-JOZSA ALGORITHMS; ENTANGLEMENT; GROVER'S ALGORITHM; QUANTUM ALGORITHMS; QUANTUM PHASE; SEPARABILITY; SUB-PROBLEMS; TENSOR PRODUCTS;

QUANTUM ENTANGLEMENT;

EID: 33846312893     PISSN: 15337146     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (28)

1. P. W. Shor, "Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer," SIAM J. Comp. 26(5), pp. 1484-1509, 1997.
2. L. K. Grover, "A fast quantum mechanical algorithm for database search," in Proc. 28th ACM STOC, pp. 212-219, May 1996.
3. C. H. Bennett and G. Brassard, "Quantum cryptography: Public key distribution and coin tossing," in Proc. of IEEE Int. Conf. on Computers, Systems and Signal Processing, pp. 175-179, Dec. 1984.
4. C. H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, and W. K. Wootters, "Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels," Phys. Rev. Lett. 70, pp. 1895-1899, Mar. 1993.
5. D. Deutsch and R. Jozsa, "Rapid solution of problems by quantum computation," Proc. R. Soc. Lond., Series A A439, pp. 553-558, 1992.
6. D. R. Simon, "On the power of quantum computation," SIAM J. Comp. 26(5), pp. 1474-1483, 1997.
7. C. H. Bennett and S. J. Wiesner, "Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states," Phys. Rev. Lett. 69(20), pp. 2881-2884, 1992.
8. P. W. Shor, "Scheme for reducing decoherence in quantum computer memory," Phys. Rev. A 52, pp. R2493-R2496, Oct. 1995.
9. A. K. Ekert, "Quantum cryptography based on bell's theorem," Phys. Rev. A 67, pp. 661-663, 1991.
10. C. H. Bennett, G. Brassard, and N. D. Mermin, "Quantum cryptography without bell's theorem," Phys. Rev. Lett. 68, pp. 557-559, 1992.
11. E. Biham, B. Huttner, and T. Mor, "Quantum cryptographic networks based on quantum memories," Phys. Rev. A 54, pp. 2651-2658, 1996.
12. M. Horodecki, "Entanglement measures," Quantum Inf. Comput. 1(1), pp. 3-26, 2001.
13. R. Jozsa, Entanglement and Quantum Computation. Oxford University Press (Oxford, England), Jan. 1998. Also in quant-ph/9707034.
14. R. Jozsa and N. Linden, "On the role of entanglement in quantum computation speed-up," Proc. R. Soc. Lond. A 459, pp. 2011-2032, Aug. 2003.
15. D. Collins, K. W. Kim, and W. C. Holton, "Deutsch-Jozsa algorithm as a test of quantum computation," Phys. Rev. A 58, p. 1633(R), Sep. 1998.
16. S. L. Braunstein and A. K. Pati, "Speed-up and entanglement in quantum searching," Quantum Inf. Comput. 2, pp. 399-409, 2002. Also in quant-ph/0008018.
17. S. Lloyd, "Quantum search without entanglement," Phys. Rev. A 61, p. 010301(R), Dec. 1999.
18. E. Biham, G. Brassard, D. Kenigsberg, and T. Mor, "Quantum computing without entanglement," Theor. Comput. Sci. 320, pp. 13-33, 2004.
19. D. A. Meyer, "Sophisticated quantum search without entanglement," Phys. Rev. Lett. 85, pp. 2014-2017, 2000.
20. E. Bernstein and U. Vazirani, "Quantum complexity theory," SIAM J. Comp. 26(5), pp. 1411-1473, 1997.
21. B. Terhal and J. A. Smolin, "Single quantum querying of a database," Phys. Rev. A 58, pp. 1822-1826, 1998.
22. S. Aaronson, "Multilinear Formulas and Skepticism of Quantum Computing," Proc. 36th ACM STOC, pp. 118-127, 2004. Also in quant-ph/0311039.
23. G. Vidal, "Efficient classical simulation of slightly entangled quantum computations," Phys. Rev. Lett. 91, 147902, 2003. Also in quant-ph/0301063.
24. J. I. Cirac, W. Dür, B. Kraus and M. Lewenstein, "Entangling operations and their implementation using a small amount of entanglement," Phys. Rev. Lett. 86, pp. 544-547, 2001.
25. S. L. Braunstein, C. M. Caves, R. Jozsa, N. Linden, S. Popescu and R. Schack, "Separability of Very Noisy Mixed States and Implications for NMR Quantum Computing," Phys. Rev. Lett. 83, pp. 1054-1057, 1999. Also in quant-ph/9811018.
26. N. Linden and S. Popescu "Good Dynamics versus Bad Kinematics: Is Entanglement Needed for Quantum Computation?," Phys. Rev. Lett. 87, 047901, 2001.
27. L. Vaidman and Z. Mitrani, "Qubits versus Bits for Measuring an Integral of a Classical Field," Phys. Rev. Lett. 92, 217902, 2004.
28. M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press (Cambridge), 2000.