Quantum Entanglement and Quantum Computational Algorithms

Abstract

The existence of entangled quantum states gives extra power to quantum computers over their classical counterparts. Quantum entanglement shows up qualitatively at the level of two qubits. We show that if no entanglement is envolved then whatever one can do with qubits can also be done with classical optical systems. We demonstrate that the one- and the two-bit Deutsch-Jozsa algorithm does not require entanglement and can be mapped onto a classical optical scheme. It is only for three and more input bits that the DJ algorithm requires the implementation of entangling transformations and in these cases it is impossible to implement this algorithm classically.

9-pages latex, lecture given at the International Winter Institute on Foundations of Quantum Theory and Quantum Optics, SNBNCBS, Calcutta, India

Cited by in corpus (7)

• Determining the parity of a permutation using an experimental NMR qutrit
• Optical implementations, oracle equivalence, and the Bernstein-Vazirani algorithm
• Spectral implementation of some quantum algorithms by one- and two-dimensional nuclear magnetic resonance
• The Deutsch-Jozsa Problem: De-quantisation and Entanglement
• Understanding the Quantum Computational Speed-up via De-quantisation
• Role of interference and entanglement in quantum neural processing
• A Thermodynamic Turing Machine: Artificial Molecular Computing Using Classical Reversible Logic Switching Networks