The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index; none of the 8 sources its claims cite is checked for support yet.
A fast quantum mechanical algorithm for database search
Open accessAbstract
An unsorted database contains N records, of which just one satisfies a particular property.The problem is to identify that one record.Any classical algorithm, deterministic or probabilistic, will clearly take O (N) steps since on the average it will have to examine a large fraction of the N records.Quantum mechanical systems can do several operations simultaneously due to their wave like properties.This paper gives an O ( JN) step quantum mechanical algorithm for identifying that record.It is within a constant factor of the fastest possible quantum mechanical algorithm.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
19 No basis given · 8 Sources not found · 4 Own interpretation
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This paper gives an O ( JN) step quantum mechanical algorithm for identifying that record.”
§ A fast quantum mechanical algorithm for database search > Abstract
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- The authors state this as an assumption: There is a unique state that satisfies the condition C(S)=1.
- The authors state this as an assumption: For any state S, the condition C(S) can be evaluated in unit time.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Corollary 3.1-Let the state vector be as followsfor any one state the amplitude is k, for each of the remaining (N-1) states the amplitude is 1.Let k and 1 be real numbers (in general the amplitudes can be complex).Let k be negative and 1 be positive such that ~< ~N.Then after applying the diffusion transform both k and 1are positive numbers.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“First, it is proved that the system is a valid quantum mechanical system (theorems 1 & 2)”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
boosted- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“As mentioned in the introduction, the algorithm of this paper does not use any Imowledge about the problem.”
§ A fast quantum mechanical algorithm for database search > 114
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Theorem 1-The matix D is unitary.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The following sections prove that the system discussed in section 3 is indeed a valid quantum mechanical system and that it converges to the desired state with a probability O(l).”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- The authors state this as an assumption: There is a unique state that satisfies the condition C(S)=1.
- The authors state this as an assumption: For any state S, the condition C(S) can be evaluated in unit time.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Theorem 2 -D can be expressed as D = FRF, where F, the Fourier Transform Matrix and R, the rotation matrix are defined as follows”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Since the proba-& bility of the system being found in any particular state is proportional to the square of the amplitude, it follows that the probability of the system being in tlhe desired state when k is ~, 1 J2 is k2 = ~.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In case there is a unique state SV such that C(SV) = 1, the final state is SV with a probability of at least ~. 2”
§ A fast quantum mechanical algorithm for database search > T. Acknowledgments
plainconditional- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
- The authors state this as an assumption: There is a unique state that satisfies the condition C(S)=1.
- The authors state this as an assumption: For any state S, the condition C(S) can be evaluated in unit time.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“It can be easily modified to take care of the case when there are multiple states satisfying the condition C(S) = 1 and it is required to return one of these.”
§ A fast quantum mechanical algorithm for database search > 114
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Probably not a substantial claim. 8
- It may state two separate claims as one. 4
- The quote only partly states this claim. 1
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Theorem 5-Let the probability of a particular outcome in an experiment be &.Then if the experiment be repeated ~times, the probability that the outcome does not happen even once is less than or equal to e-K.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The change in k ( Ak) after steps (a) and (b) of the algorithm is lower bounded by Ak>~.Also after steps (a) and (b), 1>0.2fi”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Using this it immediately follows that there exists a number M less than EN, such that in M repetitions of the loop in step (ii), k wifl become ~.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The quote only partly states this claim.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The most efficient classical algorithm for this is to examine the items in the database one by one.”
§ A fast quantum mechanical algorithm for database search > ------------------------------------------------
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“Very recent results [Shor95] have shown the existence of quantum mechanical error corr~ting cod~which enable transmission of data even in the presence of noise”
§ A fast quantum mechanical algorithm for database search > 114
What the sources say
- Not matchedcites [Shor95]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
boosteddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This algorithm, by cleverly making use of some features of the structure of the problem, is the only known algorithm that solves the problem in O (logIV) steps.”
§ A fast quantum mechanical algorithm for database search > 114
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The phase does not have an analog in classical probabilistic algorithms.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This illustrates the point that, in quantum mechanics, the complete description of the system requires the amplitudes over all states, just the probabilities is not enough.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
In the paper
“For example Shor's primality testing algorithm [Shor94] for a number N can be viewed as a search of the (N-l) numbers smaller than N to see if any of them is a factor of N.”
§ A fast quantum mechanical algorithm for database search > 114
What the sources say
- Not matchedcites [Shor94]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
In the paper
“There is also a scheme discussed in [VV86] by which it is possible to modify any algorithm that solves an NPsearch problem with a unique solution and use it to solve an NP-search problem in general.”
§ A fast quantum mechanical algorithm for database search > 114
What the sources say
- Not matchedcites [VV86]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
hedgeddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
In the paper
“This operation is one of the things that makes quantum mechanical algorithms more powerful than classical algorithms and forms the basis for most significant quantum mechanical algorithms.”
§ A fast quantum mechanical algorithm for database search > T. Acknowledgments
What the sources say
- Not matchedcites [DJ92]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
- Not matched
The authors state this as an assumption.
There is a unique state that satisfies the condition C(S)=1.
“Let there be a unique state, say Sv, that satisfies the condition C(SV) = 1, whereas for all other states S, C(S) = 0”
“The algorithm as discussed here assumes a unique state that satisfies the desired condition.”
The authors state this as an assumption.
For any state S, the condition C(S) can be evaluated in unit time.
“(assume that for any state S, the condition C(S) can be evaluated in unit time)”
The paper relies on this without support.
There does not exist any sorting on the database that would aid selection of the desired item.
“However, there does not exist any sorting on the database that would aid its selection.”
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Symmetric cryptography remains comparatively resilient, yet Grover's algorithm offers a quadratic speed-up for brute-force key search, effectively halving the security margin of symmetric ciphers [13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Similarly, for hash functions, Grover's algorithm [185] can facilitate quantum birthday attack to find collision, thereby necessitating an output of larger size.”
From Zero Trust Architecture (ZTA): A Comprehensive Survey (2022) · cites this paper as [185]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Similarly, Grover’s algorithm concedes a quadratic advantage for mining blocks in certain consensus protocols such as proof of work.”
From Quantum-resistance in blockchain networks (2023) · cites this paper as [71]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Quantum computers will be able to find these nonces quadratically faster using Grover’s algorithm71.”
From Quantum-resistance in blockchain networks (2023) · cites this paper as [71]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“This model is realistic given the falling cost of storage, the rise of large-scale surveillance infrastructures, and the expected disruption of quantum algorithms such as Shor's and Grover's [1,2,13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measured
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Grover's algorithm provides only a quadratic speedup, effectively halving brute-force resistance. Comparable security margins can be restored by doubling key sizes (for example, AES-128 to AES-256) [13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“This explains why AES-256 maintains post-quantum security margins, whereas AES-128 requires upgrading to maintain equivalent protection levels [13,14].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“At the same time, Grover's algorithm shows that symmetric cryptography, though more resilient, also demands doubled key sizes to maintain equivalent margins [13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“In this sense, Grover-based optimization algorithms [184] such as Grover Adaptive Search [161] have been proposed.”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [184]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The former bound is tight since recent work of Grover [13] shows how to accept the class NP relative to any oracle on a quantum computer in time O (2 n/ 2 ).”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“In view of Grover's algorithm [13], we know that the constant '1 / 2' in the statement of Theorem 3.5 cannot be improved.”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The former bound is tight since recent work of Grover [13] shows how to accept the class NP relative to any oracle on a quantum computer in time O (2 n/ 2 ).”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“Grover’s algorithm [54] is a quantum algorithm for searching in a database, ofering quadratic speedup over classical searching methods.”
From QASMBench: A Low-Level Quantum Benchmark Suite for NISQ Evaluation and Simulation (2023) · cites this paper as [54]
The cited source says what the claim attributes to it.
In the citing paper
“However, quantum machines can recognize this language quadratically faster, in time O ( √ 2 n ), using Grover's algorithm [13].”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
The cited source says what the claim attributes to it.
In the citing paper
“That this was a real possibility is clear from Grover's [13] result, which gives a black-box approach to solving NP -complete problems in square-root as much time as is required classically.”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
The cited source says what the claim attributes to it.
In the citing paper
“Various strategies can be imagined, but a good one (called 'inversion about the average' by Grover [13]) is to perform an oracle-independent unitary transformation so as to change the phase difference into an amplitude difference, leaving the y term with the same sign as all the other terms but a magnitude approximately threefold larger.”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“The HNDL adversary departs from conventional cryptanalysis in its temporal asymmetry. Instead of attempting immediate decryption, the attacker passively collects encrypted traffic or stored archives and defers decryption until sufficient computational resources become available.”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredIn the citing paper
“This algorithm uses a single function evaluation to label the single state which satisfies the function, followed by a series of gates which drive the system into this particular state.”
From Implementation of a quantum search algorithm on a quantum computer (1998) · cites this paper as [9]
In the citing paper
“Here we show how such a computer can be used to implement a fast quantum search algorithm initially developed by Grover. 9, 10”
From Implementation of a quantum search algorithm on a quantum computer (1998) · cites this paper as [9]
In the citing paper
“Among other applications Grover's algorithms enable an extremely rapid search over the domain of a binary function to find elements for which this function is satisfied (that is, the function has the value 1).”
From Implementation of a quantum search algorithm on a quantum computer (1998) · cites this paper as [9]
In the citing paper
“the ability to efficiently perform Hamiltonian simulation is used in conjunction with another technique known as the quantum phase estimation algorithm (QPEA) 42 for efficiently obtaining the eigen-energies and eigenstates of a quantum system 38 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
In the citing paper
“The Quantum Phase Estimation (QPE) algorithm 38,99 is the natural translation of the FCI procedure to quantum computers 45 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
In the citing paper
“Abrams and Lloyd 38 focused on state preparation in more detail and described concrete initialization procedures.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
In the citing paper
“They pointed out that state preparation is conceptually easier in second quantization, where a Fock state is represented by a simple product state of qubits in {| 0 〉 , | 1 〉} states.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
Citations
Cites
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Scheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
Rapid solution of problems by quantum computation
Deutsch, D., & Jozsa, R. (1992) · Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences · doi:10.1098/rspa.1992.0167 · Cited by 2,700
The Emperor's New Mind: Concerning Computers, Minds, and The Laws of Physics
Penrose, R., & Gardner, M. (1989) · doi:10.1093/oso/9780198519737.001.0001 · Cited by 2,007
Strengths and Weaknesses of Quantum Computing
Bennett, C. H., Bernstein, E., Brassard, G., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300933 · Cited by 1,470
On the Power of Quantum Computation
Simon, D. R. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796298637 · Cited by 1,295
Bernstein, E., & Vazirani, U. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167097 · Cited by 1,284
Benioff, P. (1980) · Journal of Statistical Physics · doi:10.1007/bf01011339 · Cited by 1,244
The Emperor's New Mind: Concerning Computers, Minds, and the Laws of Physics
Penrose, R., & Landauer, R. (1990) · Physics Today · doi:10.1063/1.2810599 · Cited by 1,110
Research works printed but not linked: 2
- [9]9. R. Penrose, Shadows of the mind,. Oxford University Press, 1994, pp. 348- 388.
- [14]14. Yao93J A. Yao, Quantum circuit complexip, Proceedings 34th Annual Symposium on Foundations of Computer Science (FOCS), 1993, pp. 352-361.
Cited by
Sorted by citations
Items 3,901–4,000 of 8,792
Quantum Data Management: From Theory to Opportunities
Hai, R., Hung, S.-H., & Feld, S. (2024) · Proceedings - International Conference on Data Engineering · doi:10.1109/icde60146.2024.00410 · Cited by 5
PQ-REACT: Post Quantum Cryptography Framework for Energy Aware Contexts
Cid, M. I. G., Kourtis, M., Domingo, D., et al. (2024) · International Conference on Availability, Reliability and Security (ARES) · doi:10.1145/3664476.3670868 · Cited by 5
Quantum One-Wayness of the Single-Round Sponge with Invertible Permutations
Carolan, J., & Poremba, A. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-68391-6_7 · Cited by 10
HDQMF: Holographic Feature Decomposition using Quantum Algorithms
Poduval, P., Zou, Z., & Imani, M. (2024) · 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/cvpr52733.2024.01044 · Cited by 5
Identifying Obstacles of PQC Migration in E-Estonia
Vakarjuk, J., Snetkov, N., & Laud, P. (2024) · International Conference on Cyber Conflict · doi:10.23919/cycon62501.2024.10685570 · Cited by 5
Optimization and design for multi-valued quantum comparator circuits
Zhang, T., Li, Y., Lu, S.-W., et al. (2025) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ada744 · Cited by 5
Towards Equivalence Checking of Classical Circuits Using Quantum Computing
Quetschlich, N., Forster, T. V., Osterwind, A., Helms, D., & Wille, R. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00040 · Cited by 5
Innovative Approaches to Teaching Quantum Computer Programming and Quantum Software Engineering
Haghparast, M., Moguel, E., García-Alonso, J. M., Mikkonen, T., & Murillo, J. M. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.10287 · Cited by 6
Sandanamudi, P. K., Agrawal, N., Tripathi, N., & N, P. K. B. (2025) · doi:10.1109/comsnets63942.2025.10885608 · Cited by 5
Quantum Chosen-Ciphertext Attacks Based on Simon’s Algorithm Against Unified Structures
Wang, X., Xiang, Z., Zhang, S., et al. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-88661-4_5 · Cited by 5
Hybrid Quantum–Classical Deep Neural Networks Based Smart Contract Vulnerability Detection
Durgut, S., Küçüksille, E. U., & Tokmak, M. (2025) · Applied Sciences · doi:10.3390/app15074037 · Cited by 6
Design of an efficient fault-tolerant quantum-computing circuit with quantum neural network learning
Lin, C., Xu, R., & Li, Y. (2025) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2025.110808 · Cited by 8
Hu, J., Wang, Q., & Li, S. (2025) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.5c00239 · Cited by 7
Core-climate coupling: Changes in the Earth’s core dynamics driven by climatic processes
Shahvandi, M. K. (2025) · Physics of The Earth and Planetary Interiors · doi:10.1016/j.pepi.2025.107366 · Cited by 8
Lai, C.-T., Blank, C., Schmelcher, P., & Mukherjee, R. (2025) · Machine Learning Science and Technology · doi:10.1088/2632-2153/addb97 · Cited by 5
Quantum-Inspired Aspect-Based Sentiment Analysis Using Natural Language Processing
Kayal, M., Sahoo, M., Pati, J., & Behera, R. K. (2025) · Intelligent systems reference library · doi:10.1007/978-3-031-89905-8_8 · Cited by 5
Sentiment-Enhanced Recommendation Systems: Understanding Emotional Influence in Consumer Behavior
Jagan, S., Girirajan, B., Mane, M. B., B, H. J. R., Anil, M., & Rani, M. T. (2025) · International Journal of Computational and Experimental Science and Engineering · doi:10.22399/ijcesen.2493 · Cited by 5
Kim, C., Kim, S.-H., Sohn, K., Son, Y., Kumar, M., & Kim, S. (2025) · Applied Sciences · doi:10.3390/app15147782 · Cited by 13
Optimizing SPHINCS+ for Low-Power Devices
Magyari, A., & Chen, Y. (2025) · Electronics · doi:10.3390/electronics14173460 · Cited by 5
A Logic for Quantum Circuits and Protocols
Patra, M. K. (2005) · Lecture notes in computer science · doi:10.1007/11560647_28 · Cited by 5
Entanglement purification with two-way classical communication
Leung, A. W., & Shor, P. W. (2008) · Quantum Information and Computation · doi:10.26421/qic8.3-4-6 · Cited by 5
Singh, M. P., & Rajput, B. S. (2015) · International Journal of Theoretical Physics · doi:10.1007/s10773-015-2815-8 · Cited by 5
Takahashi, K., Kurokawa, M., & Hashimoto, M. (2011) · Annual Conference of the IEEE Industrial Electronics Society (IECON) · doi:10.1109/iecon.2011.6119677 · Cited by 5
Extending scientific computing system with structural quantum programming capabilities
Gawron, P., Klamka, J., Miszczak, J., et al. (2010) · Bulletin of the Polish Academy of Sciences Technical Sciences · doi:10.2478/v10175-010-0008-4 · Cited by 5
Association Rules Mining with Quantum Computing and Quantum Storage
Gao, Q., Zhang, F., Wang, R., & Zhou, F. (2017) · International Conference on Big Data Computing and Communications (BigCom) · doi:10.1109/bigcom.2017.33 · Cited by 5
Function Maximization with Dynamic Quantum Search
Moussa, C., Calandra, H., & Humble, T. S. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-14082-3_8 · Cited by 5
Quantum Computer Search Algorithms: Can We Outperform the Classical Search Algorithms?
Leider, A. M., Siddiqui, S., Sabol, D. A., et al. (2019) · Advances in intelligent systems and computing · doi:10.1007/978-3-030-32520-6_34 · Cited by 5
A Framework of Quantum Strong Exponential-Time Hypotheses
Buhrman, H., Patro, S., & Speelman, F. (2019) · UvA-DARE (University of Amsterdam) · doi:10.4230/lipics.ccc.2020.16 · Cited by 12
An algebraic method to fidelity-based model checking over quantum Markov chains
Xu, M., Fu, J., Mei, J., et al. (2022) · Theoretical Computer Science · doi:10.1016/j.tcs.2022.08.016 · Cited by 5
Search by lackadaisical quantum walk with symmetry breaking
Rapoza, J., & Wong, T. G. (2021) · Physical Review A · doi:10.1103/physreva.104.062211 · Cited by 6
How Quantum Computers threat security of PKIs and thus eIDs.
Vogt, S., & Funke, H. (2021) · Open Identity Summit · Cited by 5
Average-Case Verification of the Quantum Fourier Transform Enables Worst-Case Phase Estimation
Linden, N., & de Wolf, R. (2022) · Quantum · doi:10.22331/q-2022-12-07-872 · Cited by 5
A Quantum Parallel Markov Chain Monte Carlo
Holbrook, A. J. (2023) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.2023.2195890 · Cited by 7
Jang, K., Song, G., Kim, H., & Seo, H. (2021) · IEEE International Conference on Consumer Electronics-Asia (ICCE-Asia) · doi:10.1109/icce-asia53811.2021.9642017 · Cited by 5
Boundary extension methods to quantum signal mean filtering
Zhang, R., Wang, J., & Jiang, N. (2022) · Quantum Information Processing · doi:10.1007/s11128-021-03386-5 · Cited by 5
Quantum version of self-balanced binary search tree with strings as keys and applications
Khadiev, K. R., & Enikeeva, S. (2022) · International Conference on Micro- and Nano-Electronics (ICMNE) · doi:10.1117/12.2624619 · Cited by 5
Low rank approximation in simulations of quantum algorithms
Ma, L., & Yang, C. (2022) · Journal of Computational Science · doi:10.1016/j.jocs.2022.101561 · Cited by 5
On Post-Quantum Identification in 5G
Damir, M. T., & Niemi, V. (2022) · ACM Conference on Security and Privacy in Wireless and Mobile Networks (WiSec) · doi:10.1145/3507657.3529657 · Cited by 5
Superconducting and Silicon-Based Semiconductor Quantum Computers: A review
Jia, Z.-L., Fu, Y., Cao, Z. X., Cheng, W., Zhao, Y., Dou, M., Duan, P., Kong, W., Cao, G., Li, H.-O., et al. (2022) · IEEE Nanotechnology Magazine · doi:10.1109/mnano.2022.3175394 · Cited by 5
Post-Quantum Cheating Detectable Private Information Retrieval
Zhu, L., Lin, C., Lin, F., & Zhang, L. F. (2022) · IFIP advances in information and communication technology · doi:10.1007/978-3-031-06975-8_25 · Cited by 6
A quantum learning approach based on Hidden Markov Models for failure scenarios generation
Zaiou, A., Bennani, Y., Mateï, B., et al. (2022) · Asia Conference on Algorithms, Computing and Machine Learning (CACML) · doi:10.1109/cacml55074.2022.00019 · Cited by 5
Engelsberger, A., Schubert, R., & Villmann, T. (2022) · Lecture notes in networks and systems · doi:10.1007/978-3-031-15444-7_7 · Cited by 5
Bideh, P. N., & Gehrmann, C. (2022) · doi:10.1145/3560826.3563381 · Cited by 5
Non-interactive quantum homomorphic encryption scheme based on the rotation operator
ShuoLin, W., Tao, S., & JianWei, L. (2022) · Zhongguo kexue. Wulixue Lixue Tianwenxue · doi:10.1360/sspma-2022-0381 · Cited by 5
Quantum computing for data-centric engineering and science
Herbert, S. (2022) · Data-Centric Engineering · doi:10.1017/dce.2022.36 · Cited by 5
On state transfer in Cayley graphs for abelian groups
Árnadóttir, A. S., & Godsil, C. D. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03751-y · Cited by 6
Post-Quantum Electronic Identity: Adapting OpenID Connect and OAuth 2.0 to the Post-Quantum Era
Schardong, F., Giron, A. A., Müller, F. L., & Custódio, R. F. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-20974-1_20 · Cited by 10
A Flexible NTT-Based Multiplier for Post-Quantum Cryptography
Koleci, K., Mazzetti, P., Martina, M., & Masera, G. (2023) · IEEE Access · doi:10.1109/access.2023.3234816 · Cited by 6
Automating NISQ Application Design with Meta Quantum Circuits with Constraints (MQCC)
Deng, H., Peng, Y., Hicks, M., & Wu, X. (2023) · ACM Transactions on Quantum Computing · doi:10.1145/3579369 · Cited by 5
Luo, Q.-B., Li, X., Yang, G., & Li, Q. (2023) · Quantum Information Processing · doi:10.1007/s11128-022-03799-w · Cited by 5
Quantum computing for data science
Sanders, B. C. (2023) · Journal of Physics Conference Series · doi:10.1088/1742-6596/2438/1/012007 · Cited by 5
The quantum realization of image linear gray enhancement
Liu, K., Wei, Y.-X., & Li, H.-S. (2023) · Quantum Machine Intelligence · doi:10.1007/s42484-023-00102-7 · Cited by 5
New results on quantum boomerang attacks
Zou, H., Zou, J. X., & Luo, Y. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03921-6 · Cited by 5
Quantum programming: Working with IBM’S qiskit tool
Neha, K., & Amrita, A. (2023) · THE SCIENTIFIC TEMPER · doi:10.58414/scientifictemper.2023.14.1.11 · Cited by 5
The Improvement of Decision Tree Construction Algorithm Based on Quantum Heuristic Algorithms
Mannapov, I. (2023) · Lobachevskii Journal of Mathematics · doi:10.1134/s1995080223020269 · Cited by 5
Reliability of IBM’s Public Quantum Computers.
Antón, R. P., Corbí, A., Sánchez, J. I. L., & Burgos, D. (2023) · International Journal of Interactive Multimedia and Artificial Intelligence · doi:10.9781/ijimai.2023.04.005 · Cited by 5
Groppe, S., Groppe, J., Çalıkyılmaz, U., Winker, T., & Gruenwal, L. (2023) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-031-35081-8_20 · Cited by 5
Decoherence mitigation by embedding a logical qubit in a qudit
Miyahara, H., Chen, Y., Roychowdhury, V., & Bouchard, L. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04035-9 · Cited by 7
Performance Analysis of the Hardware-Efficient Quantum Search Algorithm
Ahmadkhaniha, A., Mafi, Y., Kazemikhah, P., et al. (2023) · International Journal of Theoretical Physics · doi:10.1007/s10773-023-05424-7 · Cited by 5
QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits
Chen, T., Zhang, Z., Wang, H., Gu, J., Li, Z., Pan, D. Z., Chong, F. T., Han, S., & Wang, Z. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00015 · Cited by 6
Reducing the Compilation Time of Quantum Circuits Using Pre-Compilation on the Gate Level
Quetschlich, N., Burgholzer, L., & Wille, R. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00091 · Cited by 6
QuCT: A Framework for Analyzing Quantum Circuit by Extracting Contextual and Topological Features
Tan, S., Lang, C., Xiang, L., Wang, S., Jia, X., Tan, Z., Li, T., Yin, J., Shang, Y., Python, A., et al. (2023) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1145/3613424.3614274 · Cited by 7
One-to-Many Simultaneous Secure Quantum Information Transmission
Andronikos, T., & Sirokofskich, A. (2023) · Cryptography · doi:10.3390/cryptography7040064 · Cited by 5
Further insights on constructing quantum circuits for Camellia block cipher
Lin, D., Sun, B., Xiang, Z.-J., Zou, J., & Guo, Y. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04182-z · Cited by 4
Novel Quantum Circuit Designs for the Oracle of Grover’s Algorithm to Solve the Vertex Cover Problem
Jiang, J., & Yan, W.-H. (2023) · IEEE Eurasia Conference on IOT, Communication and Engineering (ECICE) · doi:10.1109/ecice59523.2023.10383108 · Cited by 5
HHL algorithm with mapping function and enhanced sampling for model predictive control in microgrids
Jing, H., Li, Y., Brandsema, M. J., Chen, Y., & Yue, M. (2024) · Applied Energy · doi:10.1016/j.apenergy.2024.122878 · Cited by 6
Satisfiability Modulo Theories-Based Qubit Mapping for Trapped-Ion Quantum Computing Systems
Tseng, W.-H., Chang, Y., & Jiang, J.-H. R. (2024) · International Symposium on Physical Design · doi:10.1145/3626184.3633329 · Cited by 6
Efficient implementations of CRAFT cipher for Internet of Things
Xiang, J., & Li, L. (2024) · Computers & Electrical Engineering · doi:10.1016/j.compeleceng.2024.109168 · Cited by 5
Construction and volumetric benchmarking of quantum computing noise models
Weber, T., Borras, K., Jansen, K., Krücker, D., & Riebisch, M. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad406c · Cited by 8
A general quantum algorithm for numerical integration
Shu, G., Shan, Z., Xu, J., et al. (2024) · Scientific Reports · doi:10.1038/s41598-024-61010-9 · Cited by 5
Quantum Computing: A Comprehensive Review
Tamrakar, A., & Sharma, R. (2019) · Türk bilgisayar ve matematik eğitimi dergisi · doi:10.61841/turcomat.v10i3.14623 · Cited by 6
Quantum Computing: A Tool for Zero-Trust Wireless Networks
Farouk, A., Al-Kuwari, S. M., Abulkasim, H., et al. (2024) · IEEE Network · doi:10.1109/mnet.2024.3420166 · Cited by 5
Quantum Circuit Design for the Lee-Brickell Based Information Set Decoding
Perriello, S., Barenghi, A., & Pelosi, G. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-61489-7_2 · Cited by 5
MPC in the Head Using the Subfield Bilinear Collision Problem
Huth, J., & Joux, A. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-68376-3_2 · Cited by 5
Implementing multi-controlled X gates using the quantum Fourier transform
Arsoski, V. V. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04511-w · Cited by 6
Practical Implementation of a Quantum String Matching Algorithm
Marino, F. P., Faro, S., & Scardace, A. (2024) · doi:10.1145/3660318.3660327 · Cited by 7
Automatic generation of efficient oracles: The less-than case
Sanchez‐Rivero, J., Talaván, D., García-Alonso, J. M., Ruiz–Cortés, A., & Murillo, J. M. (2024) · Journal of Systems and Software · doi:10.1016/j.jss.2024.112203 · Cited by 5
Depth-Optimized Quantum Circuit of Gauss–Jordan Elimination
Jang, K., Oh, Y., & Seo, H. (2024) · Applied Sciences · doi:10.3390/app14198579 · Cited by 6
Enhancing Healthcare Security with Quantum Blockchain: Electronic Medical Records Protection
Venkatesh, R., & Darandale, S. (2024) · International Conference on Networks, Multimedia and Information Technology (NMITCON) · doi:10.1109/nmitcon62075.2024.10699120 · Cited by 6
Wroński, M., Burek, E., & Leśniak, M. (2025) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2024.3474856 · Cited by 12
Quantum-inspired attribute selection algorithms
Sharma, D., Singh, P., & Kumar, A. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad934d · Cited by 7
Sarkar, A., & Jhamb, M. (2024) · Engineering Research Express · doi:10.1088/2631-8695/ad988c · Cited by 5
Unlocking quantum SVM potential: optimal feature map generation and feature selection
Zahid, S., & Tahir, M. A. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad9e39 · Cited by 5
Modified AKMA for Decentralized Authentication in LEO Satellite-Based IoT Networks
Khan, S., Durrani, S., Thapa, C., et al. (2025) · IEEE Internet of Things Journal · doi:10.1109/jiot.2025.3526635 · Cited by 5
QuantumAnnealing: A Julia Package for Simulating Dynamics of Transverse Field Ising Models
Morrell, Z., Vuffray, M., Misra, S., & Coffrin, C. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00096 · Cited by 9
Parallel circuit implementation of variational quantum algorithms
Cattelan, M., Yarkoni, S., & Lechner, W. (2025) · npj Quantum Information · doi:10.1038/s41534-025-00982-6 · Cited by 8
On multivariate polynomials achievable with quantum signal processing
Laneve, L., & Wolf, S. (2025) · Quantum · doi:10.22331/q-2025-02-20-1641 · Cited by 5
Chinnaraju, A. (2025) · International Journal of Advanced Research in Science Communication and Technology · doi:10.48175/ijarsct-23352 · Cited by 5
Santos, V. O., Rocha, P. A. C., Thé, J. V. G., & Gharabaghi, B. (2025) · Atmosphere · doi:10.3390/atmos16030255 · Cited by 7
Quantum Feasibility Labeling for NP-Complete Vertex Coloring Problem
Zhan, J. (2025) · IEEE Access · doi:10.1109/access.2025.3545262 · Cited by 9
Quantum contrastive learning for human activity recognition
Ren, Y., Wang, D., An, L., Mao, S., & Wang, X. (2025) · Smart Health · doi:10.1016/j.smhl.2025.100574 · Cited by 6
FMCC: Flexible Measurement-based Quantum Computation over Cluster State
Li, Y., Pawar, A., Mo, Z., Zhang, Y., Yang, J., & Tang, X. (2024) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3622781.3674185 · Cited by 6
Dynamic Sharding and Monte Carlo for Post-Quantum Blockchain Resilience
Hajar, D., Afifi, N., & Hilal, I. (2025) · Cryptography · doi:10.3390/cryptography9020022 · Cited by 5
Efficient semi-quantum private set intersection cardinality protocol without pre-shared key
Zhang, X., Wei, C., Gao, F., Li, W., & Qin, S. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04836-0 · Cited by 5
A Variant of Quantum Genetic Algorithm and Its Possible Applications
Tiwari, P. K., & Vidyarthi, D. P. (2012) · Advances in intelligent and soft computing · doi:10.1007/978-81-322-0487-9_76 · Cited by 5
Høyer, P. (2005) · Lecture notes in computer science · doi:10.1007/11602613_32 · Cited by 5
The Quantum Complexity of Set Membership
Available, N. A. N., Available, N. A. N., & Available, N. A. N. (2002) · Algorithmica · doi:10.1007/s00453-002-0979-0 · Cited by 13
Pattern Classification Using a Quantum System
Ventura, D. A. (2002) · ScholarsArchive (Brigham Young University) · Cited by 5
Quantum Query Algorithms for Conjunctions
Vasilieva, A., & Mischenko-Slatenkova, T. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13523-1_16 · Cited by 5
Application of Grover's Quantum Search Algorithm to Solve the Transcendental Logarithm Problem
Tang, Y., & Su, S. (2014) · International Conference on Computational Intelligence and Security (CIS) · doi:10.1109/cis.2014.166 · Cited by 5
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
