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 3,201–3,300 of 8,792
Wu, Q., Liu, W., Huang, Y. Y., Liu, H., Xiao, H., & Li, Z. (2024) · iScience · doi:10.1016/j.isci.2024.109394 · Cited by 8
Quantum secure multi-party computational geometry based on multi-party summation and multiplication
Dou, Z., Wang, Y., Liu, Z., et al. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad34f5 · Cited by 8
Cycle discrete-time quantum walks on a noisy quantum computer
Wadhia, V., Chancellor, N., & Kendon, V. M. (2024) · The European Physical Journal D · doi:10.1140/epjd/s10053-023-00795-2 · Cited by 9
A quantum computing concept for 1-D elastic wave simulation with exponential speedup
Schade, M., Bösch, C., Hapla, V., & Fichtner, A. (2024) · Geophysical Journal International · doi:10.1093/gji/ggae160 · Cited by 18
A Thorough Study of State Leakage Mitigation in Quantum Computing with One-Time Pad
Xu, C., Sikora, J., & Szefer, J. M. (2024) · IEEE International Symposium on Hardware Oriented Security and Trust (HOST) · doi:10.1109/host55342.2024.10545386 · Cited by 11
Solid‐State Qubit as an On‐Chip Controller for Non‐Classical Field States
Zakharov, R. V., Tikhonova, O. V., Klenov, N. V., Soloviev, I. I., Antonov, V. N., & Yakovlev, D. S. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202400141 · Cited by 8
Qutrit representation of quantum images: new quantum ternary circuit design
Monfared, A. T., Ciriani, V., & Haghparast, M. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04484-w · Cited by 8
Exponential qubit reduction in optimization for financial transaction settlement
Huber, E. X., Tan, B. Y. L., Griffin, P., & Angelakis, D. G. (2024) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-024-00262-w · Cited by 14
In-line rate encrypted links using pre-shared post-quantum keys and DPUs
Aguilera, A. C., García, C. R., Lawo, D. C., Imaña, J. L., Monroy, I. T., & Olmos, J. J. V. (2024) · Scientific Reports · doi:10.1038/s41598-024-71861-x · Cited by 13
Surf-Deformer: Mitigating Dynamic Defects on Surface Code via Adaptive Deformation
Yin, K., Fang, X., Humble, T. S., Li, A., Shi, Y., & Ding, Y. (2024) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1109/micro61859.2024.00061 · Cited by 9
Using quantum switches to mitigate noise in Grover’s search algorithm
Srivastava, S., Pati, A. K., Chakrabarty, I., & Bhattacharya, S. (2024) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ad9efc · Cited by 8
Efficient quantum algorithm for lattice protein folding
Wang, Y., & Zhou, X. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ada08e · Cited by 9
A survey on isogeny-based cryptographic protocols
Mishra, S., Mondal, B., & Jha, R. K. (2025) · Wireless Networks · doi:10.1007/s11276-025-03906-6 · Cited by 8
Quantum technology: a financial risk assessment
Nguyen, P.-N. (2025) · Digital Finance · doi:10.1007/s42521-025-00127-6 · Cited by 12
Quantum reservoir computing in atomic lattices
Llodrà, G., Mujal, P., Zambrini, R., & Giorgi, G. L. (2025) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2025.116289 · Cited by 16
Accelerating Quantum Circuit Simulation with Symbolic Execution and Loop Summarization
Chen, T.-F., Chen, Y., Jiang, J.-H. R., Jobranová, S., & Lengál, O. (2024) · doi:10.1145/3676536.3676711 · Cited by 8
Quantum Algorithms for Matrix Products over Semirings
Gall, F. L., & Nishimura, H. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-08404-6_29 · Cited by 8
Secure digital archiving in post-quantum era
Člupek, V., Malina, L., & Zeman, V. (2015) · International Conference on Telecommunications and Signal Processing (TSP) · doi:10.1109/tsp.2015.7296338 · Cited by 9
A quantum search algorithm for future spacecraft attitude determination
Tsai, J., Hsiao, F.-Y., Li, Y.-J., et al. (2010) · Acta Astronautica · doi:10.1016/j.actaastro.2010.10.023 · Cited by 8
Optimal Coverage Scheme based on QPSO in Wireless Sensor Networks
Huang, Y., Qu, L., & Tang, C. (2012) · Journal of Networks · doi:10.4304/jnw.7.9.1362-1368 · Cited by 8
Space of Dark States in Tavis-Cummings Model
Ozhigov, Y. (2019) · Sovremennye informacionnye tehnologii i IT-obrazovanie. · doi:10.25559/sitito.15.201901.13-26 · Cited by 8
Dey, S., Bhattacharyya, S., & Maulik, U. (2015) · IGI Global eBooks · doi:10.4018/978-1-4666-7456-1.ch024 · Cited by 8
Computability and Complexity of Unconventional Computing Devices
Broersma, H. J., Stepney, S., & Wendin, G. P. (2018) · Natural computing series · doi:10.1007/978-3-319-65826-1_11 · Cited by 8
Solving Lyapunov equation by quantum algorithm
Sun, H., & Zhang, J. (2017) · Control Theory and Technology · doi:10.1007/s11768-017-7091-0 · Cited by 8
Improved circuit synthesis approach for exclusive‐sum‐of‐product‐based reversible circuits
Bandyopadhyay, C., Parekh, S., & Rahaman, H. (2018) · IET Computers & Digital Techniques · doi:10.1049/iet-cdt.2017.0016 · Cited by 8
QCF: Quantum Collaborative Filtering Recommendation Algorithm
Wang, X., Wang, R., Li, D., Adu-Gyamfi, D., & Zhu, Y. (2019) · International Journal of Theoretical Physics · doi:10.1007/s10773-019-04114-7 · Cited by 8
Quantum LLL with an Application to Mersenne Number Cryptosystems
Tiepelt, M., & Szepieniec, A. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-30530-7_1 · Cited by 9
Near-term Quantum Algorithms for Quantum Many-body Systems
Ritter, M. B. (2019) · Journal of Physics Conference Series · doi:10.1088/1742-6596/1290/1/012003 · Cited by 8
An Improved Quantum E-Payment System
Xie, S.-C., Niu, X.-F., & Zhang, J.-Z. (2019) · International Journal of Theoretical Physics · doi:10.1007/s10773-019-04338-7 · Cited by 8
Improved Ternary Reversible Logic Synthesis Using Group Theoretic Approach
Rani, P. M. N., & Datta, K. (2019) · Journal of Circuits Systems and Computers · doi:10.1142/s0218126620501923 · Cited by 8
Quantum-resistant Lattice-based Authentication for V2X Communication in C-ITS
Ha, S., Lee, H., Won, D., & Lee, Y. (2020) · International Conference on Ubiquitous Information Management and Communication (IMCOM) · doi:10.1109/imcom48794.2020.9001682 · Cited by 8
Verifiable Quantum Secret Sharing Based on a Single Qudit
Zhi, D.-L., Li, Z.-H., Han, Z.-W., & Liu, L.-J. (2020) · International Journal of Theoretical Physics · doi:10.1007/s10773-020-04599-7 · Cited by 8
Stateful Hash-based Digital Signature Schemes for Bitcoin Cryptocurrency
NOEL, M. D., Waziri, V. O., Abdulhamid, S. M., et al. (2019) · International Conference on Electronics, Computer and Computation · doi:10.1109/icecco48375.2019.9043192 · Cited by 8
Quantum-over-Classical Advantage in Solving Multiplayer Games
Kravchenko, D., Khadiev, K. R., Serov, D., et al. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-61739-4_6 · Cited by 8
Perkowski, M. A. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-52482-1_1 · Cited by 8
Limitations of Hartree–Fock with quantum resources
Gulania, S., & Whitfield, J. D. (2021) · The Journal of Chemical Physics · doi:10.1063/5.0018415 · Cited by 10
A generalized floating-point quantum representation of 2-D data and their applications
Zhang, R., Xu, M., & Lu, D. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02895-z · Cited by 8
Physics’ Evolution Toward Computing
Nakamura, T., & Nagata, K. (2020) · International Journal of Theoretical Physics · doi:10.1007/s10773-020-04661-4 · Cited by 9
Circuit design for clique problem and its implementation on quantum computer
Sanyal, A., Saha, A., Saha, B., & Chakrabarti, A. (2021) · IET Quantum Communication · doi:10.1049/qtc2.12029 · Cited by 10
The Cost Reduction of Distributed Quantum Factorization Circuits
Mousavi, M., Houshmand, M., & Bolokian, M. (2021) · International Journal of Theoretical Physics · doi:10.1007/s10773-021-04756-6 · Cited by 8
Lower Bounds on Stabilizer Rank
Peleg, S., Shpilka, A., & Volk, B. L. (2022) · Quantum · doi:10.22331/q-2022-02-15-652 · Cited by 10
The complex path to quantum resistance
Mashatan, A., & Heintzman, D. (2021) · Communications of the ACM · doi:10.1145/3464905 · Cited by 10
Emerging Technologies for Quantum Computing
Baker, J. M., & Chong, F. T. (2021) · IEEE Micro · doi:10.1109/mm.2021.3099139 · Cited by 9
FAST: Secure and High Performance Format-Preserving Encryption and Tokenization
Durak, F. B., Horst, H., Horst, M., et al. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92078-4_16 · Cited by 8
Quantum algorithm and experimental demonstration for the subset sum problem
Zheng, Q., Zhu, P., Xue, S., Wang, Y., Wu, C., Yu, X., Yu, M., Liu, Y., Deng, M., Wu, J., et al. (2021) · Science China Information Sciences · doi:10.1007/s11432-021-3334-1 · Cited by 8
AKAME: A post-quantum authenticated key-agreement and message encryption scheme based on ring-LWE
Choudhary, S., & Gupta, A. K. (2022) · International Journal of Information Technology · doi:10.1007/s41870-022-00888-y · Cited by 8
T-depth Reduction Method for Efficient SHA-256 Quantum Circuit Construction
Lee, J., Lee, S., Lee, Y.-S., & Choi, D. (2022) · International Conference on Information Security and Cryptology · doi:10.1049/ise2.12074 · Cited by 11
Quantum circuit architectures via quantum observable Markov decision process planning
Kimura, T., Shiba, K., Chen, C.-C., et al. (2022) · Journal of Physics Communications · doi:10.1088/2399-6528/ac7d39 · Cited by 8
Performance Analysis of Quantum Classifier on Benchmarking Datasets
Kumar, T., Kumar, D., & Singh, G. (2022) · International Journal of Electrical and Electronics Research · doi:10.37391/ijeer.100252 · Cited by 8
A Secured Quantum Two-Bit Commitment Protocol for Communication Systems
Khawasik, M., El-Sayed, W. G., Rashad, M. Z., et al. (2022) · IEEE Access · doi:10.1109/access.2022.3173645 · Cited by 8
Multi-Heuristic Machine Intelligence Guidance in Automatic Test Pattern Generation
Roy, S., Millican, S. K., & Agrawal, V. D. (2022) · doi:10.1109/mdts54894.2022.9826985 · Cited by 8
Quantum zero correlation linear cryptanalysis
Shi, R., Xie, H., Feng, H., et al. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03642-2 · Cited by 8
A Novel Hypercube-Based Heuristic for Quantum Boolean Circuit Synthesis
Jiang, Y.-C., Tseng, K.-C., Hua, C.-Y., et al. (2022) · IEEE Journal on Emerging and Selected Topics in Circuits and Systems · doi:10.1109/jetcas.2022.3202840 · Cited by 8
Tian, Y., Chen, H., Xiang, X., Jiang, H., & Zhang, X. (2022) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec55065.2022.9870359 · Cited by 8
A Blockchain-Based Long-Term Time-Stamping Scheme
Meng, L., & Chen, L. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-17140-6_1 · Cited by 8
Loss-tolerant quantum multi-party key agreement without quantum storage
Wei, C., Cai, X., Huang, S.-L., et al. (2022) · Optics Express · doi:10.1364/oe.471164 · Cited by 8
Knowledge Navigated Quantum-inspired Tabu Search Algorithm for Reversible Circuit Synthesis
Hsu, H.-Y., Hou, S.-J., Chen, Y.-Y., et al. (2022) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/smc53654.2022.9945332 · Cited by 8
Controller-Based Energy-Aware Wireless Sensor Network Routing Using Quantum Algorithms
Chen, J., Date, P., Chancellor, N., Atiquzzaman, M., & Sreenan, C. J. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2022.3217297 · Cited by 11
Implementing Grover Oracle for Lightweight Block Ciphers Under Depth Constraints
Bijwe, S., Chauhan, A. K., & Sanadhya, S. K. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-22301-3_5 · Cited by 8
Improved Quantum Analysis of SPECK and LowMC
Jang, K., Baksi, A., Kim, H., Seo, H., & Chattopadhyay, A. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-22912-1_23 · Cited by 8
A Polynomial Multiplication Accelerator for Faster Lattice Cipher Algorithm in Security Chip
Xu, C., Yu, H., Xi, W., Zhu, J., Chen, C., & Jiang, X. (2023) · Electronics · doi:10.3390/electronics12040951 · Cited by 8
Optimizing the Depth of Quantum Implementations of Linear Layers
Zhu, C., & Huang, Z.-Y. (2022) · Conference on Information Security and Cryptology · doi:10.1007/978-3-031-26553-2_7 · Cited by 11
First Attempts at Cryptanalyzing a (Toy) Block Cipher by Means of Quantum Optimization Approaches
Phab, L., Louise, S., & Sirdey, R. (2023) · Journal of Computational Science · doi:10.1016/j.jocs.2023.102004 · Cited by 8
Quantum Computer-Aided Design Automation
Kuo, S.-Y., Jiang, Y.-C., Chou, Y.-H., Kuo, S.-Y., & Kung, S. (2023) · IEEE Nanotechnology Magazine · doi:10.1109/mnano.2023.3249500 · Cited by 8
Quantum Walk Search on a Two-dimensional Grid with Extra Edges
Giri, P. R. (2023) · International Journal of Theoretical Physics · doi:10.1007/s10773-023-05369-x · Cited by 8
Quantum-Access Security of Hash-Based Signature Schemes
Yuan, Q., Tibouchi, M., & Abe, M. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-35486-1_16 · Cited by 8
Single-Molecule Identification of Nucleotides Using a Quantum Computer
Taniguchi, M., Ohshiro, T., & Tada, T. (2023) · The Journal of Physical Chemistry B · doi:10.1021/acs.jpcb.3c02918 · Cited by 9
Differentiable Quantum Programming with Unbounded Loops
Fang, W. S., Ying, M., & Wu, X. (2023) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3617178 · Cited by 12
Wang, X., Okyay, M. S., Kumar, A., & Wong, B. M. (2023) · AVS Quantum Science · doi:10.1116/5.0162455 · Cited by 8
Quantum Algorithm for Lexicographically Minimal String Rotation
Wang, Q., & Ying, M. (2023) · Theory of Computing Systems · doi:10.1007/s00224-023-10146-8 · Cited by 15
Investigating an amplitude amplification-based optimization algorithm for model predictive control
Nieman, K., Durand, H., Patel, S., Koch, D., & Alsing, P. M. (2023) · Digital Chemical Engineering · doi:10.1016/j.dche.2023.100134 · Cited by 8
Amplitude amplification-inspired QAOA: improving the success probability for solving 3SAT
Mandl, A., Barzen, J., Bechtold, M., Leymann, F., & Wild, K. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/ad141d · Cited by 11
Quantum Attacks on Hash Constructions with Low Quantum Random Access Memory
Dong, X., Li, S., Pham, P., & Zhang, G. (2023) · Lecture notes in computer science · doi:10.1007/978-981-99-8727-6_1 · Cited by 8
Santos, L. P., Bashford‐Rogers, T., Barbosa, J., & Navrátil, P. (2024) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2024.3386103 · Cited by 11
Quantum Voting Scheme Based on Conjugate Coding
Okamoto, T., Suzuki, K., & Tokunaga, Y. (2008) · NTT technical review · doi:10.53829/ntr200801sp3 · Cited by 8
A Multiagent Quantum Evolutionary Algorithm for Global Numerical Optimization
Qin, C., Zheng, J., & Lai, J. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-74771-0_43 · Cited by 8
The Quantum Complexity of Group Testing
Dörn, S., & Thierauf, T. (2008) · Springer eBooks · doi:10.1007/978-3-540-77566-9_44 · Cited by 8
Uniform approximation by (quantum) polynomials
Drucker, A., & de Wolf, R. (2011) · Quantum Information and Computation · doi:10.5555/2011395.2011397 · Cited by 7
Multiple network alignment on quantum computers
Daskin, A., Grama, A., & Kais, S. (2014) · Quantum Information Processing · doi:10.1007/s11128-014-0818-7 · Cited by 8
Image Restoration Using a Multilayered Quantum Backpropagation Neural Network
Mukherjee, S. S., Chowdhury, R., & Bhattacharyya, S. (2011) · International Conference on Computational Intelligence and Communication Networks (CICN) · doi:10.1109/cicn.2011.89 · Cited by 8
Entangling capacity of global phases and implications for the Deutsch-Jozsa algorithm
Azuma, H., Bose, S., & Vedral, V. (2001) · Physical Review A · doi:10.1103/physreva.64.062308 · Cited by 8
Binary superposed quantum decision diagrams
Rosenbaum, D. J. (2009) · Quantum Information Processing · doi:10.1007/s11128-009-0153-6 · Cited by 8
The Generalized Quantum Database Search Algorithm
Imre, S., & Bal�zs, F. (2004) · Computing · doi:10.1007/s00607-004-0089-8 · Cited by 8
A remark on zeta functions of finite graphs via quantum walks
Higuchi, Y., Konno, N., Sato, I., & Segawa, E. (2014) · Pacific Journal of Mathematics for Industry · doi:10.1186/s40736-014-0009-6 · Cited by 9
A real-coded quantum-inspired evolutionary algorithm for global numerical optimization
Qin, C., Liu, Y., & Zheng, J. (2008) · IEEE Conference on Cybernetics and Intelligent Systems · doi:10.1109/iccis.2008.4670779 · Cited by 8
Toward a Framework for Quantum Evolutionary Computation
Sofge, D. (2006) · IEEE Conference on Cybernetics and Intelligent Systems · doi:10.1109/iccis.2006.252360 · Cited by 8
Superposition-Inspired Reinforcement Learning and Quantum Reinforcement Learning
Chen, C., & Dong, D. (2008) · doi:10.5772/5275 · Cited by 8
Saeedi, M., Zamani, M. S., & Sedighi, M. (2015) · Cited by 8
An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation
Nishimura, H., & Yamakami, T. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-28629-5_65 · Cited by 8
Global Optimization With Quantum Walk Enhanced Grover Search
Wang, Y. (2014) · ASME International Design Engineering Technical Conferences and Computers and Information in Engineering Conference (IDETC/CIE) · doi:10.1115/detc2014-34634 · Cited by 8
Quantum approaches to graph colouring
D’Hondt, E. (2008) · Theoretical Computer Science · doi:10.1016/j.tcs.2008.09.055 · Cited by 8
An Information-Theoretic Analysis of Grover’s Algorithm
Arıkan, E. (2003) · Springer eBooks · doi:10.1007/978-94-010-0171-7_15 · Cited by 9
Quantum-Inspired Swarm Evolution Algorithm
You-rui, H., Tang, C., & Wang, S. (2007) · Computational Intelligence and Security · doi:10.1109/cis.workshops.2007.233 · Cited by 8
On the Relation Between Quantum Computational Speedup and Retrocausality
Castagnoli, G. (2016) · Quanta · doi:10.12743/quanta.v5i1.38 · Cited by 8
A Quantum Jensen-Shannon Graph Kernel Using Discrete-Time Quantum Walks
Bai, L., Rossi, L., Ren, P., Zhang, Z., & Hancock, E. R. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-18224-7_25 · Cited by 7
Quantum Computing Based Technique for Cancer Disease Detection System
Jain, M. (2014) · Journal of Computer Science & Systems Biology · doi:10.4172/jcsb.1000143 · Cited by 7
Lee, B. E. J., & Perkowski, M. A. (2016) · Euromicro Conference on Digital System Design (DSD) · doi:10.1109/dsd.2016.30 · Cited by 8
Cuffaro, M. E. (2018) · Philosophy of engineering and technology · doi:10.1007/978-3-319-93779-3_11 · Cited by 9
Analysis of Quantum Algorithms with Classical Systems Counterpart
Sihare, S. R., & Nath, V. V. (2017) · International Journal of Information Engineering and Electronic Business · doi:10.5815/ijieeb.2017.02.03 · Cited by 8
Buschsieweke, M., & Güneş, M. (2017) · IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC) · doi:10.1109/pimrc.2017.8292689 · Cited by 8
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
