Quantum computing without entanglement

It is generally believed that entanglement is essential for quantum computing. We present here a few simple examples in which quantum computing without entanglement is better than anything classically achievable, in terms of the reliability of the outcome after a fixed number of oracle calls. Using a separable (that is, unentangled) state, we show that the Deutsch-Jozsa problem and the Simon problem can be solved more reliably by a quantum computer than by the best possible classical algorithm, even probabilistic. We conclude that: (a) entanglement is not essential for quantum computing; and (b) some advantage of quantum algorithms over classical algorithms persists even when the quantum state contains an arbitrarily small amount of information--that is, even when the state is arbitrarily close to being totally mixed.

[1]  N. Gershenfeld,et al.  Bulk Spin-Resonance Quantum Computation , 1997, Science.

[2]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[3]  R. Schack,et al.  Classical model for bulk-ensemble NMR quantum computation , 1999, quant-ph/9903101.

[4]  Mann,et al.  Maximal violation of Bell inequalities for mixed states. , 1992, Physical review letters.

[5]  Artur Ekert,et al.  Quantum algorithms: entanglement–enhanced information processing , 1998, Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[6]  R. Jozsa,et al.  On the role of entanglement in quantum-computational speed-up , 2002, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[7]  G. Brassard,et al.  Oracle Quantum Computing , 1992, Workshop on Physics and Computation.

[8]  Jozef Gruska,et al.  Quantum Computing , 2008, Wiley Encyclopedia of Computer Science and Engineering.

[9]  Andris Ambainis,et al.  Computing with highly mixed states (extended abstract) , 2000, STOC '00.

[10]  Timothy F. Havel,et al.  Ensemble quantum computing by NMR spectroscopy , 1997, Proc. Natl. Acad. Sci. USA.

[11]  S. Popescu,et al.  Good dynamics versus bad kinematics: is entanglement needed for quantum computation? , 1999, Physical review letters.

[12]  D. Deutsch,et al.  Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[13]  Amr F. Fahmy,et al.  Ensemble Quantum Computing by Nuclear Magnetic Resonance Spectroscopy , 1997 .

[14]  Werner,et al.  Quantum states with Einstein-Podolsky-Rosen correlations admitting a hidden-variable model. , 1989, Physical review. A, General physics.

[15]  Samuel L. Braunstein,et al.  Speed-up and entanglement in quantum searching , 2002, Quantum Inf. Comput..

[16]  R. Jozsa,et al.  SEPARABILITY OF VERY NOISY MIXED STATES AND IMPLICATIONS FOR NMR QUANTUM COMPUTING , 1998, quant-ph/9811018.

[17]  G. Brassard,et al.  Quantum Communication Complexity , 2003 .

[18]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[19]  G. Vidal.  Efficient classical simulation of slightly entangled quantum computations. , 2003, Physical review letters.

[20]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[21]  Andris Ambainis,et al.  Computing with highly mixed states , 2006, JACM.

[22]  C. Caves,et al.  Explicit product ensembles for separable quantum states , 1999, quant-ph/9904109.

[23]  D. Deutsch.  Quantum computational networks , 1989, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.