Implementation of quantum search algorithm using classical Fourier optics

Abstract

We report on an experiment on Grover's quantum search algorithm showing that {\em classical waves} can search a $N$-item database as efficiently as quantum mechanics can. The transverse beam profile of a short laser pulse is processed iteratively as the pulse bounces back and forth between two mirrors. We directly observe the sought item being found in $\sim \sqrt{N}$ iterations, in the form of a growing intensity peak on this profile. Although the lack of quantum entanglement limits the {\em size} of our database, our results show that entanglement is neither necessary for the algorithm itself, nor for its efficiency.

4 pages, 3 figures; minor revisions plus extra reference

Cited by in corpus (56)

• Experimental One-Way Quantum Computing
• Realization of quantum walks with negligible decoherence in waveguide lattices
• A 2D Quantum Walk Simulation of Two-Particle Dynamics
• Complete 3-Qubit Grover Search on a Programmable Quantum Computer
• Classical entanglement: Oxymoron or resource?
• Experimental realization of one-way quantum computing with two-photon four-qubit cluster states
• Quantum walk on the line as an interference phenomenon
• Experimental application of decoherence-free subspaces in a quantum-computing algorithm
• Single-photon two-qubit "entangled'' states: preparation and measurement
• Factorization of Numbers with the temporal Talbot effect: Optical implementation by a sequence of shaped ultrashort pulses
• Optical Cavity Implementations of the Quantum Walk
• Scattering theory of topological phases in discrete-time quantum walks
• Efficient Implementation of a Quantum Algorithm in a Single Nitrogen Vacancy Center of Diamond
• Efficient Classical Simulation of Optical Quantum Circuits
• The elusive source of quantum effectiveness
• Climbing Mount Scalable: Physical-Resource Requirements for a Scalable Quantum Computer
• Time-efficient implementation of quantum search with qudits
• Optical implementation of Deutsch-Jozsa and Bernstein-Vazirani quantum algorithms in eight dimensions
• Quantum Optical Systems for the Implementation of Quantum Information Processing
• Simple scheme for two-qubit Grover search in cavity QED
• Experimental requirements for Grover's algorithm in optical quantum computation
• Comprehensive characterization of three-qubit Grover search algorithm on IBM's 127-qubit superconducting quantum computers
• Microwave Experiments Simulating Quantum Search and Directed Transport in Artificial Graphene
• Adiabatic quantum search with atoms in a cavity driven by lasers
• Scalable quantum search using trapped ions
• Fetching marked items from an unsorted database in NMR ensemble computing
• Single-qubit rotations in 2D optical lattices with multi-qubit addressing
• Demonstration of Deutsch's Algorithm on a Stable Linear-Optical Quantum Computer
• Simple implementation of a quantum search with trapped ions
• Dynamics of the quantum search and quench-induced first-order phase transitions
• Single-point position and transition defects in continuous time quantum walks
• Hybrid Quantum Computation
• Quantifying Computational Advantage of Grover's Algorithm with the Trace Speed
• Photonic realization of the deformed Dirac equation via the segmented graphene nanoribbons under inhomogeneous strain
• Time and frequency domain solutions in an optical analogue of Grover's search algorithm
• Effect of qubit losses on Grover's quantum search algorithm
• Robust quantum searching with spontaneously decaying qubits
• Direct Measurement of Kirkwood-Rihaczek distribution for spatial properties of coherent light beam
• Quantum Fourier transform on photonic qubits using cavity QED
• Implementation of Grover search algorithm with Josephson charge qubits
• Optimization of probabilistic quantum search algorithm with a priori information
• A classical limit of Grover's algorithm induced by dephasing: Coherence vs entanglement
• Practical Quantum Appointment Scheduling
• Classical search algorithm with resonances in $\sqrt{N}$ cycles
• Fixed-point quantum continuous search algorithm with optimal query complexity
• Noise resilience and entanglement evolution in two non-equivalent classes of quantum algorithms
• Entanglement and Adiabatic Quantum Computation
• Scattering Expansion for Localization in One Dimension: from Disordered Wires to Quantum Walks
• Quantum Computing: Linear Optics Implementations
• The Dynamics of Entanglement in the Adiabatic Search and Deutsch Algorithms
• Spin Wave Computing using pre-recorded magnetization patterns
• Invariance of success probability in Grover's quantum search under local noise with memory
• Scattering Expansion for Localization in One Dimension
• Quantum-inspired protocol for measuring the degree of similarity between spatial shapes
• Implementation of quantum algorithms with resonant interactions
• Graded-index optical fiber emulator of an interacting three-atom system: illumination control of particle statistics and classical non-separability