Quantum computation with classical light: implementation of the Deutsch-Jozsa Algorithm
arXiv:1510.03365 · doi:10.1016/j.physleta.2015.04.034
Abstract
We propose an optical implementation of the Deutsch-Jozsa Algorithm using classical light in a binary decision-tree scheme. Our approach uses a ring cavity and linear optical devices in order to efficiently quarry the oracle functional values. In addition, we take advantage of the intrinsic Fourier transforming properties of a lens to read out whether the function given by the oracle is balanced or constant.
References in corpus (6)
- Quantum computation with classical light: implementation of the Deutsch-Jozsa Algorithm
- Experimental realization of the one qubit Deutsch-Jozsa algorithm in a quantum dot
- Demonstration of Deutsch's Algorithm on a Stable Linear-Optical Quantum Computer
- Double-slit implementation of minimal Deutsch algorithm
- Implementing the Deutsch's algorithm with spin-orbital angular momentum of photon without interferometer
- Measuring the non-separability of classically entangled vector vortex beams
Cited by in corpus (16)
- Basis independent tomography of complex vectorial light fields by Stokes projections
- Entanglement: Quantum or Classical?
- Quantum computation with classical light: implementation of the Deutsch-Jozsa Algorithm
- Full-quantum light diode
- Cylindrical vector beam generator using a two-element interferometer
- Measurement of classical entanglement using interference fringes
- Characterizations of symmetrically partial Boolean functions with exact quantum query complexity
- Classical realization of the quantum Deutsch algorithm
- Quantum-inspired clustering with light
- Scattering Expansion for Localization in One Dimension: from Disordered Wires to Quantum Walks
- Quantum communication with invariant separable level systems
- Scattering Expansion for Localization in One Dimension
- Graded-index optical fiber emulator of an interacting three-atom system: illumination control of particle statistics and classical non-separability
- Computing Shor's algorithmic steps with classical light beams
- 'Complementarity' in paraxial and non-paraxial optical beams
- Consistency of quantum computation and the equivalence principle