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,001–1,100 of 8,792
The security implications of quantum cryptography and quantum computing
Cavaliere, F., Mattsson, J., & Smeets, B. (2020) · Network Security · doi:10.1016/s1353-4858(20)30105-7 · Cited by 45
Unsupervised event classification with graphs on classical and photonic quantum computers
Blance, A., & Spannowsky, M. (2021) · Journal of High Energy Physics · doi:10.1007/jhep08(2021)170 · Cited by 56
A quantum circuit design of AES requiring fewer quantum qubits and gate operations
Wang, Z.-G., Wei, S.-J., & Long, G. (2022) · Frontiers of Physics · doi:10.1007/s11467-021-1141-2 · Cited by 40
Practical Quantum Anonymous Private Information Retrieval Based on Quantum Key Distribution
Yang, Y., Liu, B., Xu, G., et al. (2023) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2023.3288989 · Cited by 40
Robust and Efficient Hamiltonian Learning
Yu, W., Sun, J., Han, Z., & Yuan, X. (2023) · Quantum · doi:10.22331/q-2023-06-29-1045 · Cited by 44
Hybrid quantum architecture for smart city security
Barletta, V. S., Caivano, D., Vincentiis, M. D., Pal, A., & Scalera, M. (2024) · Journal of Systems and Software · doi:10.1016/j.jss.2024.112161 · Cited by 49
Liu, C.-Y., Kuo, E.-J., Abraham Lin, C.-H., Gemsun Young, J., Chang, Y.-J., Hsieh, M.-H., & Goan, H.-S. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-025-00305-0 · Cited by 40
Quantum search algorithms on a regular lattice
Hein, B., & Tanner, G. (2010) · Physical Review A · doi:10.1103/physreva.82.012326 · Cited by 37
Compiler Management of Communication and Parallelism for Quantum Computation
Heckey, J., Patil, S. R., Javadi-Abhari, A., Holmes, A. A., Kudrow, D., Brown, K. R., Franklin, D. M., Chong, F. T., & Martonosi, M. (2015) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/2694344.2694357 · Cited by 43
A two-tier scheme for greyscale quantum image watermarking and recovery
Iliyasu, A. M., Le, P. Q., Yan, F., Sun, B., Garcia, J. A. S., Dong, F., & Hirota, K. (2013) · International Journal of Innovative Computing and Applications · doi:10.1504/ijica.2013.053179 · Cited by 40
Advances in the Quantum Theoretical Approach to Image Processing Applications
Aburaed, N., Khan, F. S., & Bhaskar, H. (2017) · ACM Computing Surveys · doi:10.1145/3009965 · Cited by 39
An Optimized Quantum Representation for Color Digital Images
Liu, K., Zhang, Y., Lü, K., et al. (2018) · International Journal of Theoretical Physics · doi:10.1007/s10773-018-3813-4 · Cited by 40
Logic Synthesis for Established and Emerging Computing
Testa, E., Soeken, M., Amar, L. G., & Micheli, G. D. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2869760 · Cited by 40
Ding, Y., Wu, X.-C., Holmes, A., Wiseth, A., Franklin, D., Martonosi, M., & Chong, F. T. (2020) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca45697.2020.00054 · Cited by 54
Tight Quantum Time-Space Tradeoffs for Function Inversion
Chung, K.-M., Guo, S., Liu, Q., & Qian, L. (2020) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs46700.2020.00068 · Cited by 40
Lim, L. (2021) · Acta Numerica · doi:10.1017/s0962492921000076 · Cited by 46
Quantum Algorithms and Simulation for Parallel and Distributed Quantum Computing
Parekh, R., Ricciardi, A., Darwish, A., & DiAdamo, S. (2021) · IEEE/ACM International Workshop on Quantum Computing Software (QCS) · doi:10.1109/qcs54837.2021.00005 · Cited by 48
The impact of hardware specifications on reaching quantum advantage in the fault tolerant regime
Webber, M., Elfving, V. E., Weidt, S., & Hensinger, W. K. (2022) · AVS Quantum Science · doi:10.1116/5.0073075 · Cited by 63
Bais, F. A., & Farmer, J. D. (2008) · Elsevier eBooks · doi:10.1016/b978-0-444-51726-5.50020-0 · Cited by 54
Quantum Search with Variable Times
Ambainis, A. (2009) · Theory of Computing Systems · doi:10.1007/s00224-009-9219-1 · Cited by 40
Implementing Minimized Multivariate PKC on Low-Resource Embedded Systems
Yang, B., Cheng, C.-M., Chen, B.-R., et al. (2006) · Lecture notes in computer science · doi:10.1007/11734666_7 · Cited by 40
Neurofuzzy Networks With Nonlinear Quantum Learning
Panella, M., & Martinelli, G. (2009) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2008.928603 · Cited by 40
Chiribella, G., D’Ariano, G. M., & Perinotti, P. (2015) · Fundamental theories of physics · doi:10.1007/978-94-017-7303-4_6 · Cited by 45
On a problem in quantum summation
Heinrich, S., & Novak, E. (2003) · Journal of Complexity · doi:10.1016/s0885-064x(02)00003-1 · Cited by 38
Scalable NMR Quantum ComputationPreprint
Schulman, L. J., & Vazirani, U. V. (1998) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9804060 · Cited by 46
QIRHSI: novel quantum image representation based on HSI color space model
Chen, G., Song, X., Venegas-Andraca, S. E., & El‐Latif, A. A. A. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03337-0 · Cited by 39
Quantum Algorithms for Anomaly Detection Using Amplitude Estimation
Guo, M., Liu, H., Li, Y., Li, W., Gao, F., Qin, S., & Wen, Q. (2022) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2022.127936 · Cited by 46
Balducci, G. T., Chen, B., Möller, M., Gerritsma, M. I., & Breuker, R. D. (2022) · Frontiers in Mechanical Engineering · doi:10.3389/fmech.2022.914241 · Cited by 41
CAFQA: A Classical Simulation Bootstrap for Variational Quantum Algorithms
Ravi, G. S., Gokhale, P., Ding, Y., Kirby, W., Smith, K. N., Baker, J. M., Love, P. J., Hoffmann, H., Brown, K. R., & Chong, F. T. (2022) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3567955.3567958 · Cited by 77
symQV: Automated Symbolic Verification of Quantum Programs
Bauer-Marquart, F., Leue, S., & Schilling, C. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-27481-7_12 · Cited by 38
Quantum Computers and Algorithms: A Threat to Classical Cryptographic Systems
Tom, J. J., Anebo, N. P., Onyekwelu, B. A., Adigwe, W., Eyo, R. E., & IT/Support Specialist, R. (2023) · International Journal of Engineering and Advanced Technology · doi:10.35940/ijeat.e4153.0612523 · Cited by 39
Kong, I., Janssen, M., & Bharosa, N. (2023) · Government Information Quarterly · doi:10.1016/j.giq.2023.101884 · Cited by 46
Quantum computing for chemistry and physics applications from a Monte Carlo perspective
Mazzola, G. (2024) · The Journal of Chemical Physics · doi:10.1063/5.0173591 · Cited by 48
New Quantum Algorithms for Computing Quantum Entropies and Distances
Wang, Q., Guan, J., Liu, J., Zhang, Z., & Ying, M. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3399014 · Cited by 75
The effect of classical optimizers and Ansatz depth on QAOA performance in noisy devices
Pellow-Jarman, A., McFarthing, S., Sinayskiy, I., Park, D. K., Pillay, A. W., & Petruccione, F. (2024) · Scientific Reports · doi:10.1038/s41598-024-66625-6 · Cited by 41
Quantum‐Noise‐Driven Generative Diffusion Models
Parigi, M., Martina, S., & Caruso, F. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202300401 · Cited by 51
A novel quantum group signature scheme without using entangled states
Xu, G., & Zhang, K. (2015) · Quantum Information Processing · doi:10.1007/s11128-015-0995-z · Cited by 39
Spatial search by continuous-time quantum walk with multiple marked vertices
Wong, T. G. (2016) · Quantum Information Processing · doi:10.1007/s11128-015-1239-y · Cited by 39
Building Quantum-One-Way Functions from Block Ciphers: Davies-Meyer and Merkle-Damgård Constructions
Hosoyamada, A., & Yasuda, K. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-03326-2_10 · Cited by 43
Quantum multi-level wavelet transforms
Li, H.-S., Fan, P., Xia, H., & Song, S. (2019) · Information Sciences · doi:10.1016/j.ins.2019.07.057 · Cited by 39
Improved Mapping of Quantum Circuits to IBM QX Architectures
Kole, A., Hillmich, S., Datta, K., Wille, R., & Sengupta, I. (2019) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2019.2962753 · Cited by 39
Constant-depth circuits for dynamic simulations of materials on quantum computers
Oftelie, L. B., Beeumen, R. V., Younis, E., Smith, E., Iancu, C., & de Jong, W. A. (2022) · Materials Theory · doi:10.1186/s41313-022-00043-x · Cited by 39
Lattice Sieving via Quantum Random Walks
Chailloux, A., & Loyer, J. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92068-5_3 · Cited by 39
Shorter Signatures Based on Tailor-Made Minimalist Symmetric-Key Crypto
Dobraunig, C., Kales, D., Rechberger, C., Schofnegger, M., & Zaverucha, G. (2022) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3548606.3559353 · Cited by 40
Progress toward favorable landscapes in quantum combinatorial optimization
Lee, J., Magann, A. B., RABITZ, H. A., & Arenz, C. (2021) · Physical Review A · doi:10.1103/physreva.104.032401 · Cited by 48
Quantum Query Complexity for Some Graph Problems
Bērziņa, A., Dubrovsky, A., Freivalds, R., Lāce, L., & Scegulnaja-Dubrovska, O. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24618-3_11 · Cited by 41
Shi, Y. (2000) · Information Processing Letters · doi:10.1016/s0020-0190(00)00069-7 · Cited by 42
The triplet genetic code had a doublet predecessor
Patel, A. (2004) · Journal of Theoretical Biology · doi:10.1016/j.jtbi.2004.10.029 · Cited by 39
Quantum Algorithms for Matching and Network Flows
Ambainis, A., & Špalek, R. (2006) · Lecture notes in computer science · doi:10.1007/11672142_13 · Cited by 38
The no free lunch theorems: complexity and security
Ho, Y., Zhao, Q., & Pepyne, D. L. (2003) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2003.811254 · Cited by 39
Polynomial degree vs. quantum query complexity
Ambainis, A. (2004) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2003.1238197 · Cited by 53
Statistical cryptanalysis of block ciphers
Junod, P. (2005) · reroDoc Digital Library · doi:10.5075/epfl-thesis-3179 · Cited by 39
UNIVERSIDAD NACIONAL DE ROSARIO
Exactas, F. D. C., & Agrimensura, I. I. Y. (1997) · Cited by 39
Gomes, J., Khan, S., & Svetinović, D. (2023) · IEEE Access · doi:10.1109/access.2023.3296559 · Cited by 40
Energy Consumption Evaluation of Post-Quantum TLS 1.3 for Resource-Constrained Embedded Devices
Tasopoulos, G., Dimopoulos, C., Fournaris, A. P., et al. (2023) · ACM International Conference on Computing Frontiers (CF) · doi:10.1145/3587135.3592821 · Cited by 38
Secured Quantum Image Communication Using New Two Dimensional Chaotic Map Based Encryption Methods
Patel, S., Thanikaiselvan, V., & Amirtharajan, R. (2024) · International Journal of Theoretical Physics · doi:10.1007/s10773-024-05548-4 · Cited by 38
Quantum Computing and Communication
Black, P. E., Kuhn, D. R., & Williams, C. J. (2002) · Advances in computers · doi:10.1016/s0065-2458(02)80007-9 · Cited by 40
Limitations on continuous variable quantum algorithms with Fourier transforms
Adcock, M., Høyer, P., & Sanders, B. C. (2009) · New Journal of Physics · doi:10.1088/1367-2630/11/10/103035 · Cited by 38
An FPGA-Based Quantum Computing Emulation Framework Based on Serial-Parallel Architecture
Lee, Y. H., Khalil-Hani, M., & Marsono, M. N. (2016) · International Journal of Reconfigurable Computing · doi:10.1155/2016/5718124 · Cited by 38
Arithmetic coding and blinding countermeasures for lattice signatures
Saarinen, M.-J. O. (2017) · Journal of Cryptographic Engineering · doi:10.1007/s13389-017-0149-6 · Cited by 38
Field Lifting for Smaller UOV Public Keys
Beullens, W., & Bart Preneel, A. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-71667-1_12 · Cited by 38
Quantum realization of the nearest neighbor value interpolation method for INEQR
Zhou, R., Hu, W., Luo, G., Liu, X., & Fan, P. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-1921-y · Cited by 38
Liu, W.-J., Gao, P.-P., Yu, W.-B., Qu, Z.-G., & Yang, C.-N. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-2048-x · Cited by 38
Quantum Image Edge Detection Algorithm
Yuan, S., Venegas-Andraca, S. E., Wang, Y., et al. (2019) · International Journal of Theoretical Physics · doi:10.1007/s10773-019-04166-9 · Cited by 38
Quantum computing methods for supervised learning
Kulkarni, V., Kulkarni, M., & Pant, A. (2021) · Quantum Machine Intelligence · doi:10.1007/s42484-021-00050-0 · Cited by 42
A Grover-search based quantum learning scheme for classification
Du, Y., Hsieh, M.-H., Liu, T., & Tao, D. (2021) · New Journal of Physics · doi:10.1088/1367-2630/abdefa · Cited by 46
Bibliometric Analysis in the Field of Quantum Technology
Scheidsteger, T., Haunschild, R., Bornmann, L., & Ettl, C. (2021) · Quantum Reports · doi:10.3390/quantum3030036 · Cited by 40
Quantum support vector machine based on regularized Newton method
Zhang, R., Wang, J., Jiang, N., Li, H., & Wang, Z. (2022) · Neural Networks · doi:10.1016/j.neunet.2022.03.043 · Cited by 40
Applying Grover's Algorithm to Hash Functions: A Software Perspective
Preston, R. H. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2022.3233526 · Cited by 45
Raedt, H. A. D., Hams, A., Michielsen, K. F. L., & Raedt, K. D. (2000) · Computer Physics Communications · doi:10.1016/s0010-4655(00)00132-6 · Cited by 38
Efficient Quantum Algorithms for Estimating Gauss SumsPreprint
van Dam, W., & Seroussi, G. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0207131 · Cited by 38
Entanglement and Quantum Error Correction with Superconducting QubitsPreprint
Reed, M. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1311.6759 · Cited by 70
A distributed simulation framework for quantum networks and channelsPreprint
Bartlett, B. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1808.07047 · Cited by 40
Botsinis, P., Alanis, D., Feng, S., Babar, Z., Nguyen, H. V., Chandra, D., Ng, S. X., Zhang, R., & Hanzo, L. (2017) · IEEE Access · doi:10.1109/access.2017.2733557 · Cited by 37
Teaching quantum computing with an interactive textbook
Wootton, J. R., Harkins, F., Bronn, N. T., Vazquez, A. C., Phan, A., & Asfaw, A. T. (2021) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce52317.2021.00058 · Cited by 36
Mohanty, N., Behera, B. K., & Ferrie, C. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3303989 · Cited by 37
A practitioner’s guide to quantum algorithms for optimisation problems
Symons, B. C. B., Galvin, D., Sahin, E., Alexandrov, V., & Mensa, S. (2023) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ad00f0 · Cited by 43
Towards accurate keyspace analysis of chaos-based image ciphers
Abba, A., Teh, J. S., & Alawida, M. (2024) · Multimedia Tools and Applications · doi:10.1007/s11042-024-18628-8 · Cited by 37
Quantum carbon finance: Carbon emission rights option pricing and investment decision
Zhai, D., Zhang, T., Liang, G., et al. (2024) · Energy Economics · doi:10.1016/j.eneco.2024.107628 · Cited by 37
Hybrid quantum genetic algorithm for structural damage identification
Xu, L., Wang, X., Wang, Z., & Cao, G. (2025) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2025.117866 · Cited by 38
García, C. R., Aguilera, A. C., Stan, C., Olmos, J. J. V., Rommel, S., & Monroy, I. T. (2025) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2025.3568011 · Cited by 46
Characterizations of one-way general quantum finite automata
Li, L., Qiu, D., Zou, X., et al. (2011) · Theoretical Computer Science · doi:10.1016/j.tcs.2011.10.021 · Cited by 37
Multi-layer quantum neural network controller trained by real-coded genetic algorithm
Takahashi, K., Kurokawa, M., & Hashimoto, M. (2014) · Neurocomputing · doi:10.1016/j.neucom.2012.12.073 · Cited by 37
The Quantum Future of Computation
Svore, K. M., & Troyer, M. (2016) · Computer · doi:10.1109/mc.2016.293 · Cited by 37
Quantum solution to a class of two-party private summation problems
Shi, R., & Zhang, S. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1676-x · Cited by 37
An all-pair quantum SVM approach for big data multiclass classification
Bishwas, A. K., Mani, A., & Palade, V. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-2046-z · Cited by 39
Enhanced least significant qubit watermarking scheme for quantum images
Luo, G., Zhou, R., Hu, W., Luo, J., Liu, X., & Ian, H. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-2075-7 · Cited by 37
Improved DD-based Equivalence Checking of Quantum Circuits
Burgholzer, L., & Wille, R. (2020) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1109/asp-dac47756.2020.9045153 · Cited by 37
Quantum algorithms for typical hard problems: a perspective of cryptanalysis
Suo, J., Wang, L., Yang, S., Zheng, W., & Zhang, J. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02673-x · Cited by 40
Thakur, A. S., Biswas, T., & Kuila, P. (2020) · The Journal of Supercomputing · doi:10.1007/s11227-020-03292-0 · Cited by 37
Finding spin glass ground states using quantum walks
Callison, A., Chancellor, N., Mintert, F., & Kendon, V. M. (2019) · Strathprints: The University of Strathclyde institutional repository (University of Strathclyde) · Cited by 37
Quantum Permutation Synchronization
Birdal, T., Golyanik, V., Theobalt, C., & Guibas, L. J. (2021) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr46437.2021.01292 · Cited by 38
Stabilizing multiple topological fermions on a quantum computer
Koh, J. M., Tai, T., Phee, Y. H., Ng, W. E., & Lee, C. H. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00527-1 · Cited by 40
Rohde, P. P. (2021) · Cambridge University Press eBooks · doi:10.1017/9781108868815 · Cited by 38
Hazra, S., Bhattacharjee, A., Chand, M., Salunkhe, K. V., Gopalakrishnan, S., Patankar, M. P., & Vijay, R. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.16.024018 · Cited by 37
DigiQ: A Scalable Digital Controller for Quantum Computers Using SFQ Logic
Jokar, M. R., Rines, R., Pasandi, G., Cong, H., Holmes, A. A., Shi, Y., Pedram, M., & Chong, F. T. (2022) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca53966.2022.00037 · Cited by 40
Practical Post-Quantum Signature Schemes from Isomorphism Problems of Trilinear Forms
Tang, G., Duong, D. H., Joux, A., Plantard, T., Qiao, Y., & Susilo, W. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-07082-2_21 · Cited by 42
On Grover’s search algorithm from a quantum information geometry viewpoint
Cafaro, C., & Mancini, S. (2011) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2011.09.018 · Cited by 37
Ambainis, A., Špalek, R., & de Wolf, R. (2007) · Algorithmica · doi:10.1007/s00453-007-9022-9 · Cited by 44
Counting by quantum eigenvalue estimation
Mosca, M. (2001) · Theoretical Computer Science · doi:10.1016/s0304-3975(00)00217-6 · Cited by 38
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
