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,901–2,000 of 8,792
Quantum Online Streaming Algorithms with Logarithmic Memory
Khadiev, K. R., & Khadieva, A. (2019) · International Journal of Theoretical Physics · doi:10.1007/s10773-019-04209-1 · Cited by 19
Niemann, P., Zulehner, A., Drechsler, R., & Wille, R. (2020) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2020.2977603 · Cited by 19
WOTS-S: A Quantum Secure Compact Signature Scheme for Distributed Ledger
Shahid, F., Khan, A., Malik, S. U. R., et al. (2020) · Information Sciences · doi:10.1016/j.ins.2020.05.024 · Cited by 19
Exploring Lattice-based Post-Quantum Signature for JWT Authentication: Review and Case Study
Alkhulaifi, A., & El-Alfy, E.-S. M. (2020) · IEEE Vehicular Technology Conference · doi:10.1109/vtc2020-spring48590.2020.9129505 · Cited by 19
SodsBC: Stream of Distributed Secrets for Quantum-safe Blockchain
Dolev, S., & Wang, Z. (2020) · IEEE International Conference on Blockchain (Blockchain) · doi:10.1109/blockchain50366.2020.00038 · Cited by 19
A Quantum Walk Model of Financial Options
Orrell, D. (2020) · Wilmott · doi:10.1002/wilm.10918 · Cited by 19
The Complex Path to Quantum Resistance
Mashatan, A., & Heintzman, D. (2021) · Queue · doi:10.1145/3466132.3466779 · Cited by 22
Saeedi, M., Zamani, M. S., & Sedighi, M. (2008) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1109/aspdac.2008.4484066 · Cited by 19
Grover Search and the No-Signaling Principle
Bao, N., Bouland, A., & Jordan, S. P. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.120501 · Cited by 28
The query complexity of order-finding
Cleve, R. (2004) · Information and Computation · doi:10.1016/j.ic.2004.04.001 · Cited by 19
On the hitting times of quantum versus random walks
Magniez, F., Nayak, A., Richter, P. C., & Sántha, M. (2009) · Symposium on Discrete Algorithms · doi:10.5555/1496770.1496780 · Cited by 20
Average-case quantum query complexity
Ambainis, A., & de Wolf, R. (2001) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/34/35/302 · Cited by 19
New Results on Quantum Property Testing
Chakraborty, S., Fischer, E., Matsliah, A., & de Wolf, R. (2010) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.fsttcs.2010.145 · Cited by 19
Quantum circuits synthesis using Householder transformations
de Brugière, T. G., Baboulin, M., Valiron, B., & Allouche, C. (2019) · Computer Physics Communications · doi:10.1016/j.cpc.2019.107001 · Cited by 22
Grover’s Algorithm for Multiobject Search in Quantum Computing
Chen, G., Fulling, S. A., Lee, H., et al. (2007) · Springer eBooks · doi:10.1007/3-540-40894-0_15 · Cited by 19
Distributed Arithmetic on a Quantum Multicomputer
Meter, R. V., Nemoto, K., Munro, W. J., & Itoh, K. M. (2006) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca.2006.19 · Cited by 20
Multiple sequence alignment by quantum genetic algorithm
Layeb, A., Meshoul, S., & Batouche, M. (2006) · Proceedings - IEEE International Parallel and Distributed Processing Symposium · doi:10.1109/ipdps.2006.1639617 · Cited by 19
Design of Reversible/Quantum Ternary Comparator Circuits
Khan, M. H. A. (2008) · Cited by 19
The query complexity of order-finding
Cleve, R. (2002) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.2000.856735 · Cited by 19
Metaheuristic Search as a Cryptological Tool
Clark, J. A. (2002) · White Rose Research Online (University of Leeds, The University of Sheffield, University of York) · Cited by 19
Applications of Multi-Valued Quantum AlgorithmsPreprint
Fan, Y. (2008) · doi:10.48550/arxiv.0809.0932 · Cited by 19
Khan, F. S., & Torre, D. L. (2021) · Technology Analysis and Strategic Management · doi:10.1080/09537325.2021.1991576 · Cited by 22
Discrete quantum walks and quantum image processing
Venegas-Andraca, S. E. (2005) · Oxford University Research Archive (ORA) (University of Oxford) · doi:10.5287/ora-ov8x0ja0r · Cited by 19
A Theory of Cartesian Arrays (with Applications in Quantum Circuit Verification)
Chen, Y., Rümmer, P., & Tsai, W.-L. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-38499-8_10 · Cited by 18
PRISM: Simple and Compact Identification and Signatures from Large Prime Degree Isogenies
Basso, A., Borin, G., Castryck, W., et al. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-91826-1_10 · Cited by 18
Blockchain Security Risk Assessment in Quantum Era, Migration Strategies, and Proactive Defense
Baseri, Y., Hafid, A. S., Shahsavari, Y., Makrakis, D., & Khodaiemehr, H. (2025) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2025.3621113 · Cited by 25
Quantum versus Classical Pushdown Automata in Exact Computation
Murakami, Y., Nakanishi, M., Yamashita, S., et al. (2005) · IPSJ Digital Courier · doi:10.2197/ipsjdc.1.426 · Cited by 18
Quantum Attacks and Defenses for Proof-of-Stake
Khalifa, A. M., Bahaa-Eldin, A. M., & Sobh, M. (2019) · International Conference on Computer Engineering & Systems (ICCES) · doi:10.1109/icces48960.2019.9068181 · Cited by 21
Virtualized Logical Qubits: A 2.5D Architecture for Error-Corrected Quantum Computing
Duckering, C., Baker, J. M., Schuster, D., & Chong, F. T. (2020) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1109/micro50266.2020.00026 · Cited by 18
Quantum Resource Estimates of Grover’s Key Search on ARIA
Chauhan, A. K., & Sanadhya, S. K. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-66626-2_13 · Cited by 18
Pauli Matrix based Quantum Communication Protocol
Nema, P., & Nene, M. J. (2020) · doi:10.1109/icatmri51801.2020.9398393 · Cited by 18
Jaeger, J., Song, F., & Tessaro, S. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-90459-3_8 · Cited by 18
Minimizing Delay in Network Function Visualization with Quantum Computing
Xuan, W., Zhao, Z., Fan, L., & Han, Z. (2021) · IEEE International Conference on Mobile Ad-Hoc and Sensor Systems (MASS) · doi:10.1109/mass52906.2021.00022 · Cited by 17
Post-quantum Cryptography in 6G
Partala, J. (2021) · Computer communications and networks · doi:10.1007/978-3-030-72777-2_20 · Cited by 22
Metaheuristics on quantum computers: Inspiration, simulation and real execution
Dahi, Z. A., & Alba, E. (2021) · Future Generation Computer Systems · doi:10.1016/j.future.2021.12.015 · Cited by 18
Quantum Image Encryption Based on Baker Map and 2D Logistic Map
Wu, W., & Wang, Q. (2022) · International Journal of Theoretical Physics · doi:10.1007/s10773-022-04979-1 · Cited by 19
Hybrid quantum-classical heuristic for the bin packing problem
de Andoin, M. G., Osaba, E., Oregi, I., Villar-Rodríguez, E., & Sanz, M. (2022) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3520304.3533986 · Cited by 23
Algorithmic QUBO formulations for k -SAT and hamiltonian cycles
Nüßlein, J., Gabor, T., Linnhoff–Popien, C., & Feld, S. (2022) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3520304.3533952 · Cited by 18
The Impact of Quantum Computing on Security in Emerging Technologies
Abuarqoub, A., Abuarqoub, S., Alzu’bi, A., & Muthanna, A. (2021) · International Conference on Future Networks and Distributed Systems (ICFNDS) · doi:10.1145/3508072.3508099 · Cited by 21
Quantum Fuzzy K-Means Algorithm Based on Fuzzy Theory
Hou, M., Zhang, S., & Xia, J. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-06794-5_28 · Cited by 18
Simon’s Algorithm and Symmetric Crypto: Generalizations and Automatized Applications
Canale, F., Leander, G., & Stennes, L. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-15982-4_26 · Cited by 18
Efficient GPU Implementations of Post-Quantum Signature XMSS
Wang, Z., Dong, X., Chen, H., et al. (2023) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2022.3233348 · Cited by 18
SodsBC: A Post-Quantum by Design Asynchronous Blockchain Framework
Dolev, S., Guo, B., Niu, J., & Wang, Z. (2023) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2023.3243588 · Cited by 19
Universal compilation for quantum state tomography
Hai, V. T., & Ho, L. B. (2023) · Scientific Reports · doi:10.1038/s41598-023-30983-4 · Cited by 16
Quantum Vs Classical Computing: a Comparative Analysis
Belkhir, M., Benkaouha, H., & Benkhelifa, E. (2022) · International Conference on Fog and Mobile Edge Computing (FMEC) · doi:10.1109/fmec57183.2022.10062753 · Cited by 22
Arias, D., de Guzmán, I. G., Rodríguez, M., Terres-Escudero, E. B., Sanz, B., de la Puerta, J. G., Pastor-López, I., Zubillaga, A., & Bringas, P. G. (2023) · Neurocomputing · doi:10.1016/j.neucom.2023.03.060 · Cited by 18
Classical simulation of variational quantum classifiers using tensor rings
Peddireddy, D., Bansal, V., & Aggarwal, V. (2023) · Applied Soft Computing · doi:10.1016/j.asoc.2023.110308 · Cited by 20
Quantum Attacks on Type‐1 Generalized Feistel Schemes
Sun, H., Cai, B., Qin, S., Wen, Q., & Gao, F. (2023) · Advanced Quantum Technologies · doi:10.1002/qute.202300155 · Cited by 18
A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity
L'Abbate, R., D’Onofrio, A., Stein, S., Chen, S. Y.-C., Li, A., Chen, P., Chen, J., & Mao, Y. (2024) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2024.3367234 · Cited by 18
Transfer of Logistics Optimizations to Material Flow Resource Optimizations using Quantum Computing
Pfister, R., Schubert, G., & Kröll, M. (2024) · Procedia Computer Science · doi:10.1016/j.procs.2024.01.004 · Cited by 20
The Impact of Quantum Computing on Cybersecurity
Emmanni, P. S. (2023) · Journal of Mathematical & Computer Applications · doi:10.47363/jmca/2023(2)140 · Cited by 28
Codesign of quantum error-correcting codes and modular chiplets in the presence of defects
Lin, S. F., Viszlai, J., Smith, K. N., Ravi, G. S., Yuan, C., Chong, F. T., & Brown, B. J. (2024) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3620665.3640362 · Cited by 24
Kocherla, S., Song, Z., Chrit, F. E., Gard, B., Dumitrescu, E., Alexeev, A., & Bryngelson, S. H. (2024) · AVS Quantum Science · doi:10.1116/5.0217675 · Cited by 26
Efficient quantum algorithms for (Gapped) group testing and junta testing
Ambainis, A., Belovs, A., Regev, O., & de Wolf, R. (2016) · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · Cited by 20
Communication lower bounds using directional derivatives
Sherstov, A. A. (2013) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2488608.2488725 · Cited by 18
Optical control of single excitons in semiconductor quantum dots
Kodriano, Y., Schmidgall, E., Benny, Y., & Gershoni, D. (2014) · Semiconductor Science and Technology · doi:10.1088/0268-1242/29/5/053001 · Cited by 18
On the Effect of Quantum Interaction Distance on Quantum Addition Circuits
Choi, B.-S., & Meter, R. V. (2011) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/2000502.2000504 · Cited by 18
Using Simon's algorithm to attack symmetric-key cryptographic primitives
Santoli, T., & Schaffner, C. (2017) · Quantum Information and Computation · doi:10.26421/qic17.1-2-4 · Cited by 32
Exact simulation of coined quantum walks with the continuous-time model
Philipp, P., & Portugal, R. (2016) · Quantum Information Processing · doi:10.1007/s11128-016-1475-9 · Cited by 18
A novel graph clustering algorithm based on discrete-time quantum random walk
Roy, S., & Chakrabarti, A. (2016) · Elsevier eBooks · doi:10.1016/b978-0-12-804409-4.00011-5 · Cited by 18
Alanis, D., Botsinis, P., Babar, Z., Nguyen, H. V., Chandra, D., Ng, S. X., & Hanzo, L. (2018) · IEEE Transactions on Communications · doi:10.1109/tcomm.2018.2803068 · Cited by 18
Attacks on the AJPS Mersenne-Based Cryptosystem
de Boer, K., Ducas, L., Jeffery, S., & de Wolf, R. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-79063-3_5 · Cited by 18
A study on the use of quantum computers, risk assessment and security problems
Arslan, B., Ülker, M., Akleylek, S., & Sağıroğlu, Ş. (2018) · International Symposium on Digital Forensics and Security (ISDFS) · doi:10.1109/isdfs.2018.8355318 · Cited by 18
On the impact of decryption failures on the security of LWE/LWR based schemes
D’Anvers, J.-P., Vercauteren, F., & Verbauwhede, I. M. R. (2019) · Lirias · doi:10.5281/zenodo.2641891 · Cited by 18
Quantum‐resistant authentication algorithms for satellite‐based augmentation systems
Neish, A. M., Walter, T., & Enge, P. (2019) · NAVIGATION Journal of the Institute of Navigation · doi:10.1002/navi.287 · Cited by 18
A Silicon Surface Code Architecture Resilient Against Leakage Errors
Cai, Z., Fogarty, M. A., Schaal, S., Patomäki, S., Benjamin, S. C., & Morton, J. J. L. (2019) · Quantum · doi:10.22331/q-2019-12-09-212 · Cited by 20
Quantum algorithm for the computation of the reactant conversion rate in homogeneous turbulence
Xu, G., Daley, A. J., Givi, P., & Somma, R. D. (2019) · Combustion Theory and Modelling · doi:10.1080/13647830.2019.1626025 · Cited by 20
The merits of using Ethereum MainNet as a Coordination Blockchain for Ethereum Private Sidechains
Robinson, P. (2020) · The Knowledge Engineering Review · doi:10.1017/s0269888920000296 · Cited by 18
Exponential-Time Quantum Algorithms for Graph Coloring Problems
Shimizu, K., & Mori, R. (2022) · Algorithmica · doi:10.1007/s00453-022-00976-2 · Cited by 18
Quantum image scaling based on bilinear interpolation with arbitrary scaling ratio
Zhou, R., Cheng, Y., & Liu, D. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2377-4 · Cited by 18
A Short Path Quantum Algorithm for Exact Optimization
Hastings, M. B. (2018) · Quantum · doi:10.22331/q-2018-07-26-78 · Cited by 17
Khadiev, K. R., & Ilikaev, A. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-34500-6_17 · Cited by 18
Adapting Logic to Physics: The Quantum-Like Eigenlogic Program
Toffano, Z., & Dubois, F. (2020) · Entropy · doi:10.3390/e22020139 · Cited by 18
Bykovsky, A. Y. (2020) · Quantum Reports · doi:10.3390/quantum2010010 · Cited by 18
Chalumuri, A., Kune, R., & Manoj, B. S. (2020) · Procedia Computer Science · doi:10.1016/j.procs.2020.04.061 · Cited by 18
Quantum Associative Memory in HEP Track Pattern Recognition
Shapoval, I., & Calafiura, P. (2019) · Springer Link (Chiba Institute of Technology) · doi:10.1051/epjconf/201921401012/pdf · Cited by 18
Considering decoherence errors in the simulation of quantum circuits using decision diagrams
Grurl, T., Fuß, J., & Wille, R. (2020) · doi:10.1145/3400302.3415622 · Cited by 18
Iterative Power Algorithm for Global Optimization with Quantics Tensor Trains
Soley, M. B., Bergold, P., & Batista, V. S. (2021) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.1c00292 · Cited by 18
QKD Based on Symmetric Entangled Bernstein-Vazirani
Ampatzis, M., & Andronikos, T. (2021) · Entropy · doi:10.3390/e23070870 · Cited by 19
On Tight Quantum Security of HMAC and NMAC in the Quantum Random Oracle Model
Hosoyamada, A., & Iwata, T. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-84242-0_21 · Cited by 17
Towards Quantum Computing for Location Tracking and Spatial Systems
Shokry, A., & Youssef, M. A. (2021) · ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (SIGSPATIAL GIS) · doi:10.1145/3474717.3483958 · Cited by 19
Experimental study on the quantum search algorithm over structured datasets using IBMQ experience
Das, K., & Sadhu, A. (2022) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2022.01.012 · Cited by 18
QuFI: a Quantum Fault Injector to Measure the Reliability of Qubits and Quantum Circuits
Oliveira, D. V., Giusto, E., Dri, E., Casciola, N., Baheri, B., Guan, Q., Montrucchio, B., & Rech, P. (2022) · International Conference on Dependable Systems & Networks/Proceedings · doi:10.1109/dsn53405.2022.00025 · Cited by 18
A Quantum Algorithm for RF-based Fingerprinting Localization Systems
Shokry, A., & Youssef, M. A. (2022) · Conference on Local Computer Networks · doi:10.1109/lcn53696.2022.9843246 · Cited by 18
Schemes for performance of displacing Hadamard gate with coherent states
Podoshvedov, S. A. (2012) · Optics Communications · doi:10.1016/j.optcom.2012.04.029 · Cited by 18
Quantum annealing – foundations and frontiers
Cohen, E., & Tamir, B. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02345-1 · Cited by 18
Quantum Partial Search of a Database with Several Target Items
Choi, B.-S., & Korepin, V. E. (2007) · Quantum Information Processing · doi:10.1007/s11128-007-0056-3 · Cited by 18
Criteria for the entanglement of composite systems with identical particles
Ghirardi, G. C., & Marinatto, L. (2004) · Fortschritte der Physik · doi:10.1002/prop.200410173 · Cited by 18
Hamed, H. N. A., Kasabov, N. K., & Mariyam, S. (2011) · InTech eBooks · doi:10.5772/10545 · Cited by 18
Exact quantum algorithms have advantage for almost all Boolean functions
Ambainis, A., Gruska, J., & Zheng, S. (2015) · Quantum Information and Computation · doi:10.26421/qic15.5-6-5 · Cited by 20
Nearest-Neighbor and Fault-Tolerant Quantum Circuit Implementation
Biswal, L., Bandyopadhyay, C., Chattopadhyay, A., Wille, R., Drechsler, R., & Rahaman, H. (2016) · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · doi:10.1109/ismvl.2016.48 · Cited by 18
Quantum Speedup Based on Classical Decision Trees
Beigi, S., & Taghavi, L. (2020) · Quantum · doi:10.22331/q-2020-03-02-241 · Cited by 18
Quantum Algorithms for the Approximate k-List Problem and Their Application to Lattice Sieving
Kirshanova, E., Mårtensson, E., Postlethwaite, E. W., et al. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-34578-5_19 · Cited by 18
Esser, A., Heuer, F., Kübler, R., et al. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-96881-0_22 · Cited by 18
The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems
Arvind, V., & Schuler, R. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-24587-2_19 · Cited by 18
The Quantum Query Complexity of Algebraic Properties
Dörn, S., & Thierauf, T. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-74240-1_22 · Cited by 19
Parallel Quantum Computer Simulation on the CUDA Architecture
Gutiérrez, E., Romero, S., Trenas, M. A., et al. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-69384-0_75 · Cited by 18
Graph properties and circular functions: how low can quantum query complexity go?
Sun, X., Yao, A. C.-C., & Zhang, S. (2004) · Conference on Computational Complexity · doi:10.1109/ccc.2004.14 · Cited by 18
A Quantum Inspired Evolutionary Framework for Multi-objective Optimization
Meshoul, S., Mahdi, K., & Batouche, M. (2005) · Lecture notes in computer science · doi:10.1007/11595014_19 · Cited by 18
Cryptography, quantum computation and trapped ions
Hughes, R. (1998) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.1998.0253 · Cited by 18
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
