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,001–2,100 of 8,792
Simulating the Effect of Decoherence and Inaccuracies on a Quantum Computer
Obenland, K., & Despain, A. M. (1999) · Lecture notes in computer science · doi:10.1007/3-540-49208-9_41 · Cited by 17
Prospective Algorithms for Quantum Evolutionary ComputationPreprint
Sofge, D. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0804.1133 · Cited by 18
Spectra of Quantized Walks and a $\sqrt{δε}$ rulePreprint
Szegedy, M. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0401053 · Cited by 18
Introduction to Quantum Information ProcessingPreprint
Knill, E. H., Laflamme, R., Barnum, H., Dalvit, D. A. R., Dziarmaga, J., Gubernatis, J. E., Gurvits, L., Ortíz, G., Viola, L., & Zurek, W. H. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0207171 · Cited by 27
Quantum Communication ComplexityPreprint
Klauck, H. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0005032 · Cited by 18
Model checking quantum protocols
Papanikolaou, N. K. (2026) · Warwick Research Archive Portal (University of Warwick) · doi:10.82444/warw.33484729 · Cited by 18
Games as a Platform for Student Participation in Authentic Scientific Research
Magnussen, R., Hansen, S. D., Planke, T., & Sherson, J. F. (2015) · The Electronic Journal of e-Learning · doi:10.48550/arxiv.1511.01653 · Cited by 25
Robust Quantum Algorithms and PolynomialsPreprint
Buhrman, H., Newman, I., Röhrig, H., & de Wolf, R. (2005) · Cited by 18
Compiling Quantum Circuits using the Palindrome TransformPreprint
Aho, A. V., & Svore, K. M. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0311008 · Cited by 25
The Quantum Version Of Classification Decision Tree Constructing Algorithm C5.0Preprint
Khadiev, K. R., Mannapov, I., & Safina, L. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.06840 · Cited by 23
Block-based quantum-logic synthesisPreprint
Saeedi, M., Arabzadeh, M., Zamani, M. S., & Sedighi, M. (2011) · arXiv (Cornell University) · doi:10.5555/2011395.2011401 · Cited by 21
High-fidelity superconducting quantum processors via laser-annealing of transmon qubitsPreprint
Zhang, E., Srinivasan, S. J., Sundaresan, N., Bogorin, D. F., Martin, Y., Hertzberg, J. B., Timmerwilke, J., Pritchett, E., Yau, J.-B., Wang, C., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2012.08475 · Cited by 18
A Quantum of QUIC: Dissecting Cryptography with Post-Quantum Insights
Kempf, M., Gauder, N., Jaeger, B., Zirngibl, J., & Carle, G. (2024) · 2024 IFIP Networking Conference (IFIP Networking) · doi:10.23919/ifipnetworking62109.2024.10619916 · Cited by 15
Quantum Google algorithm: Construction and application to complex networks
Paparo, G. D., Müller, M., Comellas, F., & Martin-Delgado, M. A. (2014) · The European Physical Journal Plus · doi:10.1140/epjp/i2014-14150-y · Cited by 17
A Hybrid Quantum-Classical Generative Adversarial Network for Near-Term Quantum Processors
Boyle, A. O., & Nikandish, G. (2024) · IEEE Access · doi:10.1109/access.2024.3433383 · Cited by 19
Blockchain for Security in Digital Twins
Suleiman, R., Sai, A. M. V. V., Yu, W., & Wang, C. (2025) · Future Internet · doi:10.3390/fi17090385 · Cited by 24
The Security Problems in Some Novel Arbitrated Quantum Signature Protocols
Zhang, L., Sun, H.-W., Zhang, K., Wang, Q.-L., & Cai, X. (2017) · International Journal of Theoretical Physics · doi:10.1007/s10773-017-3394-7 · Cited by 17
A quantum related-key attack based on the Bernstein–Vazirani algorithm
Xie, H., & Yang, L. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02741-2 · Cited by 18
A report on teaching a series of online lectures on quantum computing from CERN
Combarro, E. F., Vallecorsa, S., Rodríguez-Muñiz, L. J., Aguilar-González, Á., Ranilla, J., & Meglio, A. D. (2021) · The Journal of Supercomputing · doi:10.1007/s11227-021-03847-9 · Cited by 17
Quantum Attacks on 1K-AES and PRINCE
Cai, B., Wu, Y., Dong, J., Qin, S., Gao, F., & Wen, Q. (2021) · The Computer Journal · doi:10.1093/comjnl/bxab216 · Cited by 17
Near-Optimal Quantum Algorithms for String Problems
Akmal, S., & Jin, C. (2022) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611977073.109 · Cited by 18
A High-Performance SIKE Hardware Accelerator
Ni, Z., Kundi, D., O'Neill, M. P., & Liu, W. (2022) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/tvlsi.2022.3152011 · Cited by 17
Revisiting the Feasibility of Public Key Cryptography in Light of IIoT Communications
Astorga, J., Barceló, M., Urbieta, A., & Jacob, E. (2022) · Sensors · doi:10.3390/s22072561 · Cited by 17
Experimental Analysis of Quantum Annealers and Hybrid Solvers Using Benchmark Optimization Problems
Stogiannos, E., Papalitsas, C., & Andronikos, T. (2022) · Mathematics · doi:10.3390/math10081294 · Cited by 17
Habibi, M. R., Golestan, S., Soltanmanesh, A., Guerrero, J. M., & Vásquez, J. C. (2022) · Electronics · doi:10.3390/electronics11182919 · Cited by 21
A Robust Quantum Layout Synthesis Algorithm with a Qubit Mapping Checker
Wu, T.-A., Jiang, Y.-J., & Fang, S. (2022) · International Conference on Computer Aided Design · doi:10.1145/3508352.3549394 · Cited by 18
A memetic quantum-inspired genetic algorithm based on tabu search
Hesar, A. S., & Houshmand, M. (2023) · Evolutionary Intelligence · doi:10.1007/s12065-023-00866-8 · Cited by 17
Faj, J., Peng, I. B., Wahlgren, J., & Markidis, S. (2023) · IEEE International Conference on eScience · doi:10.1109/e-science58273.2023.10254803 · Cited by 17
Efficient, Error-Resistant NTT Architectures for CRYSTALS-Kyber FPGA Accelerators
Khan, S., Khalid, A., Rafferty, C., Shah, Y. A., O'Neill, M. P., Lee, W., & Hwang, S. O. (2023) · IFIP/IEEE International Conference on Very Large Scale Integration · doi:10.1109/vlsi-soc57769.2023.10321885 · Cited by 20
Quantum Path Integral Approach for Vehicle Routing Optimization With Limited Qubit
Gautam, K., & Ahn, C. W. (2023) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2023.3327157 · Cited by 19
Quantum-parallel vectorized data encodings and computations on trapped-ion and transmon QPUs
Balewski, J. T., Amankwah, M. G., Beeumen, R. V., Bethel, E. W., Perciano, T., & Camps, D. (2024) · Scientific Reports · doi:10.1038/s41598-024-53720-x · Cited by 18
Exact distributed quantum algorithm for generalized Simon’s problem
Li, H., Qiu, D., Luo, L., & Mateus, P. (2024) · Acta Informatica · doi:10.1007/s00236-024-00455-x · Cited by 18
Multi-Phase Quantum Resistant Framework for Secure Communication in SCADA Systems
Ghosh, S., Zaman, M., Joshi, R., & Sampalli, S. (2024) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2024.3378474 · Cited by 21
Evaluating the Security of CRYSTALS-Dilithium in the Quantum Random Oracle Model
Jackson, K., Miller, C. A., & Wang, D. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-58751-1_15 · Cited by 24
Synthetiq: Fast and Versatile Quantum Circuit Synthesis
Paradis, A., Dekoninck, J., Bichsel, B., & Vechev, M. (2024) · Proceedings of the ACM on Programming Languages · doi:10.1145/3649813 · Cited by 26
Abdelfatah, R. I. (2024) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2024.102062 · Cited by 17
Links between Quantum Distinguishers Based on Simon’s Algorithm and Truncated Differentials
Xiang, Z., Wang, X., Yu, B., et al. (2024) · IACR Transactions on Symmetric Cryptology · doi:10.46586/tosc.v2024.i2.296-321 · Cited by 17
A Novel Hybrid Quantum Architecture for Path Planning in Quantum-Enabled Autonomous Mobile Robots
Sarkar, M., Pradhan, J., Singh, A. K., & Nenavath, H. (2024) · IEEE Transactions on Consumer Electronics · doi:10.1109/tce.2024.3423416 · Cited by 18
Quantum neural networks under depolarization noise: exploring white-box attacks and defenses
Winderl, D., Franco, N., & Lorenz, J. M. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00208-6 · Cited by 23
Toward the Quantum-Safe Web: Benchmarking Post-Quantum TLS
Rı́os, R., Montenegro, J. A., Muñoz, A., & Ferraris, D. (2025) · IEEE Network · doi:10.1109/mnet.2025.3531116 · Cited by 21
Proof-of-work consensus by quantum sampling
Singh, D., Muraleedharan, G., Fu, B., Cheng, C.-M., Newton, N. R., Rohde, P. P., & Brennen, G. K. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/adae2b · Cited by 20
Long optical and electron spin coherence times for erbium ions in silicon
Berkman, I. R., Lyasota, A., de Boo, G. G., Bartholomew, J. G., Lim, S. Q., Johnson, B. C., McCallum, J. C., Xu, B.-B., Xie, S., Abrosimov, N. V., et al. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01008-x · Cited by 33
Quantum lower bound for inverting a permutation with advice
Nayebi, A., Aaronson, S., Belovs, A., & Trevisan, L. (2015) · Quantum Information and Computation · doi:10.26421/qic15.11-12-1 · Cited by 26
Barium Ions for Quantum Computation
Dietrich, M., Avril, A., Bowler, R., Kurz, N., Salacka, J. S., Shu, G., Blinov, B. B., Danielson, J. R., & Pedersen, T. S. (2009) · AIP conference proceedings · doi:10.1063/1.3122286 · Cited by 18
Quantum cooperative search algorithm for 3-SAT
Cheng, S.-T., & Tao, M. (2006) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2006.09.003 · Cited by 17
Optimal Parallel Quantum Query Algorithms
Jeffery, S., Magniez, F., & de Wolf, R. (2016) · Algorithmica · doi:10.1007/s00453-016-0206-z · Cited by 28
Formula lower bounds via the quantum method
Tal, A. (2017) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3055399.3055472 · Cited by 23
Efficient quantum steganography scheme using inverted pattern approach
Luo, G., Zhou, R., & Hu, W. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2341-3 · Cited by 17
On the Quantum and Classical Complexity of Solving Subtraction Games
Kravchenko, D., Khadiev, K. R., & Serov, D. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-19955-5_20 · Cited by 17
Training and Meta-Training Binary Neural Networks with Quantum Computing
Fawaz, A., Klein, P., Piat, S., Simone Severini, B., & Mountney, P. (2019) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3292500.3330953 · Cited by 17
On the Hitting Times of Quantum Versus Random Walks
Magniez, F., Nayak, A., Richter, P. C., & Sántha, M. (2009) · Algorithmica · doi:10.1007/s00453-011-9521-6 · Cited by 85
Casalé, B., Molfetta, G. D., Kadri, H., & Ralaivola, L. (2020) · Quantum Machine Intelligence · doi:10.1007/s42484-020-00024-8 · Cited by 18
Pholkos – Efficient Large-State Tweakable Block Ciphers from the AES Round Function
Bossert, J., List, E., Lucks, S., et al. (2022) · Lecture notes in computer science · doi:10.1007/978-3-030-95312-6_21 · Cited by 17
Quantum Cryptanalysis on Contracting Feistel Structures and Observation on Related-Key Settings
Cid, C., Hosoyamada, A., Liu, Y., et al. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-65277-7_17 · Cited by 17
Shaydulin, R., Thomas, C., & Rodeghero, P. (2020) · doi:10.1145/3387940.3391471 · Cited by 17
Improved Quantum Circuits via Intermediate Qutrits
Baker, J. M., Duckering, C., Gokhale, P., Brown, N. C., Brown, K. R., & Chong, F. T. (2020) · ACM Transactions on Quantum Computing · doi:10.1145/3406309 · Cited by 17
Hillmich, S., Kueng, R., Markov, I. L., & Wille, R. (2021) · Design, Automation, and Test in Europe · doi:10.23919/date51398.2021.9474034 · Cited by 17
Classical and Quantum Random-Walk Centrality Measures in Multilayer Networks
Böttcher, L., & Porter, M. A. (2021) · SIAM Journal on Applied Mathematics · doi:10.1137/20m1385998 · Cited by 21
A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits
Gheorghiu, V., Mosca, M., & Mukhopadhyay, P. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00624-1 · Cited by 22
Blockchain in the Quantum World
Faridi, A. R., Masood, F., Shamsan, A. H., Luqman, M., & Salmony, M. Y. (2022) · International Journal of Advanced Computer Science and Applications · doi:10.14569/ijacsa.2022.0130167 · Cited by 16
Intelligent recommender system based on quantum clustering and matrix completion
Ouedrhiri, O., Banouar, O., Hadaj, S. E., & Raghay, S. (2022) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.6943 · Cited by 18
Burgholzer, L., Ploier, A., & Wille, R. (2022) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2022.3197969 · Cited by 17
$$Q|SI\rangle $$Q|SI⟩ : A Quantum Programming Environment
Liu, S., Wang, X., Zhou, L., Guan, J., Li, Y., He, Y., Duan, R., & Ying, M. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-01461-2_8 · Cited by 17
Three-dimensional quantum wavelet transforms
Li, H.-S., Li, G., & Xia, H. (2022) · Frontiers of Computer Science · doi:10.1007/s11704-022-1639-y · Cited by 17
A SAT Encoding for Optimal Clifford Circuit Synthesis
Schneider, S., Burgholzer, L., & Wille, R. (2023) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1145/3566097.3567929 · Cited by 17
Comparison of Selection Strategies for Evolutionary Quantum Circuit Design
Leier, A., & Banzhaf, W. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24855-2_65 · Cited by 17
Team decision problems with classical and quantum signals
Brandenburger, A. M., & Mura, P. L. (2015) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2015.0096 · Cited by 18
An improved lower bound on query complexity for quantum PAC learning
Zhang, C. (2010) · Information Processing Letters · doi:10.1016/j.ipl.2010.10.007 · Cited by 18
Commutativity of quantum weakest preconditions
Ying, M., Chen, J., Feng, Y., et al. (2007) · Information Processing Letters · doi:10.1016/j.ipl.2007.06.003 · Cited by 17
Participant Attack on Three-party Quantum key Agreement with Two-photon Entanglement
Zhu, Z., Hu, A., & Fu, A. (2015) · International Journal of Theoretical Physics · doi:10.1007/s10773-015-2632-0 · Cited by 17
Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing
Kempe, J., Regev, O., Unger, F., & de Wolf, R. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-70575-8_69 · Cited by 16
Optimization with Quantum Genetic Algorithm
Das, B., & Roy, U. (2014) · International Journal of Computer Applications · Cited by 17
Ito, T., & Jeffery, S. (2018) · Algorithmica · doi:10.1007/s00453-018-0527-1 · Cited by 27
Quantum walk search with time-reversal symmetry breaking
Wong, T. G. (2015) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/48/40/405303 · Cited by 19
Mandrà, S., Guerreschi, G. G., & Aspuru‐Guzik, A. (2015) · Physical Review A · doi:10.1103/physreva.92.062320 · Cited by 17
From reversible logic to quantum circuits: Logic design for an emerging technology
Wille, R., Chattopadhyay, A., & Drechsler, R. (2016) · International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation · doi:10.1109/samos.2016.7818357 · Cited by 17
Improved Look-Ahead Approaches for Nearest Neighbor Synthesis of 1D Quantum Circuits
Bhattacharjee, A., Bandyopadhyay, C., Wille, R., Drechsler, R., & Rahaman, H. (2019) · International Conference on VLSI Design · doi:10.1109/vlsid.2019.00054 · Cited by 17
Boolean satisfiability in quantum compilation
Soeken, M., Meuli, G., Schmitt, B. D. O., Mozafari, F., Riener, H., & Micheli, G. D. (2019) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2019.0161 · Cited by 16
Global multipartite entanglement dynamics in Grover’s search algorithm
Pan, M., Qiu, D., & Zheng, S. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1661-4 · Cited by 17
QUANTUM-INSPIRED EVOLUTIONARY ALGORITHM FOR TRAVELLING SALESMAN PROBLEM
Feng, X., Wang, Y., Ge, H., et al. (2007) · Computational Methods · doi:10.1007/978-1-4020-3953-9_55 · Cited by 17
da Cruz, A. V. A., Pacheco, M. A. C., Vellasco, M. M. B. R., et al. (2005) · Lecture notes in computer science · doi:10.1007/11499305_1 · Cited by 17
Implementing competitive learning in a quantum system
Ventura, D. A. (2003) · 2022 International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1999.831539 · Cited by 17
Towards a quantum information technology industry
Spiller, T. P., & Munro, W. J. (2005) · Journal of Physics Condensed Matter · doi:10.1088/0953-8984/18/1/n01 · Cited by 18
Algorithms for Boolean Function Query Properties
Aaronson, S. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539700379644 · Cited by 20
Evolving blackbox quantum algorithms using genetic programming
Stadelhofer, R., Banzhaf, W., & Suter, D. (2008) · Artificial intelligence for engineering design analysis and manufacturing · doi:10.1017/s089006040800019x · Cited by 16
Theory of the quantum speed-up
Castagnoli, G., & Finkelstein, D. R. (2001) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2001.0797 · Cited by 16
Robust Polynomials and Quantum Algorithms
Buhrman, H., Newman, I., Röhrig, H., & de Wolf, R. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-31856-9_49 · Cited by 17
He, J., & Sanders, J. W. (2006) · Lecture notes in computer science · doi:10.1007/11768173_11 · Cited by 17
Yamakami, T. (2003) · International Journal of Foundations of Computer Science · doi:10.1142/s0129054103002047 · Cited by 19
Relativized separation of from
Green, F., & Pruim, R. J. (2001) · Information Processing Letters · doi:10.1016/s0020-0190(01)00176-4 · Cited by 17
Strength and Weakness in Grover's Quantum Search AlgorithmPreprint
Younes, A. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0811.4481 · Cited by 17
Schuld, M., & Petruccione, F. (2016) · Springer eBooks · doi:10.1007/978-1-4899-7502-7_913-1 · Cited by 19
SPHINCS-Simpira: Fast Stateless Hash-based Signatures with Post-quantum SecurityPreprint
Gueron, S., & Mouha, N. (2017) · IACR Cryptology ePrint Archive · Cited by 17
Strongly symmetric spectral convex bodies are Jordan algebra state spacesPreprint
Barnum, H., & Hilgert, J. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.03753 · Cited by 34
Threshold error rates for the toric and surface codesPreprint
Wang, D. S., Fowler, A. G., Stephens, A. M., & Hollenberg, L. C. L. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0905.0531 · Cited by 17
Exact Quantum Query Complexity of EXACT and THRESHOLDPreprint
Ambainis, A., Iraids, J., & Smotrovs, J. (2013) · arXiv (Cornell University) · doi:10.4230/lipics.tqc.2013.263 · Cited by 23
Basis for a neuronal version of Grover's quantum algorithm
Clark, K. B. (2014) · Frontiers in Molecular Neuroscience · doi:10.3389/fnmol.2014.00029 · Cited by 16
Solow, D. (2000) · Complexity · doi:10.1002/1099-0526(200009/10)6:1 · Cited by 7
Quantum Computers Supported Path to Technological Singularity – A Predictive Analysis
Aithal, P. S., & Aithal, S. (2025) · Poornaprajna International Journal of Basic & Applied Sciences (PIJBAS) · doi:10.64818/pijbas.3107.8478.0013 · Cited by 16
A Survey of Post-Quantum Cryptography Support in Cryptographic Libraries
Ahmed, N., Zhang, L., & Gangopadhyay, A. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00102 · Cited by 16
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
