The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Grover algorithm with zero theoretical failure rate
Open accessAbstract
In a standard Grover's algorithm for quantum searching, the probability of finding the marked item is not exactly 1. In this paper we present a modified version of Grover's algorithm that searches a marked state with full successful rate. The modification is done by replacing the phase inversion by phase rotation through angle $\ensuremath{\varphi}.$ The rotation angle is given analytically to be $\ensuremath{\varphi}=2\mathrm{arcsin}(\mathrm{sin}[\ensuremath{\pi}/(4J+6)]/\mathrm{sin}\ensuremath{\beta}),$ where $\mathrm{sin}\ensuremath{\beta}=1/\sqrt{N},$ N is the number of items in the database, and J is any integer equal to or greater than the integer part of $[(\ensuremath{\pi}/2)\ensuremath{-}\ensuremath{\beta}]/(2\ensuremath{\beta}).$ Upon measurement at the $(J+1)\mathrm{th}$ iteration, the marked state is obtained with certainty.
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
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
Quantum amplitude amplification and estimation
Brassard, G., Høyer, P., Mosca, M., & Tapp, A. (2002) · Contemporary Mathematics · doi:10.1090/conm/305/05215 · Cited by 1,680
Quantum Computers Can Search Rapidly by Using Almost Any Transformation
Grover, L. K. (1998) · Physical Review Letters · doi:10.1103/physrevlett.80.4329 · Cited by 616
Phase matching in quantum searching
Long, G. L., Li, Y. S., Zhang, W. L., & Niu, L. (1999) · Physics Letters A · doi:10.1016/s0375-9601(99)00631-3 · Cited by 184
Self-citationArbitrary phases in quantum amplitude amplification
Høyer, P. (2000) · Physical Review A · doi:10.1103/physreva.62.052304 · Cited by 160
Searching a quantum phone book
Brassard, G. (1997) · Science · doi:10.1126/science.275.5300.627 · Cited by 103
Cited by
Quantum secure direct communication and deterministic secure quantum communication
Long, G.-L., Deng, F.-G., Wang, C., Li, X.-H., Wen, K., & Wang, W.-Y. (2007) · Frontiers of Physics in China · doi:10.1007/s11467-007-0050-3 · Cited by 308
Self-citationHybrid quantum-classical convolutional neural networks
Liu, J., Lim, K. H., Wood, K. L., Huang, W., Guo, C., & Huang, H.-L. (2021) · Science China Physics, Mechanics & Astronomy · doi:10.1007/s11433-021-1734-3 · Cited by 289
Post-Quantum Lattice-Based Cryptography Implementations: A Survey
Nejatollahi, H., Dutt, N., Ray, S., Regazzoni, F., Banerjee, I., & Cammarota, R. (2019) · ACM Computing Surveys · doi:10.1145/3292548 · Cited by 277
General Quantum Interference Principle and Duality Computer
Gui-Lu, L. (2006) · Communications in Theoretical Physics · doi:10.1088/0253-6102/45/5/013 · Cited by 264
Distributed secure quantum machine learning
Sheng, Y.-B., & Zhou, L. (2017) · Science Bulletin · doi:10.1016/j.scib.2017.06.007 · Cited by 245
Szymanski, T. H. (2022) · IEEE Access · doi:10.1109/access.2022.3169137 · Cited by 59
Leveraging quantum computing for dynamic analyses of logical networks in systems biology
Weidner, F. M., Schwab, J. D., Wölk, S., Rupprecht, F., Ikonomi, N., Werle, S. D., Hoffmann, S., Kühl, M., & Kestler, H. A. (2023) · Patterns · doi:10.1016/j.patter.2023.100705 · Cited by 21
Metadata
- Authors
- Long, G. L.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2001-07-11
- Volume
- 64
- Issue
- 2
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2071576863
- Cited by
- 458
- References
- 6
- FWCI
- 5.63
- 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.