The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Fixed-Point Quantum Search
Open accessAbstract
The quantum search algorithm consists of an iterative sequence of selective inversions and diffusion type operations, as a result of which it is able to find a state with desired properties (target state) in an unsorted database of size N in only sqrt[N] queries. This is achieved by designing the iterative transformations in a way that each iteration results in a small rotation of the state vector in a two-dimensional Hilbert space that includes the target state; if we choose the right number of iterative steps, we will stop just at the target state. This Letter shows that by replacing the selective inversions by selective phase shifts of pi/3, the algorithm preferentially converges to the target state irrespective of the step size or number of iterations. This feature leads to robust search algorithms and also to new schemes for quantum control and error correction.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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
Self-citationStrengths 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
Cited by
Gilyén, A., Su, Y., Low, G. H., & Wiebe, N. (2019) · Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing · doi:10.1145/3313276.3316366 · Cited by 542
A review on Quantum Approximate Optimization Algorithm and its variants
Blekos, K., Brand, D., Ceschini, A., Chou, C.-H., Li, R.-H., Pandya, K., & Summer, A. (2024) · Physics Reports · doi:10.1016/j.physrep.2024.03.002 · Cited by 408
Methodology of Resonant Equiangular Composite Quantum Gates
Low, G. H., Yoder, T. J., & Chuang, I. L. (2016) · Physical Review X · doi:10.1103/physrevx.6.041067 · Cited by 159
“Query algorithms can be built to calculate a boolean function f : { 0 , 1 } n → { 0 , 1 that depends only on the number of marked states (i.e. f ( x ) = ˜ f ( x ) for some ˜ f : { 0 , 1 , . . . algorithm | | , n } → { 0 , 1 } ) and do so with a Grover-type of partial reflec-tions (e.g. [21, 55–57]).”
BackgroundGrover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation
Bartschi, A., & Eidenbenz, S. (2020) · 2020 IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00020 · Cited by 122
Parasitic photon-pair suppression via photonic stop-band engineering
Helt, L. G., Brańczyk, A. M., Liscidini, M., & Steel, M. J. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.073603 · Cited by 19
Metadata
- Authors
- Grover, L. K.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2005-10-03
- Volume
- 95
- Issue
- 15
- Pages
- 150501-150501
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W1578898693
- Cited by
- 210
- References
- 2
- FWCI
- 8.93
- 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: Fixed-Point Quantum Search. https://app.cochat.ai/papers/10.1103/physrevlett.95.150501
- The paper
- Grover, L. K. (2005). Fixed-Point Quantum Search. Physical Review Letters. https://doi.org/10.1103/physrevlett.95.150501
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.