Implementation of Quantum Search Algorithm using Classical Fourier Optics
Open accessThe DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
We report on an experiment on Grover's quantum search algorithm showing that 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 approximately square root[N] 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306
Saleh, B. E. A., & Teich, M. C. (1991) · doi:10.1002/0471213748 · Cited by 3,383
Implementation of a quantum search algorithm on a quantum computer
Jones, J. A., Mosca, M., & Hansen, R. H. (1998) · Nature · doi:10.1038/30687 · Cited by 558
Quantum Computers Can Search Arbitrarily Large Databases by a Single Query
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.4709 · Cited by 432
Optical simulation of quantum logic
Cerf, N. J., Adami, C., & Kwiat, P. G. (1998) · Physical Review A · doi:10.1103/physreva.57.r1477 · Cited by 324
Cited by
Experimental one-way quantum computing
Walther, P., Resch, K. J., Rudolph, T., Schenck, E., Weinfurter, H., Vedral, V., Aspelmeyer, M., & Zeilinger, A. (2005) · Nature · doi:10.1038/nature03347 · Cited by 1,273
“Grover’s algorithm has been implemented under the standard model 46,47 both in NMR 48,49 and in optical experiments.”
MethodQuantum-optical analogies using photonic structures
Longhi, S. (2009) · Laser & Photonics Reviews · doi:10.1002/lpor.200810055 · Cited by 718
Realization of Quantum Walks with Negligible Decoherence in Waveguide Lattices
Perets, H. B., Lahini, Y., Pozzi, F., Sorel, M., Morandotti, R., & Silberberg, Y. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.170506 · Cited by 526
A 2D Quantum Walk Simulation of Two-Particle Dynamics
Schreiber, A., Gábris, A., Rohde, P. P., Laiho, K., Štefaňák, M., Potoček, V., Hamilton, C., Jex, I., & Silberhorn, C. (2012) · Science · doi:10.1126/science.1218448 · Cited by 425
Optical pulse shaping approaches to coherent control
Goswami, D. (2003) · Physics Reports · doi:10.1016/s0370-1573(02)00480-5 · Cited by 280
Metadata
- Authors
- Bhattacharya, N., van Linden van den Heuvell, H. B., & Spreeuw, R. J. C.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2002-03-12
- Volume
- 88
- Issue
- 13
- Pages
- 137901-137901
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2023321040
- Cited by
- 162
- References
- 8
- FWCI
- 8.70
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.