Quantum search by measurement
Open accessThe DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
We propose a quantum algorithm for solving combinatorial search problems that uses only a sequence of measurements. The algorithm is similar to quantum computation by adiabatic evolution, in that the goal is to remain in the ground state of a time-varying Hamiltonian. Indeed, we show that the running times of the two algorithms are closely related. We also show how to achieve the quadratic speedup for Grover's unstructured search problem with only two measurements. Finally, we discuss some similarities and differences between the adiabatic and measurement algorithms.
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
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
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
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088
Strengths and Weaknesses of Quantum Computing
Bennett, C. H., Bernstein, E., Brassard, G., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300933 · Cited by 1,470
Quantum Algorithm Providing Exponential Speed Increase for Finding Eigenvalues and Eigenvectors
Abrams, D. S., & Lloyd, S. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.5162 · Cited by 817
Quantum search by local adiabatic evolution
Roland, J., & Cerf, N. J. (2002) · Physical Review A · doi:10.1103/physreva.65.042308 · Cited by 629
Cited by
Spatial search by quantum walk
Childs, A. M., & Goldstone, J. (2004) · Physical Review A · doi:10.1103/physreva.70.022314 · Cited by 725
Self-citationAdiabatic quantum state generation and statistical zero knowledge
Aharonov, D., & Ta-Shma, A. (2003) · Proceedings of the thirty-fifth annual ACM symposium on Theory of computing · doi:10.1145/780542.780546 · Cited by 322
“We take c = 1 / 6 and show how to solve DLP 1 / 6 with CQS.”
MethodNear-optimal ground state preparation
Lin, L., & Tong, Y. (2020) · Quantum · doi:10.22331/q-2020-12-14-372 · Cited by 187
Simulation of quantum random walks using the interference of a classical field
Jeong, H., Paternostro, M., & Kim, M. S. (2004) · Physical Review A · doi:10.1103/physreva.69.012310 · Cited by 90
A quantum algorithm to solve nonlinear differential equations
Leyton, S. K., & Osborne, T. J. (2008) · arXiv · doi:10.48550/arxiv.0812.4423 · Cited by 65
Metadata
- Authors
- Childs, A. M., Deotto, E., Farhi, E., Goldstone, J., Gutmann, S., & Landahl, A. J.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2002-09-23
- Volume
- 66
- Issue
- 3
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2094329495
- Cited by
- 81
- References
- 6
- FWCI
- 3.35
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Quantum search by measurement. https://app.cochat.ai/papers/10.1103/physreva.66.032314
- The paper
- Childs, A. M., Deotto, E., Farhi, E., Goldstone, J., Gutmann, S., & Landahl, A. J. (2002). Quantum search by measurement. Physical Review A. https://doi.org/10.1103/physreva.66.032314
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.