The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index; none of the 8 sources its claims cite is checked for support yet.
A fast quantum mechanical algorithm for database search
Open accessAbstract
An unsorted database contains N records, of which just one satisfies a particular property.The problem is to identify that one record.Any classical algorithm, deterministic or probabilistic, will clearly take O (N) steps since on the average it will have to examine a large fraction of the N records.Quantum mechanical systems can do several operations simultaneously due to their wave like properties.This paper gives an O ( JN) step quantum mechanical algorithm for identifying that record.It is within a constant factor of the fastest possible quantum mechanical algorithm.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
19 No basis given · 8 Sources not found · 4 Own interpretation
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This paper gives an O ( JN) step quantum mechanical algorithm for identifying that record.”
§ A fast quantum mechanical algorithm for database search > Abstract
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- The authors state this as an assumption: There is a unique state that satisfies the condition C(S)=1.
- The authors state this as an assumption: For any state S, the condition C(S) can be evaluated in unit time.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Corollary 3.1-Let the state vector be as followsfor any one state the amplitude is k, for each of the remaining (N-1) states the amplitude is 1.Let k and 1 be real numbers (in general the amplitudes can be complex).Let k be negative and 1 be positive such that ~< ~N.Then after applying the diffusion transform both k and 1are positive numbers.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“First, it is proved that the system is a valid quantum mechanical system (theorems 1 & 2)”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
boosted- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“As mentioned in the introduction, the algorithm of this paper does not use any Imowledge about the problem.”
§ A fast quantum mechanical algorithm for database search > 114
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Theorem 1-The matix D is unitary.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The following sections prove that the system discussed in section 3 is indeed a valid quantum mechanical system and that it converges to the desired state with a probability O(l).”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- The authors state this as an assumption: There is a unique state that satisfies the condition C(S)=1.
- The authors state this as an assumption: For any state S, the condition C(S) can be evaluated in unit time.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Theorem 2 -D can be expressed as D = FRF, where F, the Fourier Transform Matrix and R, the rotation matrix are defined as follows”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Since the proba-& bility of the system being found in any particular state is proportional to the square of the amplitude, it follows that the probability of the system being in tlhe desired state when k is ~, 1 J2 is k2 = ~.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In case there is a unique state SV such that C(SV) = 1, the final state is SV with a probability of at least ~. 2”
§ A fast quantum mechanical algorithm for database search > T. Acknowledgments
plainconditional- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
- The authors state this as an assumption: There is a unique state that satisfies the condition C(S)=1.
- The authors state this as an assumption: For any state S, the condition C(S) can be evaluated in unit time.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“It can be easily modified to take care of the case when there are multiple states satisfying the condition C(S) = 1 and it is required to return one of these.”
§ A fast quantum mechanical algorithm for database search > 114
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Probably not a substantial claim. 8
- It may state two separate claims as one. 4
- The quote only partly states this claim. 1
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Theorem 5-Let the probability of a particular outcome in an experiment be &.Then if the experiment be repeated ~times, the probability that the outcome does not happen even once is less than or equal to e-K.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The change in k ( Ak) after steps (a) and (b) of the algorithm is lower bounded by Ak>~.Also after steps (a) and (b), 1>0.2fi”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Using this it immediately follows that there exists a number M less than EN, such that in M repetitions of the loop in step (ii), k wifl become ~.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The quote only partly states this claim.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The most efficient classical algorithm for this is to examine the items in the database one by one.”
§ A fast quantum mechanical algorithm for database search > ------------------------------------------------
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“Very recent results [Shor95] have shown the existence of quantum mechanical error corr~ting cod~which enable transmission of data even in the presence of noise”
§ A fast quantum mechanical algorithm for database search > 114
What the sources say
- Not matchedcites [Shor95]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
boosteddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This algorithm, by cleverly making use of some features of the structure of the problem, is the only known algorithm that solves the problem in O (logIV) steps.”
§ A fast quantum mechanical algorithm for database search > 114
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The phase does not have an analog in classical probabilistic algorithms.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This illustrates the point that, in quantum mechanics, the complete description of the system requires the amplitudes over all states, just the probabilities is not enough.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
In the paper
“For example Shor's primality testing algorithm [Shor94] for a number N can be viewed as a search of the (N-l) numbers smaller than N to see if any of them is a factor of N.”
§ A fast quantum mechanical algorithm for database search > 114
What the sources say
- Not matchedcites [Shor94]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
In the paper
“There is also a scheme discussed in [VV86] by which it is possible to modify any algorithm that solves an NPsearch problem with a unique solution and use it to solve an NP-search problem in general.”
§ A fast quantum mechanical algorithm for database search > 114
What the sources say
- Not matchedcites [VV86]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
hedgeddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
In the paper
“This operation is one of the things that makes quantum mechanical algorithms more powerful than classical algorithms and forms the basis for most significant quantum mechanical algorithms.”
§ A fast quantum mechanical algorithm for database search > T. Acknowledgments
What the sources say
- Not matchedcites [DJ92]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
- Not matched
The authors state this as an assumption.
There is a unique state that satisfies the condition C(S)=1.
“Let there be a unique state, say Sv, that satisfies the condition C(SV) = 1, whereas for all other states S, C(S) = 0”
“The algorithm as discussed here assumes a unique state that satisfies the desired condition.”
The authors state this as an assumption.
For any state S, the condition C(S) can be evaluated in unit time.
“(assume that for any state S, the condition C(S) can be evaluated in unit time)”
The paper relies on this without support.
There does not exist any sorting on the database that would aid selection of the desired item.
“However, there does not exist any sorting on the database that would aid its selection.”
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Symmetric cryptography remains comparatively resilient, yet Grover's algorithm offers a quadratic speed-up for brute-force key search, effectively halving the security margin of symmetric ciphers [13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Similarly, for hash functions, Grover's algorithm [185] can facilitate quantum birthday attack to find collision, thereby necessitating an output of larger size.”
From Zero Trust Architecture (ZTA): A Comprehensive Survey (2022) · cites this paper as [185]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Similarly, Grover’s algorithm concedes a quadratic advantage for mining blocks in certain consensus protocols such as proof of work.”
From Quantum-resistance in blockchain networks (2023) · cites this paper as [71]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Quantum computers will be able to find these nonces quadratically faster using Grover’s algorithm71.”
From Quantum-resistance in blockchain networks (2023) · cites this paper as [71]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“This model is realistic given the falling cost of storage, the rise of large-scale surveillance infrastructures, and the expected disruption of quantum algorithms such as Shor's and Grover's [1,2,13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measured
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Grover's algorithm provides only a quadratic speedup, effectively halving brute-force resistance. Comparable security margins can be restored by doubling key sizes (for example, AES-128 to AES-256) [13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“This explains why AES-256 maintains post-quantum security margins, whereas AES-128 requires upgrading to maintain equivalent protection levels [13,14].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“At the same time, Grover's algorithm shows that symmetric cryptography, though more resilient, also demands doubled key sizes to maintain equivalent margins [13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“In this sense, Grover-based optimization algorithms [184] such as Grover Adaptive Search [161] have been proposed.”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [184]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The former bound is tight since recent work of Grover [13] shows how to accept the class NP relative to any oracle on a quantum computer in time O (2 n/ 2 ).”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“In view of Grover's algorithm [13], we know that the constant '1 / 2' in the statement of Theorem 3.5 cannot be improved.”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The former bound is tight since recent work of Grover [13] shows how to accept the class NP relative to any oracle on a quantum computer in time O (2 n/ 2 ).”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“Grover’s algorithm [54] is a quantum algorithm for searching in a database, ofering quadratic speedup over classical searching methods.”
From QASMBench: A Low-Level Quantum Benchmark Suite for NISQ Evaluation and Simulation (2023) · cites this paper as [54]
The cited source says what the claim attributes to it.
In the citing paper
“However, quantum machines can recognize this language quadratically faster, in time O ( √ 2 n ), using Grover's algorithm [13].”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
The cited source says what the claim attributes to it.
In the citing paper
“That this was a real possibility is clear from Grover's [13] result, which gives a black-box approach to solving NP -complete problems in square-root as much time as is required classically.”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
The cited source says what the claim attributes to it.
In the citing paper
“Various strategies can be imagined, but a good one (called 'inversion about the average' by Grover [13]) is to perform an oracle-independent unitary transformation so as to change the phase difference into an amplitude difference, leaving the y term with the same sign as all the other terms but a magnitude approximately threefold larger.”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“The HNDL adversary departs from conventional cryptanalysis in its temporal asymmetry. Instead of attempting immediate decryption, the attacker passively collects encrypted traffic or stored archives and defers decryption until sufficient computational resources become available.”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredIn the citing paper
“This algorithm uses a single function evaluation to label the single state which satisfies the function, followed by a series of gates which drive the system into this particular state.”
From Implementation of a quantum search algorithm on a quantum computer (1998) · cites this paper as [9]
In the citing paper
“Here we show how such a computer can be used to implement a fast quantum search algorithm initially developed by Grover. 9, 10”
From Implementation of a quantum search algorithm on a quantum computer (1998) · cites this paper as [9]
In the citing paper
“Among other applications Grover's algorithms enable an extremely rapid search over the domain of a binary function to find elements for which this function is satisfied (that is, the function has the value 1).”
From Implementation of a quantum search algorithm on a quantum computer (1998) · cites this paper as [9]
In the citing paper
“the ability to efficiently perform Hamiltonian simulation is used in conjunction with another technique known as the quantum phase estimation algorithm (QPEA) 42 for efficiently obtaining the eigen-energies and eigenstates of a quantum system 38 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
In the citing paper
“The Quantum Phase Estimation (QPE) algorithm 38,99 is the natural translation of the FCI procedure to quantum computers 45 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
In the citing paper
“Abrams and Lloyd 38 focused on state preparation in more detail and described concrete initialization procedures.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
In the citing paper
“They pointed out that state preparation is conceptually easier in second quantization, where a Fock state is represented by a simple product state of qubits in {| 0 〉 , | 1 〉} states.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
Citations
Cites
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Scheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
Rapid solution of problems by quantum computation
Deutsch, D., & Jozsa, R. (1992) · Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences · doi:10.1098/rspa.1992.0167 · Cited by 2,700
The Emperor's New Mind: Concerning Computers, Minds, and The Laws of Physics
Penrose, R., & Gardner, M. (1989) · doi:10.1093/oso/9780198519737.001.0001 · Cited by 2,007
Strengths and Weaknesses of Quantum Computing
Bennett, C. H., Bernstein, E., Brassard, G., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300933 · Cited by 1,470
On the Power of Quantum Computation
Simon, D. R. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796298637 · Cited by 1,295
Bernstein, E., & Vazirani, U. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167097 · Cited by 1,284
Benioff, P. (1980) · Journal of Statistical Physics · doi:10.1007/bf01011339 · Cited by 1,244
The Emperor's New Mind: Concerning Computers, Minds, and the Laws of Physics
Penrose, R., & Landauer, R. (1990) · Physics Today · doi:10.1063/1.2810599 · Cited by 1,110
Research works printed but not linked: 2
- [9]9. R. Penrose, Shadows of the mind,. Oxford University Press, 1994, pp. 348- 388.
- [14]14. Yao93J A. Yao, Quantum circuit complexip, Proceedings 34th Annual Symposium on Foundations of Computer Science (FOCS), 1993, pp. 352-361.
Cited by
Sorted by citations
Items 2,501–2,600 of 8,792
Quantum Neural Network and Its Application in Vehicle Classification
Yu, S., & Ma, N. (2008) · International Conference on Natural Computation (ICNC) · doi:10.1109/icnc.2008.466 · Cited by 13
Exceptional quantum walk search on the cycle
Wong, T. G., & Santos, R. A. M. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1606-y · Cited by 13
Demonstration of quantum permutation algorithm with a single photon ququart
Wang, F., Wang, Y., Liu, R., Chen, D., Zhang, P., Gao, H., & Li, F. (2015) · Scientific Reports · doi:10.1038/srep10995 · Cited by 12
Microwave Packaging for Superconducting Qubits
Lienhard, B., Braumüller, J., Woods, W. H., Rosenberg, D., Calusine, G., Weber, S. J., Vepsäläinen, A. P., O’Brien, K. P., Orlando, T. P., Gustavsson, S., et al. (2019) · IEEE MTT-S International Microwave Symposium digest · doi:10.1109/mwsym.2019.8701119 · Cited by 16
Quantum-Inspired Swarm Evolution Algorithm
You-rui, H., Chaoli, T., & Wang, S. (2007) · International Conference on Computational Intelligence and Security Workshops (CISW) · doi:10.1109/cisw.2007.4425481 · Cited by 13
One Complexity Theorist's View of Quantum Computing
Fortnow, L. (2000) · Electronic Notes in Theoretical Computer Science · doi:10.1016/s1571-0661(05)80330-5 · Cited by 15
Separating Quantum and Classical Learning
Servedio, R. A. (2001) · Lecture notes in computer science · doi:10.1007/3-540-48224-5_86 · Cited by 13
MEYER, D. A. (2002) · Computer Physics Communications · doi:10.1016/s0010-4655(02)00420-4 · Cited by 13
Computational complexity of an optical model of computation
Woods, D. (2005) · Cited by 13
Abstract Interpretation Techniques for Quantum Computation
Jorrand, P., & Perdrix, S. (2009) · Cambridge University Press eBooks · doi:10.1017/cbo9781139193313.007 · Cited by 13
Quantum Computers Speed Up Classical with Probability ZeroPreprint
Ozhigov, Y. (1998) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9803064 · Cited by 17
Alternative Computational Models: A Comparison of Biomolecular and Quantum Computation
Reif, J. H. (1998) · Lecture notes in computer science · doi:10.1007/978-3-540-49382-2_10 · Cited by 12
Span-program-based quantum algorithm for the rank problemPreprint
Belovs, A. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1103.0842 · Cited by 13
On the Evolutionary Design of Quantum Circuits
Reid, T. (2005) · UWSpace (University of Waterloo) · Cited by 12
Frameworks for Quantum Algorithms
Jeffery, S. (2014) · UWSpace (University of Waterloo) · Cited by 13
Quantum lower bounds by quantum argumentsPreprint
Ambainis, A. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0002066 · Cited by 13
QDNN: DNN with Quantum Neural Network LayersPreprint
Zhao, C., & Gao, X.-S. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1912.12660 · Cited by 15
Park, H., Son, S., Park, Y., et al. (2024) · Electronics · doi:10.3390/electronics13193930 · Cited by 12
Quantum partial search for uneven distribution of multiple target items
Zhang, K., & Korepin, V. E. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-1907-9 · Cited by 12
Quantum Advantage and the Y2K Bug: A Comparison
Zhang, L., Miranskyy, A. V., & Rjaibi, W. (2020) · IEEE Software · doi:10.1109/ms.2020.2985321 · Cited by 16
Quantum neuron with real weights
Monteiro, C. A., Filho, G. I. S., Costa, M. H. J., Neto, F. M. D. P., & de Oliveira, W. R. (2021) · Neural Networks · doi:10.1016/j.neunet.2021.07.034 · Cited by 13
Batterman, R. W. (2021) · Oxford University Press eBooks · doi:10.1093/oso/9780197568613.003.0006 · Cited by 14
Mapping Nearest Neighbor Compliant Quantum Circuits Onto a 2-D Hexagonal Architecture
Chang, K.-Y., & Lee, C. (2021) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2021.3127868 · Cited by 13
SpinQ Triangulum: A commercial three-qubit desktop quantum computer
Feng, G., Hou, S., Zou, H., Shi, W., Yü, S., Sheng, Z., Rao, X., Ma, K., Chen, C., Ren, B., et al. (2022) · IEEE Nanotechnology Magazine · doi:10.1109/mnano.2022.3175392 · Cited by 13
LWR-based Quantum-Safe Pseudo-Random Number Generator
Pandit, A. A., Kumar, A., & Mishra, A. (2023) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2023.103431 · Cited by 16
Liu, W., Li, Y., Wang, Z., et al. (2023) · Entropy · doi:10.3390/e25030516 · Cited by 12
Grover’s Algorithm – Implementations and Implications
Guo, C. (2023) · Highlights in Science Engineering and Technology · doi:10.54097/hset.v38i.5997 · Cited by 12
Boosting quantum amplitude exponentially in variational quantum algorithms
Kyaw, T. H., Soley, M. B., Allen, B., Bergold, P., Sun, C., Batista, V. S., & Aspuru‐Guzik, A. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/acf4ba · Cited by 17
QPause: Quantum-Resistant Password-Protected Data Outsourcing for Cloud Storage
Jiang, J., Wang, D., & Zhang, G. (2023) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2023.3331000 · Cited by 14
A hybrid quantum-classical approach for inference on restricted Boltzmann machines
Kālis, M., Locāns, A., Šikovs, R., Naseri, H., & Ambainis, A. (2023) · Quantum Machine Intelligence · doi:10.1007/s42484-023-00135-y · Cited by 12
Quantum blockchain architecture using cyclic QSCD and QKD
Kumar, M., & Mondal, B. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04316-x · Cited by 12
Optimization of Quantum Circuits for Stabilizer Codes
Mondal, A., & Parhi, K. K. (2024) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2024.3384436 · Cited by 13
Garcia‐Buendia, N., Muñoz-Montoro, A. J., Cortina, R., Marín, J. M. M., & Moyano‐Fuentes, J. (2024) · IEEE Access · doi:10.1109/access.2024.3411307 · Cited by 16
Quantum image encryption algorithm based on Fisher–Yates algorithm and Logistic mapping
Fan, P., & Zhang, Y. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04441-7 · Cited by 12
Quantum Speedup of the Dispersion and Codebook Design Problems
Yukiyoshi, K., Mikuriya, T., Rou, H. S., de Abreu, G. T. F., & Ishikawa, N. (2024) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2024.3450852 · Cited by 12
Hybrid Classical–Quantum Text Search Based on Hashing
Ablayev, F. M., Salikhova, N., & Ablayev, M. (2024) · Mathematics · doi:10.3390/math12121858 · Cited by 12
Polynomial Reduction Methods and their Impact on QAOA Circuits
Schmidbauer, L., Wintersperger, K., Lobe, E., & Mauerer, W. (2024) · IEEE International Conference on Quantum Software (QSW) · doi:10.1109/qsw62656.2024.00018 · Cited by 12
Quantum K-Nearest Neighbors: Utilizing QRAM and SWAP-Test Techniques for Enhanced Performance
Maldonado-Romo, A., Montiel-Pérez, J. Y., Onofre, V., Maldonado-Romo, J., & Sossa, H. (2024) · Mathematics · doi:10.3390/math12121872 · Cited by 14
Symbolic model checking quantum circuits in Maude
Do, C. M., & Ogata, K. (2024) · PeerJ Computer Science · doi:10.7717/peerj-cs.2098 · Cited by 13
A quantum image encryption algorithm based on chaotic system and Rubik’s cube principle
Song, F.-Y., Xu, G., Wang, H., & Jiang, D. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04492-w · Cited by 12
Modular quantum-to-quantum Bernoulli factory in an integrated photonic processor
Hoch, F., Giordani, T., Castello, L., Carvacho, G., Spagnolo, N., Ceccarelli, F., Pentangelo, C., Piacentini, S., Crespi, A., Osellame, R., et al. (2024) · Nature Photonics · doi:10.1038/s41566-024-01526-8 · Cited by 13
Al-Bayaty, A., & Perkowski, M. A. (2024) · Scientific Reports · doi:10.1038/s41598-024-74587-y · Cited by 12
Exploring LLM-Driven Explanations for Quantum Algorithms
d’Aloisio, G., Fortz, S., Hanna, C., Fortunato, D., Bensoussan, A., Usandizaga, E. M., & Sarro, F. (2024) · Proceedings of the ... ACM-IEEE International Symposium on Empirical Software Engineering and Measurement/International Symposium on Empirical Software Engineering and Measurement · doi:10.1145/3674805.3690753 · Cited by 12
Integrating Post-Quantum Cryptography into CoAP and MQTT-SN Protocols
Blanco-Romero, J., Lorenzo, V., Almenárez, F., Díaz-Sánchez, D., Campo, C., & García-Rubio, C. (2024) · IEEE Symposium on Computers and Communications (ISCC) · doi:10.1109/iscc61673.2024.10733716 · Cited by 12
The role of data embedding in equivariant quantum convolutional neural networks
Das, S., Martina, S., & Caruso, F. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00215-7 · Cited by 15
PPLBB: a novel privacy-preserving lattice-based blockchain platform in IoMT
Sezer, B. B., & Akleylek, S. (2024) · The Journal of Supercomputing · doi:10.1007/s11227-024-06650-4 · Cited by 13
Route-Forcing: Scalable Quantum Circuit Mapping for Scalable Quantum Computing Architectures
Escofet, P., Gonzalvo, A., Alarcón, E., Almudéver, C. G., & Abadal, S. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00110 · Cited by 17
Optimizing Gate Decomposition for High-Level Quantum Programming
Rosa, E. C. R., Duzzioni, E. I., & de Santiago, R. (2025) · Quantum · doi:10.22331/q-2025-03-12-1659 · Cited by 18
Savadatti, S. G., Cherukuri, A. K., Jonnalagadda, A., et al. (2025) · Complex & Intelligent Systems · doi:10.1007/s40747-025-01851-7 · Cited by 12
Enhancing quantum support vector machine for healthcare applications using custom feature maps
Bansal, R., Rajput, N. K., & Khanna, M. (2025) · Knowledge-Based Systems · doi:10.1016/j.knosys.2025.113669 · Cited by 12
Hybrid Quantum-Safe integration of TLS in SDN networks
Buruaga, J. S., Méndez, R. B., Brito, J. P., et al. (2025) · Computer Networks · doi:10.1016/j.comnet.2025.111355 · Cited by 12
Memory-augmented hybrid quantum reservoir computing
Settino, J., Salatino, L., Mariani, L., D’Amore, F., Channab, M., Bozzolo, L., Vallisa, S., Barillà, P., Policicchio, A., Gullo, N. L., et al. (2025) · Physical Review Applied · doi:10.1103/wzwv-7rk2 · Cited by 12
From Quantum Physics to Programming Languages: A Process Algebraic Approach
Jorrand, P., & Lalire, M. (2005) · Lecture notes in computer science · doi:10.1007/11527800_1 · Cited by 12
Non-uniform attacks against one-way functions and PRGs.
De, A., Trevisan, L., & Tulsiani, M. (2009) · Cited by 12
Square root of ‘not’: a major difference between fuzzy and quantum logics
Крейнович, В., Kohout, L., & Kim, E. (2010) · International Journal of General Systems · doi:10.1080/03081079.2010.510728 · Cited by 12
Function Optimization Based on Quantum Genetic Algorithm
Sun, Y., & Xiong, H. (2014) · Research Journal of Applied Sciences Engineering and Technology · doi:10.19026/rjaset.7.231 · Cited by 12
Arbitrated quantum signature scheme based on reusable key
Yu, C., Guo, G., & Lin, S. (2014) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-014-5491-4 · Cited by 12
Maritime applications of quantum computation
Venegas-Andraca, S. E., Lanzagorta, M. O., & Uhlmann, J. K. (2015) · MTS/IEEE OCEANS Conference (OCEANS) · doi:10.23919/oceans.2015.7404356 · Cited by 13
Quantum hyperparallel algorithm for matrix multiplication
Zhang, X.-D., Zhang, X., & Xue, Z. (2016) · Scientific Reports · doi:10.1038/srep24910 · Cited by 12
Quantum search algorithm using quantum bit string comparator
Oliveira, D. S., de Sousa, P. B. M., & Ramos, R. V. (2006) · International Telecommunications Symposium (ITS) · doi:10.1109/its.2006.4433341 · Cited by 12
A Quantum-Inspired Evolutionary Algorithm Using Gaussian Distribution-Based Quantization
Tirumala, S. S. (2017) · Arabian Journal for Science and Engineering · doi:10.1007/s13369-017-2641-9 · Cited by 12
X states of the same spectrum and entanglement as all two-qubit states
Hedemann, S. R. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-2061-0 · Cited by 13
Improved impossible differential cryptanalysis of large-block Rijndael
Liu, Y., Shi, Y., Gu, D., et al. (2018) · Science China Information Sciences · doi:10.1007/s11432-017-9365-4 · Cited by 12
Quantum Circuit Realization of Morphological Gradient for Quantum Grayscale Image
Fan, P., Zhou, R., Hu, W., & Jing, N. (2018) · International Journal of Theoretical Physics · doi:10.1007/s10773-018-3943-8 · Cited by 12
A general protocol for distributed quantum gates
Sarvaghad-Moghaddam, M., & Moghadam, M. Z. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03191-0 · Cited by 12
A Scalable High-Precision and High-Throughput Architecture for Emulation of Quantum Algorithms
Mahmud, N., & El‐Araby, E. (2018) · IEEE International System-on-Chip Conference (SOCC) · doi:10.1109/socc.2018.8618545 · Cited by 12
Quantum Watermarking Based on Neighbor Mean Interpolation and LSB Steganography Algorithms
Hu, W., Zhou, R., & Li, Y. (2019) · International Journal of Theoretical Physics · doi:10.1007/s10773-019-04104-9 · Cited by 12
Sajid, M., & Raza, Z. (2019) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.5327 · Cited by 12
From Ansätze to Z-Gates: A NASA View of Quantum Computing
Rieffel, E. G., Hadfield, S., Hogg, T., Mandrà, S., Marshall, J., Mossi, G., O’Gorman, B., Plamadeala, E., Tubman, N. M., Venturelli, D., et al. (2019) · Advances in parallel computing · doi:10.3233/apc190010 · Cited by 15
Chandra, D., Babar, Z., Nguyen, H. V., Alanis, D., Botsinis, P., Ng, S. X., & Hanzo, L. (2019) · IEEE Access · doi:10.1109/access.2019.2936795 · Cited by 11
A weak limit theorem for a class of long-range-type quantum walks in 1d
Wada, K. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2491-3 · Cited by 11
Approximation of Quantum States Using Decision Diagrams
Zulehner, A., Hillmich, S., Markov, I. L., & Wille, R. (2020) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1109/asp-dac47756.2020.9045454 · Cited by 12
Quantum Indistinguishability for Public Key Encryption
Gagliardoni, T., Krämer, J., & Struck, P. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-81293-5_24 · Cited by 15
(2020) · doi:10.1109/ises50453.2020.00015 · Cited by 12
Cold Boot Attacks on the Supersingular Isogeny Key Encapsulation (SIKE) Mechanism
Villanueva-Polanco, R., & Angulo-Madrid, E. (2020) · Applied Sciences · doi:10.3390/app11010193 · Cited by 10
i -QER: An Intelligent Approach Towards Quantum Error Reduction
Basu, S., Saha, A., Chakrabarti, A., & Sur‐Kolay, S. (2022) · ACM Transactions on Quantum Computing · doi:10.1145/3539613 · Cited by 12
A novel qutrit representation of quantum image
Dong, H., Lu, D., & Li, C. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03450-8 · Cited by 12
Quantum Boomerang Attacks and Some Applications
Frixons, P., Naya‐Plasencia, M., & Schrottenloher, A. (2022) · Lecture notes in computer science · doi:10.1007/978-3-030-99277-4_16 · Cited by 13
A Symmetric Extensible Protocol for Quantum Secret Sharing
Ampatzis, M., & Andronikos, T. (2022) · Symmetry · doi:10.3390/sym14081692 · Cited by 12
Cryptography in the Quantum Era
Lella, E., Gatto, A., Pazienza, A., Romano, D., Noviello, P., Vitulano, F., & Schmid, G. (2022) · IEEE Workshop on Low Temperature Electronics (WOLTE) · doi:10.1109/wolte55422.2022.9882585 · Cited by 12
Embracing iterations in Quantum software: a vision
Khan, A. A., Fahmideh, M., Ahmad, A., Waseem, M., Niazi, M., Lahtinen, V., & Mikkonen, T. (2022) · doi:10.1145/3549036.3562057 · Cited by 12
A quantum walks assisted algorithm for peptide and protein folding prediction
Varsamis, G. D., & Karafyllidis, I. G. (2022) · Biosystems · doi:10.1016/j.biosystems.2022.104822 · Cited by 13
Comparative Benchmark of a Quantum Algorithm for the Bin Packing Problem
de Andoin, M. G., Oregi, I., Villar-Rodríguez, E., Osaba, E., & Sanz, M. (2022) · IEEE Symposium Series on Computational Intelligence (SSCI) · doi:10.1109/ssci51031.2022.10022156 · Cited by 13
The Prospects of Quantum Computing for Quantitative Finance and Beyond
Chang, Y.-J., Sie, M.-F., Liao, S.-W., & Chang, C. (2023) · IEEE Nanotechnology Magazine · doi:10.1109/mnano.2023.3249501 · Cited by 16
Uncomputation in the Qrisp High-Level Quantum Programming Framework
Seidel, R., Tcholtchev, N., Bock, S., & Hauswirth, M. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-38100-3_11 · Cited by 12
Quantum-resistant End-to-End Secure Messaging and Email Communication
Döberl, C., Eibner, W., Gärtner, S., Kos, M., Kutschera, F., & Ramacher, S. (2023) · International Conference on Availability, Reliability and Security (ARES) · doi:10.1145/3600160.3605049 · Cited by 11
Quantum Search Approaches to Sampling-Based Motion Planning
Lathrop, P., Boardman, B., & Martı́nez, S. (2023) · IEEE Access · doi:10.1109/access.2023.3307316 · Cited by 14
Measurement-Based Quantum Sealed-Bid Auction
Ye, C.-Q., Li, J., Chen, X., Dong, M., & Ota, K. (2023) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2023.3314646 · Cited by 12
QuantumEyes: Towards Better Interpretability of Quantum Circuits
Ruan, S., Guan, Q., Griffin, P., Mao, Y., & Wang, Y. (2023) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2023.3332999 · Cited by 12
Quantum simulation of colour in perturbative quantum chromodynamics
Chawdhry, H. A., & Pellen, M. (2023) · SciPost Physics · doi:10.21468/scipostphys.15.5.205 · Cited by 21
Quantum Natural Language Generation on Near-Term Devices
Karamlou, A., Wootton, J. R., & Pfaffhauser, M. (2022) · International Conference on Natural Language Generation · doi:10.18653/v1/2022.inlg-main.22 · Cited by 19
Quantum Fourier Iterative Amplitude Estimation
de Lejarza, J. J. M., Grossi, M., Cieri, L., & Germán Rodrigo, A. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00071 · Cited by 12
Quantum Vulnerability Analysis to Guide Robust Quantum Computing System Design
Qi, F., Smith, K. N., LeCompte, T., Tzeng, N.-F., Yuan, X., Chong, F. T., & Peng, L. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3343625 · Cited by 20
Parallel Quantum Algorithm for Hamiltonian Simulation
Zhang, Z., Wang, Q., & Ying, M. (2024) · Quantum · doi:10.22331/q-2024-01-15-1228 · Cited by 28
Quantum Circuits for Stabilizer Error Correcting Codes: A Tutorial
Mondal, A., & Parhi, K. K. (2024) · IEEE Circuits and Systems Magazine · doi:10.1109/mcas.2024.3349668 · Cited by 15
Liu, C.-Y. (2023) · International Conference on Computational Science and Computational Intelligence (CSCI) · doi:10.1109/csci62032.2023.00071 · Cited by 16
Toward Quantum Computational Agents
Klusch, M. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-25928-2_14 · Cited by 12
The discrete-time quaternionic quantum walk on a graph
Konno, N., Mitsuhashi, H., & Sato, I. (2015) · Quantum Information Processing · doi:10.1007/s11128-015-1205-8 · Cited by 12
On the uselessness of quantum queries
Meyer, D., & Pommersheim, J. (2011) · Theoretical Computer Science · doi:10.1016/j.tcs.2011.06.037 · Cited by 12
ABDERRAHIM, A., Talbi, E., & KHALED, M. (2012) · International Journal of Foundations of Computer Science · doi:10.1142/s0129054112400217 · Cited by 12
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
