The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index; none of the 8 sources its claims cite is checked for support yet.
A fast quantum mechanical algorithm for database search
Open accessAbstract
An unsorted database contains N records, of which just one satisfies a particular property.The problem is to identify that one record.Any classical algorithm, deterministic or probabilistic, will clearly take O (N) steps since on the average it will have to examine a large fraction of the N records.Quantum mechanical systems can do several operations simultaneously due to their wave like properties.This paper gives an O ( JN) step quantum mechanical algorithm for identifying that record.It is within a constant factor of the fastest possible quantum mechanical algorithm.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
19 No basis given · 8 Sources not found · 4 Own interpretation
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This paper gives an O ( JN) step quantum mechanical algorithm for identifying that record.”
§ A fast quantum mechanical algorithm for database search > Abstract
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- The authors state this as an assumption: There is a unique state that satisfies the condition C(S)=1.
- The authors state this as an assumption: For any state S, the condition C(S) can be evaluated in unit time.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Corollary 3.1-Let the state vector be as followsfor any one state the amplitude is k, for each of the remaining (N-1) states the amplitude is 1.Let k and 1 be real numbers (in general the amplitudes can be complex).Let k be negative and 1 be positive such that ~< ~N.Then after applying the diffusion transform both k and 1are positive numbers.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“First, it is proved that the system is a valid quantum mechanical system (theorems 1 & 2)”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
boosted- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“As mentioned in the introduction, the algorithm of this paper does not use any Imowledge about the problem.”
§ A fast quantum mechanical algorithm for database search > 114
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Theorem 1-The matix D is unitary.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The following sections prove that the system discussed in section 3 is indeed a valid quantum mechanical system and that it converges to the desired state with a probability O(l).”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- The authors state this as an assumption: There is a unique state that satisfies the condition C(S)=1.
- The authors state this as an assumption: For any state S, the condition C(S) can be evaluated in unit time.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Theorem 2 -D can be expressed as D = FRF, where F, the Fourier Transform Matrix and R, the rotation matrix are defined as follows”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Since the proba-& bility of the system being found in any particular state is proportional to the square of the amplitude, it follows that the probability of the system being in tlhe desired state when k is ~, 1 J2 is k2 = ~.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In case there is a unique state SV such that C(SV) = 1, the final state is SV with a probability of at least ~. 2”
§ A fast quantum mechanical algorithm for database search > T. Acknowledgments
plainconditional- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
- The authors state this as an assumption: There is a unique state that satisfies the condition C(S)=1.
- The authors state this as an assumption: For any state S, the condition C(S) can be evaluated in unit time.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“It can be easily modified to take care of the case when there are multiple states satisfying the condition C(S) = 1 and it is required to return one of these.”
§ A fast quantum mechanical algorithm for database search > 114
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Probably not a substantial claim. 8
- It may state two separate claims as one. 4
- The quote only partly states this claim. 1
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Theorem 5-Let the probability of a particular outcome in an experiment be &.Then if the experiment be repeated ~times, the probability that the outcome does not happen even once is less than or equal to e-K.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The change in k ( Ak) after steps (a) and (b) of the algorithm is lower bounded by Ak>~.Also after steps (a) and (b), 1>0.2fi”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Using this it immediately follows that there exists a number M less than EN, such that in M repetitions of the loop in step (ii), k wifl become ~.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The quote only partly states this claim.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The most efficient classical algorithm for this is to examine the items in the database one by one.”
§ A fast quantum mechanical algorithm for database search > ------------------------------------------------
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“Very recent results [Shor95] have shown the existence of quantum mechanical error corr~ting cod~which enable transmission of data even in the presence of noise”
§ A fast quantum mechanical algorithm for database search > 114
What the sources say
- Not matchedcites [Shor95]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
boosteddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This algorithm, by cleverly making use of some features of the structure of the problem, is the only known algorithm that solves the problem in O (logIV) steps.”
§ A fast quantum mechanical algorithm for database search > 114
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The phase does not have an analog in classical probabilistic algorithms.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This illustrates the point that, in quantum mechanics, the complete description of the system requires the amplitudes over all states, just the probabilities is not enough.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
In the paper
“For example Shor's primality testing algorithm [Shor94] for a number N can be viewed as a search of the (N-l) numbers smaller than N to see if any of them is a factor of N.”
§ A fast quantum mechanical algorithm for database search > 114
What the sources say
- Not matchedcites [Shor94]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
In the paper
“There is also a scheme discussed in [VV86] by which it is possible to modify any algorithm that solves an NPsearch problem with a unique solution and use it to solve an NP-search problem in general.”
§ A fast quantum mechanical algorithm for database search > 114
What the sources say
- Not matchedcites [VV86]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
hedgeddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
In the paper
“This operation is one of the things that makes quantum mechanical algorithms more powerful than classical algorithms and forms the basis for most significant quantum mechanical algorithms.”
§ A fast quantum mechanical algorithm for database search > T. Acknowledgments
What the sources say
- Not matchedcites [DJ92]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
- Not matched
The authors state this as an assumption.
There is a unique state that satisfies the condition C(S)=1.
“Let there be a unique state, say Sv, that satisfies the condition C(SV) = 1, whereas for all other states S, C(S) = 0”
“The algorithm as discussed here assumes a unique state that satisfies the desired condition.”
The authors state this as an assumption.
For any state S, the condition C(S) can be evaluated in unit time.
“(assume that for any state S, the condition C(S) can be evaluated in unit time)”
The paper relies on this without support.
There does not exist any sorting on the database that would aid selection of the desired item.
“However, there does not exist any sorting on the database that would aid its selection.”
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Symmetric cryptography remains comparatively resilient, yet Grover's algorithm offers a quadratic speed-up for brute-force key search, effectively halving the security margin of symmetric ciphers [13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Similarly, for hash functions, Grover's algorithm [185] can facilitate quantum birthday attack to find collision, thereby necessitating an output of larger size.”
From Zero Trust Architecture (ZTA): A Comprehensive Survey (2022) · cites this paper as [185]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Similarly, Grover’s algorithm concedes a quadratic advantage for mining blocks in certain consensus protocols such as proof of work.”
From Quantum-resistance in blockchain networks (2023) · cites this paper as [71]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Quantum computers will be able to find these nonces quadratically faster using Grover’s algorithm71.”
From Quantum-resistance in blockchain networks (2023) · cites this paper as [71]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“This model is realistic given the falling cost of storage, the rise of large-scale surveillance infrastructures, and the expected disruption of quantum algorithms such as Shor's and Grover's [1,2,13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measured
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Grover's algorithm provides only a quadratic speedup, effectively halving brute-force resistance. Comparable security margins can be restored by doubling key sizes (for example, AES-128 to AES-256) [13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“This explains why AES-256 maintains post-quantum security margins, whereas AES-128 requires upgrading to maintain equivalent protection levels [13,14].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“At the same time, Grover's algorithm shows that symmetric cryptography, though more resilient, also demands doubled key sizes to maintain equivalent margins [13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“In this sense, Grover-based optimization algorithms [184] such as Grover Adaptive Search [161] have been proposed.”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [184]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The former bound is tight since recent work of Grover [13] shows how to accept the class NP relative to any oracle on a quantum computer in time O (2 n/ 2 ).”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“In view of Grover's algorithm [13], we know that the constant '1 / 2' in the statement of Theorem 3.5 cannot be improved.”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The former bound is tight since recent work of Grover [13] shows how to accept the class NP relative to any oracle on a quantum computer in time O (2 n/ 2 ).”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“Grover’s algorithm [54] is a quantum algorithm for searching in a database, ofering quadratic speedup over classical searching methods.”
From QASMBench: A Low-Level Quantum Benchmark Suite for NISQ Evaluation and Simulation (2023) · cites this paper as [54]
The cited source says what the claim attributes to it.
In the citing paper
“However, quantum machines can recognize this language quadratically faster, in time O ( √ 2 n ), using Grover's algorithm [13].”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
The cited source says what the claim attributes to it.
In the citing paper
“That this was a real possibility is clear from Grover's [13] result, which gives a black-box approach to solving NP -complete problems in square-root as much time as is required classically.”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
The cited source says what the claim attributes to it.
In the citing paper
“Various strategies can be imagined, but a good one (called 'inversion about the average' by Grover [13]) is to perform an oracle-independent unitary transformation so as to change the phase difference into an amplitude difference, leaving the y term with the same sign as all the other terms but a magnitude approximately threefold larger.”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“The HNDL adversary departs from conventional cryptanalysis in its temporal asymmetry. Instead of attempting immediate decryption, the attacker passively collects encrypted traffic or stored archives and defers decryption until sufficient computational resources become available.”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredIn the citing paper
“This algorithm uses a single function evaluation to label the single state which satisfies the function, followed by a series of gates which drive the system into this particular state.”
From Implementation of a quantum search algorithm on a quantum computer (1998) · cites this paper as [9]
In the citing paper
“Here we show how such a computer can be used to implement a fast quantum search algorithm initially developed by Grover. 9, 10”
From Implementation of a quantum search algorithm on a quantum computer (1998) · cites this paper as [9]
In the citing paper
“Among other applications Grover's algorithms enable an extremely rapid search over the domain of a binary function to find elements for which this function is satisfied (that is, the function has the value 1).”
From Implementation of a quantum search algorithm on a quantum computer (1998) · cites this paper as [9]
In the citing paper
“the ability to efficiently perform Hamiltonian simulation is used in conjunction with another technique known as the quantum phase estimation algorithm (QPEA) 42 for efficiently obtaining the eigen-energies and eigenstates of a quantum system 38 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
In the citing paper
“The Quantum Phase Estimation (QPE) algorithm 38,99 is the natural translation of the FCI procedure to quantum computers 45 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
In the citing paper
“Abrams and Lloyd 38 focused on state preparation in more detail and described concrete initialization procedures.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
In the citing paper
“They pointed out that state preparation is conceptually easier in second quantization, where a Fock state is represented by a simple product state of qubits in {| 0 〉 , | 1 〉} states.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
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 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
Scheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
Rapid solution of problems by quantum computation
Deutsch, D., & Jozsa, R. (1992) · Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences · doi:10.1098/rspa.1992.0167 · Cited by 2,700
The Emperor's New Mind: Concerning Computers, Minds, and The Laws of Physics
Penrose, R., & Gardner, M. (1989) · doi:10.1093/oso/9780198519737.001.0001 · Cited by 2,007
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
On the Power of Quantum Computation
Simon, D. R. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796298637 · Cited by 1,295
Bernstein, E., & Vazirani, U. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167097 · Cited by 1,284
Benioff, P. (1980) · Journal of Statistical Physics · doi:10.1007/bf01011339 · Cited by 1,244
The Emperor's New Mind: Concerning Computers, Minds, and the Laws of Physics
Penrose, R., & Landauer, R. (1990) · Physics Today · doi:10.1063/1.2810599 · Cited by 1,110
Research works printed but not linked: 2
- [9]9. R. Penrose, Shadows of the mind,. Oxford University Press, 1994, pp. 348- 388.
- [14]14. Yao93J A. Yao, Quantum circuit complexip, Proceedings 34th Annual Symposium on Foundations of Computer Science (FOCS), 1993, pp. 352-361.
Cited by
Sorted by citations
Items 1,701–1,800 of 8,792
Evolving Hogg’s Quantum Algorithm Using Linear-Tree GP
Leier, A., & Banzhaf, W. (2003) · Lecture notes in computer science · doi:10.1007/3-540-45105-6_48 · Cited by 22
From Monte Carlo to quantum computation
Heinrich, S. (2003) · Mathematics and Computers in Simulation · doi:10.1016/s0378-4754(02)00239-2 · Cited by 26
van Dam, W. (1996) · Cited by 22
Zeno machines and hypercomputation
Potgieter, P. H. (2006) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.11.040 · Cited by 25
Lower Bounds in the Quantum Cell Probe Model
Sen, P., & Venkatesh, S. (2001) · Lecture notes in computer science · doi:10.1007/3-540-48224-5_30 · Cited by 22
On the Quantum Query Complexity of Detecting Triangles in GraphsPreprint
Szegedy, M. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0310107 · Cited by 25
Hybrid quantum-classical computing with applications to computer graphics
Lanzagorta, M. O., & Uhlmann, J. K. (2005) · ACM SIGGRAPH Conference (SIGGRAPH) · doi:10.1145/1198555.1198723 · Cited by 22
Nearly optimal separations between communication (or query) complexity and partitionsPreprint
Kothari, R. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1512.01210 · Cited by 24
Fast Quantum Algorithm for Solving Multivariate Quadratic EquationsPreprint
Faugère, J., Horan, K., Kahrobaei, D., Kaplan, M. A., Kashefi, E., & Perret, L. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1712.07211 · Cited by 27
Lightweight Post-Quantum-Secure Digital Signature Approach for IoT Motes.Preprint
Ghosh, S., Misoczki, R., & Sastry, M. R. (2019) · IACR Cryptology ePrint Archive · Cited by 22
Quantum Complexity of Testing Group CommutativityPreprint
Magniez, F., & Nayak, A. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0506265 · Cited by 22
Quantum Machine Learning: Unraveling a New Paradigm in Computational IntelligencePreprint
Khurana, S., & Nene, M. J. (2024) · doi:10.22541/au.171037552.27623320/v1 · Cited by 22
Quantized recurrence time in unital iterated open quantum dynamics
Sinkovicz, P., Kurucz, Z., Kiss, T., & Asbóth, J. K. (2015) · Physical Review A · doi:10.1103/physreva.91.042108 · Cited by 21
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
Equivalence, identity, and unitarity checking in black-box testing of quantum programs
Long, P., & Zhao, J. (2024) · Journal of Systems and Software · doi:10.1016/j.jss.2024.112000 · Cited by 35
QPASE: Quantum-Resistant Password-Authenticated Searchable Encryption for Cloud Storage
Jiang, J., & Wang, D. (2024) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2024.3372804 · Cited by 26
Shakib, K. H., Rahman, M., Islam, M., & Chowdhury, M. A. (2025) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2025.3534656 · Cited by 28
Desdentado, E., Calero, C., Moraga, M. Á., & García, F. O. (2025) · Computing · doi:10.1007/s00607-025-01459-2 · Cited by 22
Oracle Separation of BQP and PH
Raz, R., & Tal, A. (2022) · Journal of the ACM · doi:10.1145/3530258 · Cited by 21
Bitcoin Security with Post Quantum Cryptography
Semmouni, M. C., Nitaj, A., & Belkasmi, M. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-31277-0_19 · Cited by 23
Quantum fast hitting on glued trees mapped on a photonic chip
Shi, Z.-Y., Tang, H. L., Feng, Z., Wang, Y., Li, Z., Gao, J., Chang, Y.-J., Wang, T.-Y., Dou, J.-P., Zhang, Z.-Y., et al. (2020) · Optica · doi:10.1364/optica.388451 · Cited by 20
Optimization of lattice surgery is NP-hard
Herr, D., Nori, F., & Devitt, S. J. (2017) · OPUS - Open Publications of UTS Scholars (University of Technology Sydney) · doi:10.3929/ethz-b-000191303 · Cited by 22
Nearly Optimal Separations Between Communication (or Query) Complexity and Partitions
Ambainis, A., Kokainis, M., & Kothari, R. (2016) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.ccc.2016.4 · Cited by 22
Review on Quantum Walk Algorithm
Zhou, W. (2021) · Journal of Physics Conference Series · doi:10.1088/1742-6596/1748/3/032022 · Cited by 21
Mondal, S., Laskar, M. R., & Dutta, A. K. (2021) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2021.3055537 · Cited by 23
Engineering the development of quantum programs: Application to the Boolean satisfiability problem
Alonso, D., Sánchez, P., & Sánchez-Rubio, F. (2022) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2022.103216 · Cited by 24
Shi, R., & Li, Y.-F. (2022) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2022.3200974 · Cited by 21
On the Impossibility of Key Agreements from Quantum Random Oracles
Austrin, P., Chung, H., Chung, K.-M., et al. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-15979-4_6 · Cited by 21
A quantum key distribution routing scheme for hybrid-trusted QKD network system
Chen, L., Chen, J., Chen, Q.-Y., & Zhao, Y. (2023) · Quantum Information Processing · doi:10.1007/s11128-022-03825-x · Cited by 23
An introduction to variational quantum algorithms for combinatorial optimization problems
Grange, C., Poss, M., & Bourreau, E. (2023) · 4OR · doi:10.1007/s10288-023-00549-1 · Cited by 22
Enhancing quantum teleportation: an enable-based protocol exploiting distributed quantum gates
Ahmadkhaniha, A., Mafi, Y., Kazemikhah, P., et al. (2023) · Optical and Quantum Electronics · doi:10.1007/s11082-023-05351-1 · Cited by 21
Reducing 2-QuBit Gate Count for ZX-Calculus based Quantum Circuit Optimization
Staudacher, K., Guggemos, T., Grundner-Culemann, S., & Gehrke, W. (2023) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.394.3 · Cited by 22
Dynamic optimization based on quantum computation-A comprehensive review
Kou, H., Zhang, Y., & Lee, H. P. (2023) · Computers & Structures · doi:10.1016/j.compstruc.2023.107255 · Cited by 21
A Review of Post-Quantum Privacy Preservation for IoMT Using Blockchain
Sabrina, F., Sohail, S., & Tariq, U. U. (2024) · Electronics · doi:10.3390/electronics13152962 · Cited by 26
Challenges in Reliable Quantum Computing
Franklin, D. M., & Chong, F. T. (2006) · Kluwer Academic Publishers eBooks · doi:10.1007/1-4020-8068-9_8 · Cited by 23
Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision
Jeffery, S., Kothari, R., & Magniez, F. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-31594-7_44 · Cited by 22
Improved Quantum-Inspired Tabu Search Algorithm for Solving Function Optimization Problem
Yang, Y.-J., Kuo, S., Lin, F.-J., et al. (2013) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/smc.2013.146 · Cited by 21
Mini-maximizing two qubit quantum computations
Khan, F. S., & Phoenix, S. J. D. (2013) · Quantum Information Processing · doi:10.1007/s11128-013-0640-7 · Cited by 21
Quantum-Accelerated Fractal Image Compression: An Interdisciplinary Approach
Ду, С., Yan, Y., & Ma, Y. (2014) · IEEE Signal Processing Letters · doi:10.1109/lsp.2014.2363689 · Cited by 21
Trace monoids with idempotent generators and measure-only quantum automata
Bertoni, A., Mereghetti, C., & Palano, B. (2009) · Natural Computing · doi:10.1007/s11047-009-9154-8 · Cited by 21
Nested Quantum Search and NP-Hard Problems
Cerf, N. J., Grover, L. K., & Williams, C. P. (2000) · Applicable Algebra in Engineering Communication and Computing · doi:10.1007/s002000050134 · Cited by 22
Self-citationSelecting parameters for secure McEliece-based cryptosystems
Niebuhr, R., Meziani, M., Bulygin, S., & Buchmann, J. A. (2012) · International Journal of Information Security · doi:10.1007/s10207-011-0153-2 · Cited by 21
Multi-letter quantum finite automata: decidability of the equivalence and minimization of states
Qiu, D., Li, L., Zou, X., Mateus, P., & Gruska, J. (2011) · Acta Informatica · doi:10.1007/s00236-011-0139-6 · Cited by 21
Quantum Algorithms for Biomolecular Solutions of the Satisfiability Problem on a Quantum Machine
Chang, W.-L., Ren, T.-T., Luo, J. L., Feng, M., Guo, M., & Lin, K. W. (2008) · IEEE Transactions on NanoBioscience · doi:10.1109/tnb.2008.2002286 · Cited by 21
Ciliates learn to diagnose and correct classical error syndromes in mating strategies
Clark, K. B. (2013) · Frontiers in Microbiology · doi:10.3389/fmicb.2013.00229 · Cited by 21
Heterotic computing: past, present and future
Kendon, V. M., Sebald, A., & Stepney, S. (2015) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2014.0225 · Cited by 21
Solving Binary $$\mathcal {MQ}$$ with Grover’s Algorithm
Schwabe, P., & Westerbaan, B. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-49445-6_17 · Cited by 21
Chandra, D., Babar, Z., Nguyen, H. V., Alanis, D., Botsinis, P., Ng, S. X., & Hanzo, L. (2017) · IEEE Access · doi:10.1109/access.2017.2716367 · Cited by 19
Nested quantum annealing correction at finite temperature: p -spin models
Matsuura, S., Nishimori, H., Vinci, W., & Lidar, D. A. (2019) · Physical Review A · doi:10.1103/physreva.99.062307 · Cited by 21
High Performance Modular Multiplication for SIDH
Liu, W., Ni, Z., Ni, J., Rafferty, C., & O'Neill, M. P. (2019) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2019.2960330 · Cited by 21
The Supersingular Isogeny Problem in Genus 2 and Beyond
Costello, C., & Smith, B. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-44223-1_9 · Cited by 21
Accelerating Scientific Computing in the Post-Moore’s Era
Hamilton, K. E., Schuman, C. D., Young, S. R., Bennink, R. S., Imam, N., & Humble, T. S. (2020) · ACM Transactions on Parallel Computing · doi:10.1145/3380940 · Cited by 24
On Security Notions for Encryption in a Quantum World
Chevalier, C., Ebrahimi, E., & Vu, Q.-H. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-22912-1_26 · Cited by 22
Quantum-sapiens: the quantum bases for human expertise, knowledge, and problem-solving
Bickley, S. J., Chan, H. F., Schmidt, S. L., & Torgler, B. (2021) · Technology Analysis and Strategic Management · doi:10.1080/09537325.2021.1921137 · Cited by 23
Jang, K., Song, G., Kwon, H., Uhm, S., Kim, H., Lee, W., & Seo, H. (2021) · Electronics · doi:10.3390/electronics10101194 · Cited by 21
Improvements to Quantum Search Techniques for Block-Ciphers, with Applications to AES
Davenport, J. H., & Pring, B. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-81652-0_14 · Cited by 21
Semiconductor Quantum Computing: Toward a CMOS quantum computer on chip
Nikandish, G., Blokhina, E., Leipold, D. R., & Staszewski, R. B. (2021) · IEEE Nanotechnology Magazine · doi:10.1109/mnano.2021.3113216 · Cited by 24
Piispanen, L. J., Pfaffhauser, M., Wootton, J. R., Togelius, J., & Kultima, A. (2025) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-025-00308-7 · Cited by 32
Cryogenic Electronics and Quantum Information Processing
Holmes, D. S. (2021) · doi:10.1109/irds54852.2021.00012 · Cited by 24
Self-protected quantum algorithms based on quantum state tomography
Wu, L.-A., & Byrd, M. (2008) · Quantum Information Processing · doi:10.1007/s11128-008-0090-9 · Cited by 21
Quantum search algorithm for set operation
Pang, C.-Y., Zhou, R., Ding, C.-B., & Hu, B.-Q. (2012) · Quantum Information Processing · doi:10.1007/s11128-012-0385-8 · Cited by 21
Optimal Quantum Sample Complexity of Learning Algorithms
Arunachalam, S., & de Wolf, R. (2016) · UvA-DARE (University of Amsterdam) · doi:10.48550/arxiv.1607.00932 · Cited by 40
Designing quantum information processing via structural physical approximation
Bae, J. (2017) · Reports on Progress in Physics · doi:10.1088/1361-6633/aa7d45 · Cited by 23
Quantum networks for concentrating entanglement
Kaye, P., & Mosca, M. (2001) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/34/35/319 · Cited by 25
New upper and lower bounds for randomized and quantum local search
Zhang, S. (2006) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1132516.1132605 · Cited by 20
The quest for error correction in biology
Gupta, M. K. (2006) · IEEE Engineering in Medicine and Biology Magazine · doi:10.1109/memb.2006.1578663 · Cited by 21
Cleve, R., EKERT, A. K., Henderson, L., Macchiavello, C., & Mosca, M. (1998) · Explore Bristol Research · Cited by 25
Quantum and classical query complexities of local search are polynomially related
Sántha, M., & Szegedy, M. (2004) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1007352.1007427 · Cited by 22
Efficient algorithms in quantum query complexity
Kothari, R. (2014) · UWSpace (University of Waterloo) · Cited by 26
Quantum Circuit IdentitiesPreprint
Lomont, C. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0307111 · Cited by 23
An Introduction to Quantum Game TheoryPreprint
Grabbe, J. O. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0506219 · Cited by 30
Optimizing the Number of Gates in Quantum Search
Arunachalam, S., & de Wolf, R. (2017) · Quantum Information and Computation · doi:10.26421/qic17.3-4 · Cited by 21
Quantum Algorithms for Quantum Chemistry based on the sparsity of the CI-matrixPreprint
Toloui, B., & Love, P. J. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1312.2579 · Cited by 40
An Introduction to Quantum Computing for Non-PhysicistsPreprint
Rieffel, E. G., & Polak, W. (1998) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9809016 · Cited by 21
A learning graph based quantum query algorithm for finding constant-size subgraphsPreprint
Lee, T., Magniez, F., & Sántha, M. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1109.5135 · Cited by 28
Quantum Safe Lightweight Cryptography with Quantum Permutation Pad
Kuang, R., Lou, D., He, A., & Conlon, A. (2021) · 2021 IEEE 6th International Conference on Computer and Communication Systems (ICCCS) · doi:10.1109/icccs52626.2021.9449247 · Cited by 21
QiBAM: approximate sub-string index search on quantum accelerators applied to DNA read alignment
Sarkar, A., Al-Ars, Z., Almudever, C. G., & Bertels, K. L. M. (2021) · Electronics · doi:10.3390/electronics10192433 · Cited by 20
Energy-Efficient Cluster Head Selection via Quantum Approximate Optimization
Choi, J., Oh, S., & Kim, J. (2020) · Electronics · doi:10.3390/electronics9101669 · Cited by 20
Parameswarath, R. P., Wang, C., & Sikdar, B. (2024) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2024.3427110 · Cited by 22
Quantum algorithms for scientific computing
Au-Yeung, R., Camino, B., Rathore, O., & Kendon, V. M. (2024) · Reports on Progress in Physics · doi:10.1088/1361-6633/ad85f0 · Cited by 37
Zalivako, I. V., Nikolaeva, A. S., Borisenko, A. S., Korolkov, A. E., Sidorov, P., Galstyan, K. P., Semenin, N. V., Smirnov, V. N., Aksenov, M. A., Makushin, K. M., et al. (2025) · Quantum Reports · doi:10.3390/quantum7020019 · Cited by 33
Cryptanalysis of a Quantum Proxy Weak Blind Signature Scheme
Zhang, K., & Jia, H.-Y. (2014) · International Journal of Theoretical Physics · doi:10.1007/s10773-014-2250-2 · Cited by 20
Adaptive double chain quantum genetic algorithm for constrained optimization problems
Kong, H., Li, N., & Shen, Y. (2014) · Chinese Journal of Aeronautics · doi:10.1016/j.cja.2014.12.010 · Cited by 20
Considering nearest neighbor constraints of quantum circuits at the reversible circuit level
Wille, R., Lye, A., & Drechsler, R. (2013) · Quantum Information Processing · doi:10.1007/s11128-013-0642-5 · Cited by 20
On Two Quantum Approaches to Adaptive Mutations in Bacteria
Ogryzko, V. V. (2009) · NeuroQuantology · doi:10.14704/nq.2009.7.4.253 · Cited by 19
Wang, W., Han, J., Yadin, B., Ma, Y., Ma, J., Cai, W., Xu, Y., Hu, L., Wang, H., Song, Y., et al. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.220501 · Cited by 21
A New Variant of Unbalanced Oil and Vinegar Using Quotient Ring: QR-UOV
Furue, H., Ikematsu, Y., Kiyomura, Y., et al. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92068-5_7 · Cited by 20
Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving
Apers, S., & de Wolf, R. (2020) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs46700.2020.00065 · Cited by 22
Quantum Exploration Algorithms for Multi-Armed Bandits
Wang, D., You, X., Li, T., & Childs, A. M. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i11.17212 · Cited by 21
Martin, B. A., Simon, P., & Rančić, M. J. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.023190 · Cited by 25
Graph coloring using the reduced quantum genetic algorithm
Ardelean, S. M., & Udrescu, M. (2022) · PeerJ Computer Science · doi:10.7717/peerj-cs.836 · Cited by 20
Advances in Quantum Computation and Quantum Technologies: A Design Automation Perspective
Micheli, G. D., Jiang, J.-H. R., Rand, R. W., Smith, K. N., & Soeken, M. (2022) · IEEE Journal on Emerging and Selected Topics in Circuits and Systems · doi:10.1109/jetcas.2022.3205174 · Cited by 23
Quantum Blockchain Based on Dimensional Lifting Generalized Gram-Schmidt Procedure
Nilesh, K., & Panigrahi, P. K. (2022) · IEEE Access · doi:10.1109/access.2022.3208123 · Cited by 20
The Potential of Quantum Computing for Geoscience
Sahimi, M., & Tahmasebi, P. (2022) · Transport in Porous Media · doi:10.1007/s11242-022-01855-8 · Cited by 22
Verified compilation of Quantum oracles
Li, L., Voichick, F., Hietala, K., Peng, Y., Wu, X., & Hicks, M. (2022) · Proceedings of the ACM on Programming Languages · doi:10.1145/3563309 · Cited by 19
A Tool For Debugging Quantum Circuits
Metwalli, S. A., & Meter, R. V. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00085 · Cited by 24
New record in the number of qubits for a quantum implementation of AES
Li, Z., Gao, F., Qin, S., & Wen, Q. (2023) · Frontiers in Physics · doi:10.3389/fphy.2023.1171753 · Cited by 20
A Review of Quantum-Inspired Metaheuristic Algorithms for Automatic Clustering
Dey, A., Bhattacharyya, S., Dey, S., Konar, D., Platoš, J., Snåšel, V., Mršić, L., & Pal, P. (2023) · Mathematics · doi:10.3390/math11092018 · Cited by 24
Making existing software quantum safe: A case study on IBM Db2
Zhang, L., Miranskyy, A. V., Rjaibi, W., Stager, G., Gray, M., & Peck, J. S. (2023) · Information and Software Technology · doi:10.1016/j.infsof.2023.107249 · Cited by 25
Fast Fingerprinting of Cloud-based NISQ Quantum Computers
Smith, K. N., Viszlai, J., Seifert, L. M., Baker, J. M., Szefer, J. M., & Chong, F. T. (2023) · IEEE International Symposium on Hardware Oriented Security and Trust (HOST) · doi:10.1109/host55118.2023.10133778 · Cited by 23
Metadata
- Authors
- Grover, L. K.
- Affiliations
- AT&T (United States) (US)
- Corresponding author
- Grover, Lov K.
- Venue
- Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96
- Publisher
- ACM Press
- Published
- 1996
- Pages
- 212-219
- OpenAlex
- W2084652510
- Semantic Scholar
- 298d799da82395a64a3bda38ef9d2a4646828ccb
- Cited by
- 8,830
- References
- 24
- Citations by year
- 2026: 664 · 2025: 1066 · 2024: 896 · 2023: 841 · 2022: 674 · 2021: 655 · 2020: 529 · 2019: 423 · 2018: 288 · 2017: 283 · 2016: 219 · 2015: 221 · 2014: 184 · 2013: 161 · 2012: 158
- FWCI
- 36.24
- Type
- conference paper
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- ACM Symposium on Theory of Computing (STOC) (publishedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- quantum search, unsorted database search, Grover's algorithm, quantum algorithms, time complexity, quantum parallelism, lower bounds
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.
A language model drew the claims from the paper on 2026-10-21, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-21 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
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
