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 201–300 of 8,792
Image storage, retrieval, compression and segmentation in a quantum system
Li, H.-S., Qingxin, Z., Lan, S., Shen, C., Zhou, R., & Jia, M. (2013) · Quantum Information Processing · doi:10.1007/s11128-012-0521-5 · Cited by 157
Li, H.-S., Zhu, Q., Zhou, R., Song, L., & Xing-jiang, Y. (2013) · Quantum Information Processing · doi:10.1007/s11128-013-0705-7 · Cited by 156
Villalonga, B., Boixo, S., Nelson, B. C., Henze, C. E., Rieffel, E. G., Biswas, R., & Mandrà, S. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0196-1 · Cited by 181
Rietsche, R., Dremel, C., Bosch, S., Steinacker, L., Meckel, M., & Leimeister, J. M. (2022) · Electronic Markets · doi:10.1007/s12525-022-00570-y · Cited by 171
A layered software architecture for quantum computing design tools
Svore, K. M., Aho, A. V., Cross, A. W., Chuang, I. L., & Markov, I. L. (2006) · Computer · doi:10.1109/mc.2006.4 · Cited by 166
Discrete Quantum Walks Hit Exponentially Faster
Kempe, J. (2005) · Probability Theory and Related Fields · doi:10.1007/s00440-004-0423-2 · Cited by 152
Clarke, P. J., Collins, R. J., Dunjko, V., Andersson, E., Jeffers, J., & Buller, G. S. (2012) · Nature Communications · doi:10.1038/ncomms2172 · Cited by 155
Advanced Simulation of Quantum Computations
Zulehner, A., & Wille, R. (2018) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2018.2834427 · Cited by 171
Estimate All the {LWE, NTRU} Schemes!
Albrecht, M. R., Curtis, B. R., Deo, A., Davidson, A., Player, R., Postlethwaite, E. W., Virdia, F., & Wunderer, T. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-98113-0_19 · Cited by 156
Application-Oriented Performance Benchmarks for Quantum Computing
Lubinski, T., Johri, S., Varosy, P., Coleman, J., Zhao, L., Necaise, J., Baldwin, C. H., Mayer, K., & Proctor, T. J. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3253761 · Cited by 242
Singh, A., Dev, K., Šiljak, H., Joshi, H. D., & Magarini, M. (2021) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3109944 · Cited by 184
The recent trends in cyber security: A review
Kaur, J., & Ramkumar, K. R. (2021) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2021.01.018 · Cited by 188
Machine learning in the quantum realm: The state-of-the-art, challenges, and future vision
Houssein, E. H., Abohashima, Z., Elhoseny, M., & Mohamed, W. M. (2022) · Expert Systems with Applications · doi:10.1016/j.eswa.2022.116512 · Cited by 166
Grover Adaptive Search for Constrained Polynomial Binary Optimization
Gilliam, A., Woerner, S., & Gonciulea, C. (2021) · Quantum · doi:10.22331/q-2021-04-08-428 · Cited by 153
Experimental authentication of quantum key distribution with post-quantum cryptography
Wang, L., Zhang, K., Wang, J., Cheng, J., Yang, Y., Tang, S.-B., Yan, D., Tang, Y.-L., Liu, Z., Yu, Y., et al. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00400-7 · Cited by 155
NP-complete Problems and Physical RealityPreprint
Aaronson, S. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0502072 · Cited by 153
Guest Column: A Survey of Quantum Learning Theory
Arunachalam, S., & de Wolf, R. (2017) · ACM SIGACT News · doi:10.1145/3106700.3106710 · Cited by 152
D’Hondt, E., & Panangaden, P. (2006) · Mathematical Structures in Computer Science · doi:10.1017/s0960129506005251 · Cited by 158
Image classification based on quantum K-Nearest-Neighbor algorithm
Dang, Y., Jiang, N., Hu, H., Ji, Z., & Zhang, W. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-2004-9 · Cited by 166
Silq: a high-level quantum language with safe uncomputation and intuitive semantics
Bichsel, B., Baader, M., Gehr, T., & Vechev, M. (2020) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/3385412.3386007 · Cited by 154
Circuit-Based Quantum Random Access Memory for Classical Data
Park, D. K., Petruccione, F., & Rhee, J.-K. K. (2019) · Scientific Reports · doi:10.1038/s41598-019-40439-3 · Cited by 151
Reachability Deficits in Quantum Approximate Optimization
Akshay, V., Philathong, H., Morales, M. E. S., & Biamonte, J. D. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.090504 · Cited by 151
Quantum Summation with an Application to Integration
Heinrich, S. (2002) · Journal of Complexity · doi:10.1006/jcom.2001.0629 · Cited by 153
Toward an architecture for quantum programming
Bettelli, S., Calarco, T., & Serafini, L. (2003) · The European Physical Journal D · doi:10.1140/epjd/e2003-00242-2 · Cited by 148
Quantum Algorithm for the Collision Problem
Gilles Brassard, A., Høyer, P., & Tapp, A. (2016) · Encyclopedia of Algorithms · doi:10.1007/978-1-4939-2864-4_304 · Cited by 150
Quantum Search Algorithms for Wireless Communications
Botsinis, P., Alanis, D., Babar, Z., Nguyen, H. V., Chandra, D., Ng, S. X., & Hanzo, L. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2882385 · Cited by 149
Adiabatic Quantum Computation and Quantum Annealing
McGeoch, C. C. (2014) · Synthesis lectures on quantum computing · doi:10.2200/s00585ed1v01y201407qmc008 · Cited by 288
Focus beyond Quadratic Speedups for Error-Corrected Quantum Advantage
Babbush, R., McClean, J. R., Newman, M., Gidney, C., Boixo, S., & Neven, H. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.010103 · Cited by 148
Guo, H. M., Zhang, J., & Kœhler, G. J. (2008) · Decision Support Systems · doi:10.1016/j.dss.2008.07.001 · Cited by 145
Population modeling of the emergence and development of scientific fields
Bettencourt, L. M. A., Kaiser, D. I., Kaur, J., Castillo‐Chávez, C., & Wojick, D. E. (2008) · Scientometrics · doi:10.1007/s11192-007-1888-4 · Cited by 146
Post-Quantum Blockchain Security for the Internet of Things: Survey and Research Directions
Gharavi, H., Granjal, J., & Monteiro, E. (2024) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2024.3355222 · Cited by 168
Polynomial degree vs. quantum query complexity
Ambainis, A. (2005) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2005.06.006 · Cited by 173
Ajagekar, A., & You, F. (2022) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2022.112493 · Cited by 164
Computational advantage of quantum random sampling
Hangleiter, D., & Eisert, J. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.035001 · Cited by 145
ScaffCC: Scalable compilation and analysis of quantum programs
Javadi-Abhari, A., Patil, S. R., Kudrow, D., Heckey, J., Lvov, A., Chong, F. T., & Martonosi, M. (2014) · Parallel Computing · doi:10.1016/j.parco.2014.12.001 · Cited by 142
Bernstein, D. J. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12929-2_6 · Cited by 158
Unruh, D. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-29011-4_10 · Cited by 142
SupermarQ: A Scalable Quantum Benchmark Suite
Tomesh, T., Gokhale, P., Omole, V., Ravi, G. S., Smith, K. N., Viszlai, J., Wu, X.-C., Hardavellas, N., Martonosi, M., & Chong, F. T. (2022) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca53966.2022.00050 · Cited by 184
Strategies for designing geometric transformations on quantum images
Le, P. Q., Iliyasu, A. M., Dong, F., & Hirota, K. (2010) · Theoretical Computer Science · doi:10.1016/j.tcs.2010.11.029 · Cited by 141
Near-optimal quantum circuit for Grover's unstructured search using a transverse field
Zhang, J., Rieffel, E. G., & Wang, Z. (2017) · Physical Review A · doi:10.1103/physreva.95.062317 · Cited by 145
A practical architecture for reliable quantum computers
Oskin, M., Chong, F. T., & Chuang, I. L. (2002) · Computer · doi:10.1109/2.976922 · Cited by 137
Lower bounds on the non-Clifford resources for quantum computations
Beverland, M. E., Campbell, E. T., Howard, M., & Kliuchnikov, V. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab8963 · Cited by 186
Ezhov, A. A., & Ventura, D. (2000) · Studies in Fuzziness and Soft Computing · doi:10.1007/978-3-7908-1856-7_11 · Cited by 147
Computational complexity of the landscape: Part I
Frederik Denef, B., & Douglas, M. R. (2006) · Annals of Physics · doi:10.1016/j.aop.2006.07.013 · Cited by 163
Quantum-Inspired Immune Clonal Algorithm for Global Optimization
Jiao, L., Li, Y., Gong, M., & Zhang, X. (2008) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2008.927271 · Cited by 140
Reinforcement Learning with Quantum Variational Circuit
Lockwood, O., & Si, M. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment · doi:10.1609/aiide.v16i1.7437 · Cited by 167
Post-Quantum Cryptosystems for Internet-of-Things: A Survey on Lattice-Based Algorithms
Asif, R. (2021) · IoT · doi:10.3390/iot2010005 · Cited by 161
Exponentially more precise quantum simulation of fermions in second quantization
Babbush, R., Berry, D. W., Kivlichan, I. D., Wei, A. Y., Love, P. J., & Aspuru-Guzik, A. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/3/033032 · Cited by 135
Quantum resistant public key cryptography: a survey
Perlner, R. A., & Cooper, D. A. (2009) · Proceedings of the 8th Symposium on Identity and Trust on the Internet · doi:10.1145/1527017.1527028 · Cited by 137
Why Philosophers Should Care about Computational Complexity
Aaronson, S. (2013) · The MIT Press eBooks · doi:10.7551/mitpress/8009.003.0011 · Cited by 159
Quantum Public-Key Cryptosystems
Okamoto, T., Tanaka, K., & Uchiyama, S. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44598-6_9 · Cited by 132
Quantum Search on Bounded-Error Inputs
Høyer, P., Mosca, M., & de Wolf, R. (2003) · Lecture notes in computer science · doi:10.1007/3-540-45061-0_25 · Cited by 148
Quantum Attacks on Classical Proof Systems: The Hardness of Quantum Rewinding
Ambainis, A., Rosmanis, A., & Unruh, D. (2014) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2014.57 · Cited by 134
Disentangling Scrambling and Decoherence via Quantum Teleportation
Yoshida, B., & Yao, N. Y. (2019) · Physical Review X · doi:10.1103/physrevx.9.011006 · Cited by 150
Quantum differential and linear cryptanalysis
Leurent, G., Kaplan, M. A., Leverrier, A., & Naya‐Plasencia, M. (2017) · HAL · Cited by 133
Quantum cryptanalysis of hash and claw-free functions
Gilles Brassard, A., Høyer, P., & Tapp, A. (1997) · ACM SIGACT News · doi:10.1145/261342.261346 · Cited by 132
Full-state quantum circuit simulation by using data compression
Wu, X.-C., Di, S., Dasgupta, E. M., Cappello, F., Finkel, H., Alexeev, Y., & Chong, F. T. (2019) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1145/3295500.3356155 · Cited by 148
Benchmarking Quantum Computers and the Impact of Quantum Noise
Resch, S., & Karpuzcu, U. R. (2021) · ACM Computing Surveys · doi:10.1145/3464420 · Cited by 167
Qibo : a framework for quantum simulation with hardware acceleration
Efthymiou, S., Ramos-Calderer, S., Bravo-Prieto, C., Pérez-Salinas, A., García-Martín, D., García-Sáez, A., Latorre, J. I., & Carrazza, S. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/ac39f5 · Cited by 169
Quantum Machine Learning Applications in the Biomedical Domain: A Systematic Review
Maheshwari, D., García-Zapirain, B., & Sierra-Sosa, D. (2022) · IEEE Access · doi:10.1109/access.2022.3195044 · Cited by 158
Quantum machine learning in high energy physics
Guan, W., Perdue, G., Pesah, A. C., Schuld, M., Terashi, K., Vallecorsa, S., & Vlimant, J.-R. (2020) · Machine Learning Science and Technology · doi:10.1088/2632-2153/abc17d · Cited by 152
Post-quantum cryptography Algorithm's standardization and performance analysis
Kumar, M. (2022) · Array · doi:10.1016/j.array.2022.100242 · Cited by 157
Decoherence in the quantum walk on the line
Romanelli, A., Siri, R., Abal, G., Auyuanet, A., & Donangelo, R. (2004) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2004.08.070 · Cited by 130
Quantum computation, quantum theory and AI
Ying, M. (2009) · Artificial Intelligence · doi:10.1016/j.artint.2009.11.009 · Cited by 139
Rath, M., & Date, H. (2024) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-024-00285-3 · Cited by 175
Full-stack, real-system quantum computer studies: architectural comparisons and design insights
Murali, P., Linke, N. M., Martonosi, M., Abhari, A. J., Nguyen, N. H., & Alderete, C. H. (2019) · Proceedings of the 46th International Symposium on Computer Architecture · doi:10.1145/3307650.3322273 · Cited by 128
Quantum money from hidden subspaces
Aaronson, S., & Christiano, P. F. (2012) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2213977.2213983 · Cited by 156
QMDDs: Efficient Quantum Function Representation and Manipulation
Niemann, P., Wille, R., Miller, D. M., Thornton, M. A., & Drechsler, R. (2015) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2015.2459034 · Cited by 126
Applications of quantum inspired computational intelligence: a survey
Manju, A. S., & Nigam, M. J. (2012) · Artificial Intelligence Review · doi:10.1007/s10462-012-9330-6 · Cited by 128
A Review on Quantum Computing: From Qubits to Front-end Electronics and Cryogenic MOSFET Physics
Jazaeri, F., Beckers, A., Tajalli, A., & Sallèse, J.-M. (2019) · International Conference Mixed Design of Integrated Circuits and Systems · doi:10.23919/mixdes.2019.8787164 · Cited by 130
A Case for Multi-Programming Quantum Computers
Das, P., Tannu, S., Nair, P. J., & Qureshi, M. K. (2019) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1145/3352460.3358287 · Cited by 144
Quantum algorithms and the Fourier transform
Jozsa, R. (1998) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.1998.0163 · Cited by 217
Quantum search of spatial regions
Aaronson, S., & Ambainis, A. (2004) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2003.1238194 · Cited by 156
Quantum computing: pro and con
Preskill, J. P. (1998) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.1998.0171 · Cited by 135
Quantum Information and Algorithms for Correlated Quantum Matter
Head-Marsden, K., Flick, J., Ciccarino, C. J., & Narang, P. (2020) · Chemical Reviews · doi:10.1021/acs.chemrev.0c00620 · Cited by 133
Quantum Wavelet Transforms: Fast Algorithms and Complete Circuits
Fijany, A., & Williams, C. P. (1999) · Lecture notes in computer science · doi:10.1007/3-540-49208-9_2 · Cited by 127
Magniez, F., Nayak, A., Roland, J., & Sántha, M. (2007) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1250790.1250874 · Cited by 129
Any AND-OR Formula of Size N can be Evaluated in time N^{1/2 + o(1)} on a Quantum Computer
Ambainis, A., Childs, A. M., Reichardt, B. W., Špalek, R., & Zhang, S. (2007) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2007.57 · Cited by 143
Noisy intermediate-scale quantum computers
Cheng, B., Deng, X., Gu, X. Q., He, Y., Hu, G., Huang, P., Li, J., Lin, B., Lu, D., Lu, Y., et al. (2023) · Frontiers of Physics · doi:10.1007/s11467-022-1249-z · Cited by 147
A New Lattice-Based Signature Scheme in Post-Quantum Blockchain Network
Li, C.-Y., Chen, X.-B., Chen, Y.-L., Hou, Y.-Y., & Li, J. (2019) · IEEE Access · doi:10.1109/access.2018.2886554 · Cited by 126
Training the quantum approximate optimization algorithm without access to a quantum processing unit
Streif, M., & Leib, M. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab8c2b · Cited by 125
Postprocessing of the Oblivious Key in Quantum Private Query
Gao, F., Liu, B., Huang, W., & Wen, Q. (2014) · IEEE Journal of Selected Topics in Quantum Electronics · doi:10.1109/jstqe.2014.2358192 · Cited by 125
The Complexity of Satisfiability of Small Depth Circuits
Calabro, C., Impagliazzo, R., & Paturi, R. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-11269-0_6 · Cited by 124
Quantum Genetic Algorithms for Computer Scientists
Lahoz-Beltrá, R. (2016) · Computers · doi:10.3390/computers5040024 · Cited by 125
Bounds for small-error and zero-error quantum algorithms
Buhrman, H., Cleve, R., de Wolf, R., & Zalka, C. (2003) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sffcs.1999.814607 · Cited by 154
Quantum reinforcement learning during human decision-making
Li, J., Dong, D., Wei, Z., Liu, Y., Pan, Y., Nori, F., & Zhang, X. (2020) · Nature Human Behaviour · doi:10.1038/s41562-019-0804-2 · Cited by 126
Privacy-Aware Blockchain Innovation for 6G: Challenges and Opportunities
Nguyen, T., Tran, N. H., Lovén, L., Partala, J., Kechadi, T., & Pirttikangas, S. (2020) · Joint European Conference on Networks and Communications & 6G Summit (EuCNC/6G Summit) · doi:10.1109/6gsummit49458.2020.9083832 · Cited by 127
Quantum Approximate Counting, Simplified
Aaronson, S., & Rall, P. (2019) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611976014.5 · Cited by 155
Reducing the Cost of Implementing AES as a Quantum Circuit
Langenberg, B., Pham, H., & Steinwandt, R. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.2965697 · Cited by 85
Cryptographic Group Actions and Applications
Alamati, N., Feo, L. D., Montgomery, H. W., & Patranabis, S. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-64834-3_14 · Cited by 139
Machine Learning Algorithms in Quantum Computing: A Survey
Ramezani, S. B., Sommers, A., Manchukonda, H. K., Rahimi, S., & Amirlatifi, A. (2020) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn48605.2020.9207714 · Cited by 137
Quantum lower bounds by quantum arguments
Ambainis, A. (2000) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/335305.335394 · Cited by 142
Quantum Walk on the LinePreprint
Ashwin, N., & Vishwanath, A. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0010117 · Cited by 200
The Python’s Lunch: geometric obstructions to decoding Hawking radiation
Brown, A. R., Gharibyan, H., Penington, G., & Susskind, L. (2020) · Journal of High Energy Physics · doi:10.1007/jhep08(2020)121 · Cited by 124
Equivalences and Separations Between Quantum and Classical Learnability
Servedio, R. A., & Gortler, S. J. (2004) · SIAM Journal on Computing · doi:10.1137/s0097539704412910 · Cited by 126
Quantum decision tree classifier
Lu, S., & Braunstein, S. L. (2013) · Quantum Information Processing · doi:10.1007/s11128-013-0687-5 · Cited by 125
Quantum Attacks Without Superposition Queries: The Offline Simon’s Algorithm
Bonnetain, X., Hosoyamada, A., Naya‐Plasencia, M., Sasaki, Y., & Schrottenloher, A. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-34578-5_20 · Cited by 130
Mitigating Multi-target Attacks in Hash-Based Signatures
Hülsing, A., Rijneveld, J., & Song, F. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-49384-7_15 · Cited by 130
Basic circuit compilation techniques for an ion-trap quantum machine
Maslov, D. A. (2017) · New Journal of Physics · doi:10.1088/1367-2630/aa5e47 · Cited by 122
Asymptotic improvements to quantum circuits via qutrits
Gokhale, P., Baker, J. M., Duckering, C., Brown, N. C., Brown, K. R., & Chong, F. T. (2019) · Proceedings of the 46th International Symposium on Computer Architecture · doi:10.1145/3307650.3322253 · Cited by 120
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
