Implementation of Quantum Search Algorithm using Classical Fourier Optics
Top Cited Papers
- 12 March 2002
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 88 (13) , 137901
- https://doi.org/10.1103/physrevlett.88.137901
Abstract
We report on an experiment on Grover's quantum search algorithm showing that classical waves can search a -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 iterations, in the form of a growing intensity peak on this profile. Although the lack of quantum entanglement limits the size of our database, our results show that entanglement is neither necessary for the algorithm itself, nor for its efficiency.
Keywords
All Related Versions
This publication has 27 references indexed in Scilit:
- Classical wave-optics analogy of quantum-information processingPhysical Review A, 2001
- Does Rydberg State Manipulation Equal Quantum Computation?Science, 2000
- Synthesis of Quantum Superpositions by Quantum ComputationPhysical Review Letters, 2000
- Dominant gate imperfection in Grover’s quantum search algorithmPhysical Review A, 2000
- Grover's search algorithm: An optical approachJournal of Modern Optics, 2000
- Quantum search without entanglementPhysical Review A, 1999
- Tight Bounds on Quantum SearchingFortschritte der Physik, 1998
- Optical simulation of quantum logicPhysical Review A, 1998
- Quantum countingPublished by Springer Nature ,1998
- Quantum Computers Can Search Arbitrarily Large Databases by a Single QueryPhysical Review Letters, 1997