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 2,601–2,700 of 8,792
de Sousa, P. B. M., & Ramos, R. V. (2008) · Quantum Information Processing · doi:10.1007/s11128-008-0078-5 · Cited by 12
A quantum physical design flow using ILP and graph drawing
Yazdani, M., Zamani, M. S., & Sedighi, M. (2013) · Quantum Information Processing · doi:10.1007/s11128-013-0597-6 · Cited by 12
A compact and efficient SAT encoding for quantum circuits
Wille, R., Przigoda, N., & Drechsler, R. (2013) · IEEE AFRICON · doi:10.1109/afrcon.2013.6757630 · Cited by 11
A Quantum-inspired Q-learning Algorithm for Indoor Robot Navigation
Chen, C., Yang, P., Zhou, X., & Dong, D. (2008) · IEEE International Conference on Networking, Sensing and Control (ICNSC) · doi:10.1109/icnsc.2008.4525476 · Cited by 12
Reconstructing Strings from Substrings with Quantum Queries
Cleve, R., Iwama, K., Gall, F. L., Nishimura, H., Tani, S., Teruyama, J., & Yamashita, S. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-31155-0_34 · Cited by 13
Synthesis of Vertex Coloring Problem Using Grover's Algorithm
Saha, A., Chongder, A., Mandal, S. B., et al. (2015) · IEEE International Symposium on Nanoelectronic and Information Systems (iNIS) · doi:10.1109/inis.2015.55 · Cited by 12
Shi, R., Mu, Y., Zhong, H., et al. (2016) · Quantum Information Processing · doi:10.1007/s11128-016-1476-8 · Cited by 12
Rong, X., Lu, D., Kong, X., Geng, J., Wang, Y., Shi, F., Duan, C., & Du, J. (2016) · Advances in Physics X · doi:10.1080/23746149.2016.1266914 · Cited by 11
Blind Quantum Signature with Blind Quantum Computation
Li, W., Shi, R., & Guo, Y. (2016) · International Journal of Theoretical Physics · doi:10.1007/s10773-016-3252-z · Cited by 12
Layout Synthesis for Topological Quantum Circuits With 1-D and 2-D Architectures
Lin, Y., Yu, B., Li, M., & Pan, D. Z. (2018) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2017.2760511 · Cited by 10
Nash Embedding and Equilibrium in Pure Quantum States
Khan, F. S., & Humble, T. S. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-14082-3_5 · Cited by 12
The Hidden Subgroup Problem and Post-quantum Group-Based Cryptography
Horan, K., & Kahrobaei, D. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-96418-8_26 · Cited by 12
Paradigm shift from classical cryptography to quantum cryptography
Gajbhiye, S., Karmakar, S., Sharma, M., & Sharma, S. K. (2017) · International Conference on Intelligent Sustainable Systems (ICISS) · doi:10.1109/iss1.2017.8389231 · Cited by 12
Improving the Sequence Alignment Method by Quantum Multi-Pattern Recognition
Prousalis, K. P., & Konofaos, N. (2018) · Hellenic Conference on Artificial Intelligence · doi:10.1145/3200947.3201041 · Cited by 12
Quantum Implementation of Fuzzy Systems through Grover’s Algorithm
Acampora, G., Luongo, F., & Vitiello, A. (2018) · IEEE International Conference on Fuzzy Systems (FUZZ-IEEE) · doi:10.1109/fuzz-ieee.2018.8491579 · Cited by 12
Wang, C., & JONCKHEERE, E. A. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-2117-1 · Cited by 14
Improved Quantum Multicollision-Finding Algorithm
Hosoyamada, A., Sasaki, Y., Tani, S., & Xagawa, K. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-25510-7_19 · Cited by 13
Recommendation systems with the quantum k–NN and Grover algorithms for data processing
Sawerwain, M., & Wróblewski, M. (2019) · International Journal of Applied Mathematics and Computer Science · doi:10.2478/amcs-2019-0011 · Cited by 12
A Quantum Computation Model for Molecular Nanomagnets
Cirillo, G. A., Turvani, G., & Graziano, M. (2019) · IEEE Transactions on Nanotechnology · doi:10.1109/tnano.2019.2939910 · Cited by 13
Optimization of a Quantum-Secure Sponge-Based Hash Message Authentication Protocol
Latif, M. K., Jacinto, H. S., Daoud, L. B., & Rafla, N. (2018) · IEEE International Midwest Symposium on Circuits and Systems (MWSCAS) · doi:10.1109/mwscas.2018.8623880 · Cited by 13
Efficient Quantum-Immune Keyless Signatures with Identity.
Buldas, A., Laanoja, R., & Truu, A. (2014) · Cited by 12
Efficient Teleportation for High-Dimensional Quantum Computing
Xu, W.-L., Wang, T.-J., & Wang, C. X. (2019) · IEEE Access · doi:10.1109/access.2019.2934408 · Cited by 12
Grote, O., Ahrens, A., & Benavente-Peces, C. (2019) · International Conference on Pervasive and Embedded Computing and Communication Systems · doi:10.5220/0008162800910098 · Cited by 12
Quantum semi-supervised kernel learning
Saeedi, S., Panahi, A., & Arodz, T. J. (2021) · Quantum Machine Intelligence · doi:10.1007/s42484-021-00053-x · Cited by 12
Use Cases of Quantum Optimization for Finance
Mugel, S., Lizaso, E., & Orús, R. (2022) · Studies in systems, decision and control · doi:10.1007/978-3-030-97273-8_15 · Cited by 15
Krishnaswamy, D. (2020) · ACM International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing (MobiHoc) · doi:10.1145/3397166.3412802 · Cited by 12
Qubits’ mapping and routing for NISQ on variability of quantum gates
Li, Z., Meng, F., Zhang, Z., & Yu, X. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02873-5 · Cited by 12
An Improved Arbitrated Quantum Scheme with Bell States
Zhang, Y., & Zeng, J. (2017) · International Journal of Theoretical Physics · doi:10.1007/s10773-017-3632-z · Cited by 12
The Purview of Blockchain Appositeness in Computing Paradigms: A Survey
Babu, B. V. S., & Babu, K. S. (2021) · Ingénierie des systèmes d information · doi:10.18280/isi.260104 · Cited by 12
An FPGA-based hardware abstraction of quantum computing systems
Khalid, M., Mujahid, U., Jafri, A. R., Choi, H., & Najam-ul-Islam, M. (2021) · Journal of Computational Electronics · doi:10.1007/s10825-021-01765-w · Cited by 12
Finding Solutions to the Integer Case Constraint Satisfiability Problem Using Grover’s Algorithm
Vinod, G. M., & Shaji, A. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3120449 · Cited by 12
Implementation of three efficient 4-digit fault-tolerant quantum carry lookahead adders
Orts, F. J., Ortega, G., Filatovas, E., & Garzón, E. M. (2022) · The Journal of Supercomputing · doi:10.1007/s11227-022-04401-x · Cited by 12
Parallel quantum addition for Korean block ciphers
Jang, K., Song, G., Kim, H., Kwon, H., Kim, H., & Seo, H. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03714-3 · Cited by 12
A hybrid algorithm for finding shortest path in network routing.
Aghaei, M. R. S., Zukarnain, Z. A., Mamat, A., Zainuddin, H., & Prof, A. (2009) · Cited by 12
Quantum Algorithms for Highly Structured Search Problems
Hunziker, M., & Meyer, D. (2002) · Quantum Information Processing · doi:10.1023/a:1019868924061 · Cited by 12
A Quantum Bi-Directional Self-Organizing Neural Network (QBDSONN) for binary image denoising
Konar, D., Bhattacharyya, S., Das, N., et al. (2015) · International Conference on Advances in Computing, Communications and Informatics (ICACCI) · doi:10.1109/icacci.2015.7275780 · Cited by 12
Quantum Predicative Programming
Tafliovich, A., & Hehner, E. C. R. (2006) · Lecture notes in computer science · doi:10.1007/11783596_25 · Cited by 12
Towards Understanding the Origin of Genetic Languages
Patel, A. D. (2008) · IMPERIAL COLLEGE PRESS eBooks · doi:10.1142/9781848162556_0010 · Cited by 12
On the utility of entanglement in quantum neural computing
Ventura, D. A. (2002) · 2022 International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2001.939598 · Cited by 12
Quantum novel genetic algorithm based on parallel subpopulation computing and its application
Zhou, R., & Cao, J. (2012) · Artificial Intelligence Review · doi:10.1007/s10462-012-9312-8 · Cited by 12
Quantum Computing for Computer Architects, Second Edition
Metodi, T. S., Faruque, A. I., & Chong, F. T. (2011) · Synthesis lectures on computer architecture · doi:10.1007/978-3-031-01731-5 · Cited by 15
Speed and entropy of an interacting continuous time quantum walk
de Falco, D., & Tamascelli, D. (2006) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/39/20/016 · Cited by 12
Artificial Associative Memory Using Quantum Processes
Ventura, D. A. (1998) · Cited by 11
Improving Latency of Quantum Circuits by Gate Exchanging
Mohammadzadeh, N., Zamani, M. S., & Sedighi, M. (2009) · Euromicro Conference on Digital System Design (DSD) · doi:10.1109/dsd.2009.191 · Cited by 12
Two Quantum Protocols for Oblivious Set-member Decision Problem
Shi, R., Mu, Y., Zhong, H., et al. (2015) · Scientific Reports · doi:10.1038/srep15914 · Cited by 12
Engineering the success of quantum walk search using weighted graphs
Wong, T. G., & Philipp, P. (2016) · Physical Review A · doi:10.1103/physreva.94.022304 · Cited by 13
Kölbl, S. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-79063-3_10 · Cited by 12
Neural Networks and Graph Algorithms with Next-Generation Processors
Hamilton, K. E., Schuman, C. D., Young, S. R., Imam, N., & Humble, T. S. (2018) · IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum · doi:10.1109/ipdpsw.2018.00184 · Cited by 12
Tree Search and Quantum Computation
Wichert, A. (2016) · Cited by 12
On the power of quantum proofs
Raz, R., & Shpilka, A. (2004) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.2004.1313849 · Cited by 18
Modified Karnaugh map for quantum Boolean circuits construction
Wang, S.-A., Lu, C.-Y., Tsai, I.-M., et al. (2004) · IEEE Conference on Nanotechnology (IEEE NANO) · doi:10.1109/nano.2003.1230996 · Cited by 12
Rapid sampling though quantum computing
Grover, L. K. (2000) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/335305.335389 · Cited by 12
Self-citationOn quantum versions of record-breaking algorithms for SAT
Dantsin, E. Y., Крейнович, В., & Wolpert, A. (2005) · ACM SIGACT News · doi:10.1145/1107523.1107524 · Cited by 12
Buhrman, H., Fortnow, L., Newman, I., & Röhrig, H. (2003) · UvA-DARE (University of Amsterdam) · doi:10.5555/644108.644188 · Cited by 15
Quantum Boolean Circuits are 1-Testable
Chou, Y., Tsai, I.-M., & Kuo, S. (2008) · IEEE Transactions on Nanotechnology · doi:10.1109/tnano.2008.926369 · Cited by 12
Fast quantum algorithms for handling probabilistic, interval, and fuzzy uncertainty
Martinez, M., Longpré, L., Крейнович, В., et al. (2004) · International Conference of the North American Fuzzy Information Processing Society (NAFIPS) · doi:10.1109/nafips.2003.1226817 · Cited by 12
A proof that measured data and equations of quantum mechanics can be linked only by guesswork
Myers, J. M., & Madjid, F. H. (2002) · Contemporary mathematics - American Mathematical Society · doi:10.1090/conm/305/05222 · Cited by 12
Lower Bounds for Quantum Search and DerandomizationPreprint
Buhrman, H., & de Wolf, R. (1998) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9811046 · Cited by 17
Quantum Mechanical Square Root Speedup in a Structured Search ProblemPreprint
Farhi, E., & Gutmann, S. (1997) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9711035 · Cited by 15
Practical Forward Secure Signatures using Minimal Security Assumptions
Hülsing, A. (2013) · Technischen Universität Darmstadt · doi:10.26083/tuprints-00003651 · Cited by 12
A Limit on the Speed of Quantum Computation for Insertion into an Ordered ListPreprint
Farhi, E., Goldstone, J., Gutmann, S., & Sipser, M. (1998) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9812057 · Cited by 21
Sharp Quantum vs. Classical Query Complexity SeparationsPreprint
de Beaudrap, N., Cleve, R., & Watrous, J. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0011065 · Cited by 12
Nondeterministic Quantum Query and Quantum Communication ComplexitiesPreprint
de Wolf, R. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0001014 · Cited by 12
SANQ: A Simulation Framework for Architecting Noisy Intermediate-Scale Quantum Computing SystemPreprint
Li, G., Ding, Y., & Xie, Y. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.11590 · Cited by 14
Applying Grover's algorithm to AES: quantum resource estimatesPreprint
Grassl, M., Langenberg, B., Roetteler, M., & Steinwandt, R. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1512.04965 · Cited by 12
A Review on Quantum Computing: Qubits, Cryogenic Electronics and Cryogenic MOSFET PhysicsPreprint
Jazaeri, F., Beckers, A., Tajalli, A., & Sallèse, J.-M. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1908.02656 · Cited by 14
Solving Multi-Coloring Combinatorial Optimization Problems Using Hybrid Quantum AlgorithmsPreprint
Oh, Y.-H., Mohammadbagherpoor, H., Dreher, P., Singh, A., Yu, X., & Rindos, A. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1911.00595 · Cited by 30
Grover on SPECK: Quantum Resource Estimates.Preprint
Jang, K., Choi, S., Kwon, H., et al. (2020) · IACR Cryptology ePrint Archive · Cited by 12
Fast Classical and Quantum Algorithms for Online $k$-server Problem on TreesPreprint
Kapralov, R., Khadiev, K. R., Mokut, J., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2008.00270 · Cited by 12
Quantum Warfare: Definitions, Overview and ChallengesPreprint
Krelina, M. (2021) · arXiv (Cornell University) · Cited by 12
Quantum Search-Aided Multi-User Detection of IDMA-Assisted Multi-Layered Video Streaming
Botsinis, P., Huo, Y., Alanis, D., Babar, Z., Ng, S. X., & Hanzo, L. (2017) · IEEE Access · doi:10.1109/access.2017.2732358 · Cited by 11
Trustworthy Data Analysis and Sensor Data Protection in Cyber-Physical Systems
Ulybyshev, D., Yilmaz, I., Northern, B., Kholodilo, V., & Rogers, M. (2021) · Proceedings of the 2021 ACM Workshop on Secure and Trustworthy Cyber-Physical Systems · doi:10.1145/3445969.3450432 · Cited by 10
Quantum computing and supervised machine learning
Oneto, L., Ridella, S., & Anguita, D. (2017) · Quantum Inspired Computational Intelligence · doi:10.1016/b978-0-12-804409-4.00002-4 · Cited by 11
Foundations for Workflow Application Scheduling on D-Wave System
Tomasiewicz, D., Pawlik, M., Malawski, M., & Rycerz, K. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-50433-5_40 · Cited by 11
Quantum machine learning early opportunities for the energy industry: a scoping review
Strata, F., Migliori, L., Gebran, N., Guarino, N., Colombo, G. C., Pezzuolo, S., & Luzietti, E. (2025) · Frontiers in Quantum Science and Technology · doi:10.3389/frqst.2025.1653104 · Cited by 13
Wang, Z., Gong, T., Nian, Y., Yi, B., Wang, X., Zhou, X., Lv, J., Min, G., & Li, K. (2026) · IEEE Transactions on Communications · doi:10.1109/tcomm.2026.3658364 · Cited by 12
Practical Post-quantum Password-Authenticated Key Exchange Based-on Module-Lattice
Ren, P., & Gu, X. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-08896-4_7 · Cited by 11
Quantum Computing Meets Artificial Intelligence: Innovations and Challenges
Metawei, M. A., ElDeeb, H. E., Nassar, S. M., & Taher, M. (2022) · Artificial intelligence-enhanced software and systems engineering · doi:10.1007/978-3-031-08202-3_12 · Cited by 11
Quantum encryption in phase space with displacement operators
Kuang, R., & Chan, A. (2023) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-023-00183-0 · Cited by 11
A practical-quantum differential attack on block ciphers
Yadav, T., Kumar, M., Kumar, A., & Pal, S. K. (2023) · Cryptography and Communications · doi:10.1007/s12095-023-00650-6 · Cited by 11
Towards quantum‐secure software defined networks
Nosouhi, M. R., Sood, K., Chamola, V., Jeong, J. J., & Gaddam, A. (2023) · IET Quantum Communication · doi:10.1049/qtc2.12073 · Cited by 12
Quantum walk search by Grover search on coin space
Giri, P. R. (2023) · The European Physical Journal D · doi:10.1140/epjd/s10053-023-00758-7 · Cited by 11
Decision Diagrams for Symbolic Verification of Quantum Circuits
Hong, X., Huang, W., Chien, W., et al. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00111 · Cited by 11
QFactor: A Domain-Specific Optimizer for Quantum Circuit Instantiation
Kukliansky, A., Younis, E., Cincio, Ł., & Iancu, C. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00096 · Cited by 11
Anonymous Classical Message Transmission Through Various Quantum Networks
Shi, R., & Fang, X.-Q. (2024) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2024.3354327 · Cited by 11
Zhang, Y., Li, B., Liu, B., et al. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2024.3358011 · Cited by 11
Quantum Fuzzy Inference Engine for Particle Accelerator Control
Acampora, G., Grossi, M., Schenk, M., & Schiattarella, R. (2024) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2024.3374251 · Cited by 12
Szymanski, T. H. (2024) · Information · doi:10.3390/info15040173 · Cited by 15
Standard (k, n)-threshold hierarchical quantum secret sharing
Li, F., Wu, Q., Lin, C., et al. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04378-x · Cited by 11
Quantum Data Encoding Patterns and their Consequences
Gogeissl, M., Safi, H., & Mauerer, W. (2024) · doi:10.1145/3665225.3665446 · Cited by 11
Circuit Partitioning for Multi-Core Quantum Architectures with Deep Reinforcement Learning
Pastor, A., Escofet, P., Rached, S. B., Alarcón, E., Barlet‐Ros, P., & Abadal, S. (2024) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas58744.2024.10557956 · Cited by 17
Hybrid genetic optimization for quantum feature map design
Pellow-Jarman, R., Pillay, A. W., Sinayskiy, I., & Petruccione, F. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00177-w · Cited by 11
Optimized Quantum Circuit of AES With Interlacing-Uncompute Structure
Zhang, M., Shi, T., Wu, W., & Sui, H. (2024) · IEEE Transactions on Computers · doi:10.1109/tc.2024.3449094 · Cited by 11
PQKELP: Projected Quantum Kernel Embedding based Link Prediction in dynamic networks
Kumar, M., Singh, N., & Biswas, B. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2024.125944 · Cited by 12
Random Beacons in Monte Carlo: Efficient Asynchronous Random Beacon without Threshold Cryptography
Bandarupalli, A., Bhat, A., Bagchi, S., et al. (2024) · doi:10.1145/3658644.3670326 · Cited by 11
Streaming quantum state purification
Childs, A. M., Fu, H., Leung, D., et al. (2025) · Quantum · doi:10.22331/q-2025-01-21-1603 · Cited by 11
Dynamic-threshold-based pre-relaying for enhanced key allocation in quantum-secured networks
Stan, C., Verchère, D., Olmos, J. J. V., et al. (2025) · Journal of Optical Communications and Networking · doi:10.1364/jocn.544857 · Cited by 11
Larasati, H. T., & Choi, B.-S. (2025) · ICT Express · doi:10.1016/j.icte.2025.03.007 · Cited by 17
Dependency-Aware Compilation for Surface Code Quantum Architectures
Molavi, A., Xu, A., Tannu, S., & Albarghouthi, A. (2025) · Proceedings of the ACM on Programming Languages · doi:10.1145/3720416 · Cited by 11
Synthesis of Quantum Circuits for Dedicated Physical Machine Descriptions
Niemann, P., Basu, S., Chakrabarti, A., et al. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-20860-2_16 · Cited by 11
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
