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 801–900 of 8,792
Supervised Quantum Learning without Measurements
Álvarez Rodríguez, U., Lamata Manuel, L., Escandell Montero, P., Martín‐Guerrero, J. D., & Solano Villanueva, E. L. (2017) · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) · Cited by 54
Arithmetic on a Distributed-Memory Quantum Multicomputer
Van Meter, R., Munro, W. J., Nemoto, K., & Itoh, K. M. (2006) · CERN Document Server (European Organization for Nuclear Research) · Cited by 58
Communication Capacity of Quantum Computation
Bose, S., Rallan, L., & Vedral, V. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.5448 · Cited by 50
Lower Bounds on Quantum Query ComplexityPreprint
Høyer, P., & Špalek, R. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0509153 · Cited by 62
A quantum walk-assisted approximate algorithm for bounded NP optimisation problems
Marsh, S., & Wang, J. B. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2171-3 · Cited by 50
A verifiable (k, n)-threshold dynamic quantum secret sharing scheme
Li, F., Hu, H., Zhu, S., Yan, J., & Ding, J. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03617-3 · Cited by 50
Quantum Machine Learning for Next-G Wireless Communications: Fundamentals and the Path Ahead
Narottama, B., Mohamed, Z., & Aı̈ssa, S. (2023) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2023.3309268 · Cited by 59
Garms, L., Paraïso, T. K., Hanley, N., Khalid, A., Rafferty, C., Grant, J., Newman, J., Shields, A. J., Cid, C., & O'Neill, M. P. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202300304 · Cited by 57
Quantum mapping algorithm for structural non-probabilistic reliability optimization
Xu, Y., Wang, X., & Wang, Z. (2025) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-025-04085-w · Cited by 53
Trading off circuit lines and gate costs in the synthesis of reversible logic
Wille, R., Soeken, M., Miller, D. M., & Drechsler, R. (2013) · Integration · doi:10.1016/j.vlsi.2013.08.002 · Cited by 51
Symmetry-Assisted Adversaries for Quantum State Generation
Ambainis, A., Magnin, L., Roetteler, M., & Roland, J. (2011) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.2011.24 · Cited by 66
Zhang, L., Sun, H.-W., Zhang, K., & Jia, H.-Y. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1531-0 · Cited by 50
Enhancing Breeder Document Long-Term Security Using Blockchain Technology
Buchmann, N., Rathgeb, C., Baier, H., Busch, C., & Margraf, M. (2017) · IEEE Annual International Computer Software and Applications Conference (COMPSAC) · doi:10.1109/compsac.2017.119 · Cited by 49
An improved flexible representation of quantum images
Khan, R. A. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2306-6 · Cited by 52
Quantum Money from Hidden Subspaces
Aaronson, S., & Christiano, P. F. (2012) · doi:10.48550/arxiv.1203.4740 · Cited by 74
Round5: Compact and Fast Post-quantum Public-Key Encryption
Baan, H., Bhattacharya, S., Fluhrer, S. R., García-Morchón, Ó., Laarhoven, T., Rietman, R., Saarinen, M.-J. O., Tolhuizen, L. M. G. M., & Zhang, Z. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-25510-7_5 · Cited by 50
Quantum SDP-Solvers: Better Upper and Lower Bounds
van Apeldoorn, J., Gilyén, A., Gribling, S., & de Wolf, R. (2017) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2017.44 · Cited by 55
Realising and compressing quantum circuits with quantum reservoir computing
Ghosh, S., Krisnanda, T., Paterek, T., & Liew, T. C. H. (2021) · Communications Physics · doi:10.1038/s42005-021-00606-3 · Cited by 68
Robust Polynomials and Quantum Algorithms
Buhrman, H., Newman, I., Röhrig, H., & de Wolf, R. (2007) · Theory of Computing Systems · doi:10.1007/s00224-006-1313-z · Cited by 65
Determining the equivalence for one-way quantum finite automata
Li, L., & Qiu, D. (2008) · Theoretical Computer Science · doi:10.1016/j.tcs.2008.03.021 · Cited by 50
Graph matching using the interference of continuous-time quantum walks
Emms, D., Wilson, R. C., & Hancock, E. R. (2008) · Pattern Recognition · doi:10.1016/j.patcog.2008.09.001 · Cited by 50
Transformation rules for designing CNOT-based quantum circuits
Iwama, K., Kambayashi, Y., & Yamashita, S. (2002) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac.2002.1012662 · Cited by 50
Constructions and performance of classes of quantum LDPC codesPreprint
Camara, T., Ollivier, H., & Tillich, J. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0502086 · Cited by 60
ECRYPT yearly report on algorithms and keysizes
Babbage, S., Catalano, D., Cid, C., de Weger, B., Dunkelman, O., Gehrmann, C., Granboulan, L., Lange, T., Lenstra, A. K., Mitchell, C. J., et al. (2009) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 50
The Performance of Post-Quantum TLS 1.3
Sosnowski, M., Wiedner, F., Hauser, E., Steger, L., Schoinianakis, D., Gallenmüller, S., & Carle, G. (2023) · Companion of the 19th International Conference on emerging Networking EXperiments and Technologies · doi:10.1145/3624354.3630585 · Cited by 49
Meyer, J. C., Passante, G., Pollock, S. J., & Wilcox, B. R. (2022) · Physical Review Physics Education Research · doi:10.1103/physrevphyseducres.18.010150 · Cited by 50
Quantum clustering with k-Means: A hybrid approach
Poggiali, A., Berti, A., Bernasconi, A., Corso, G. M. D., & Guidotti, R. (2024) · Theoretical Computer Science · doi:10.1016/j.tcs.2024.114466 · Cited by 75
Basso, A., Dartois, P., Feo, L. D., Leroux, A., Maino, L., Pope, G., Robert, D., & Wesolowski, B. (2024) · Lecture notes in computer science · doi:10.1007/978-981-96-0891-1_11 · Cited by 51
Efficient synthesis of quantum circuits implementing clifford group operations
Niemann, P., Wille, R., & Drechsler, R. (2014) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1109/aspdac.2014.6742938 · Cited by 48
Classical and superposed learning for quantum weightless neural networks
da Silva, A. J., de Oliveira, W. R., & Ludermir, T. B. (2011) · Neurocomputing · doi:10.1016/j.neucom.2011.03.055 · Cited by 48
T-Count Optimization and Reed–Muller Codes
Amy, M., & Mosca, M. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2906374 · Cited by 49
Quantum image edge extraction based on Laplacian operator and zero-cross method
Fan, P., Zhou, R., Hu, W., & Jing, N. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-2129-x · Cited by 51
Benefits and Challenges of Designing Cryogenic CMOS RF Circuits for Quantum Computers
Mehrpoo, M., Patra, B., Gong, J., van Dijk, J. P. G., Homulle, H., Kiene, G., Vladimirescu, A., Sebastiano, F., Edoardo Charbon, A., & Babaie, M. (2019) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas.2019.8702452 · Cited by 49
An adaptive quantum-inspired differential evolution algorithm for 0
Hota, A. R., & Pat, A. (2010) · World Congress on Nature and Biologically Inspired Computing (NaBIC) · doi:10.1109/nabic.2010.5716320 · Cited by 49
Determining the proton content with a quantum computer
Pérez-Salinas, A., Cruz-Martinez, J. M., Alhajri, A., & Carrazza, S. (2021) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.103.034027 · Cited by 51
Automata theory based on quantum logic: Reversibilities and pushdown automata
Qiu, D. (2007) · Theoretical Computer Science · doi:10.1016/j.tcs.2007.05.026 · Cited by 49
Beyond bits: the future of quantum information processing
Steane, A. M., & Rieffel, E. G. (2000) · Computer · doi:10.1109/2.816267 · Cited by 49
A Survey of Quantum Property TestingPreprint
Montanaro, A., & de Wolf, R. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1310.2035 · Cited by 49
Identifying Research Challenges in Post Quantum Cryptography Migration and Cryptographic AgilityPreprint
Ott, D. E., Peikert, C., & participants, O. W. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.07353 · Cited by 122
Botsinis, P., Alanis, D., Babar, Z., Ng, S. X., & Hanzo, L. (2015) · IEEE Transactions on Communications · doi:10.1109/tcomm.2015.2458857 · Cited by 48
Block-based quantum-logic synthesis
Saeedi, M., Arabzadeh, M., Zamani, M. S., & Sedighi, M. (2011) · Quantum Information and Computation · doi:10.26421/qic11.3-4-6 · Cited by 51
Implementing bilinear interpolation with quantum images
Yan, F., Zhao, S.-S., Venegas-Andraca, S. E., & Hirota, K. (2021) · Digital Signal Processing · doi:10.1016/j.dsp.2021.103149 · Cited by 48
Quantum advantage and noise reduction in distributed quantum computing
Avron, J. E., Casper, O., & Rozen, I. (2021) · Physical Review A · doi:10.1103/physreva.104.052404 · Cited by 49
HPKA: A High-Performance CRYSTALS-Kyber Accelerator Exploring Efficient Pipelining
Ni, Z., Khalid, A., Kundi, D., O'Neill, M. P., & Liu, W. (2023) · IEEE Transactions on Computers · doi:10.1109/tc.2023.3296899 · Cited by 59
A survey on cryptographic methods to secure communications for UAV traffic management
Aissaoui, R., Deneuville, J.-C., Guerber, C., et al. (2023) · Vehicular Communications · doi:10.1016/j.vehcom.2023.100661 · Cited by 48
Stabilizer entropy dynamics after a quantum quench
Rattacaso, D., Leone, L., Oliviero, S. F. E., & Hamma, A. (2023) · Physical Review A · doi:10.1103/physreva.108.042407 · Cited by 67
Lightweight block ciphers for resource-constrained environments: A comprehensive survey
Zhong, Y. Q., & Gu, J. (2024) · Future Generation Computer Systems · doi:10.1016/j.future.2024.03.054 · Cited by 60
Image processing using quantum computing
Caraiman, S., & Manta, V. (2012) · International Conference on System Theory, Control and Computing (ICSTCC) · Cited by 47
Kermani, M. M., Azarderakhsh, R., & Aghaie, A. (2016) · ACM Transactions on Embedded Computing Systems · doi:10.1145/2930664 · Cited by 49
Supervised Quantum Learning without Measurements
Alvarez-Rodriguez, U., Lamata, L., Escandell-Montero, P., Martín‐Guerrero, J. D., & Solano, E. (2017) · Scientific Reports · doi:10.1038/s41598-017-13378-0 · Cited by 66
Generator of an abstract quantum walk
Segawa, E., & Suzuki, A. (2016) · Quantum Studies Mathematics and Foundations · doi:10.1007/s40509-016-0070-1 · Cited by 47
A Note on the Switching Adiabatic Theorem
Elgart, A., & Hagedorn, G. A. (2012) · Cited by 48
Deep neural networks for quantum circuit mapping
Acampora, G., & Schiattarella, R. (2021) · Neural Computing and Applications · doi:10.1007/s00521-021-06009-3 · Cited by 56
Is partial quantum search of a database any easier?
Grover, L. K., & Radhakrishnan, J. (2005) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/1073970.1073997 · Cited by 47
Self-citationAn optical model of computation
Woods, D., & Naughton, T. J. (2004) · Theoretical Computer Science · doi:10.1016/j.tcs.2004.07.001 · Cited by 48
Quantum computation: Algorithms and Applications
Cho, C., Chen, C.-Y., Chen, K.-C., Huang, T., Hsu, M.-C., Cao, N., Zeng, B., Tan, S.-G., & Chang, C. (2021) · Chinese Journal of Physics · doi:10.1016/j.cjph.2021.05.001 · Cited by 54
Ready to Leap (by Co-Design)? Join Order Optimisation on Quantum Hardware
Schönberger, M., Scherzinger, S., & Mauerer, W. (2023) · Proceedings of the ACM on Management of Data · doi:10.1145/3588946 · Cited by 49
Quantum image pseudocolor coding based on the density-stratified method
Jiang, N., Wu, W.-Y., Wang, L., & Zhao, N. (2015) · Quantum Information Processing · doi:10.1007/s11128-015-0986-0 · Cited by 48
Lanzagorta, M. O., & Uhlmann, J. K. (2008) · Synthesis lectures on quantum computing · doi:10.2200/s00159ed1v01y200810qmc002 · Cited by 87
Verified Compilation of Space-Efficient Reversible Circuits
Amy, M., Roetteler, M., & Svore, K. M. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-63390-9_1 · Cited by 46
A Hybrid Lattice Basis Reduction and Quantum Search Attack on LWE
Göpfert, F., van Vredendaal, C., & Wunderer, T. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_11 · Cited by 47
A New Public-Key Cryptosystem via Mersenne Numbers
Aggarwal, D., Joux, A., Prakash, A., & Sántha, M. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-96878-0_16 · Cited by 47
Musanna, F., & Kumar, S. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02724-3 · Cited by 47
Introduction to Quantum Computing
Marella, S. T., & Parisa, H. S. K. (2020) · IntechOpen eBooks · doi:10.5772/intechopen.94103 · Cited by 50
Analysis of absorbing times of quantum walks
Yamasaki, T., Kobayashi, H., & Imai, H. (2003) · Physical Review A · doi:10.1103/physreva.68.012302 · Cited by 48
Quantum convolution and quantum correlation algorithms are physically impossiblePreprint
Lomont, C. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0309070 · Cited by 54
Quantum Algorithms for Linear Algebra and Machine Learning.
Prakash, A. (2014) · eScholarship (California Digital Library) · Cited by 51
Quantum-Assisted Routing Optimization for Self-Organizing Networks
ALANIS, D., BOTSINIS, P., NG, S. X., & HANZO, L. (2014) · IEEE Access · doi:10.1109/access.2014.2327596 · Cited by 46
Dalyac, C., Henriet, L., Jeandel, E., Lechner, W., Perdrix, S., Porcheron, M., & Veshchezerova, M. (2021) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-021-00100-3 · Cited by 46
Code-based public-key cryptosystems for the post-quantum period
Kuznetsov, A. A., Svatovskij, I., Kiyan, N., & Pushkar’ov, A. (2017) · International Scientific-Practical Conference Problems of Infocommunications Science and Technology · doi:10.1109/infocommst.2017.8246365 · Cited by 46
Equivalence Checking of Quantum Circuits With the ZX-Calculus
Peham, T., Burgholzer, L., & Wille, R. (2022) · IEEE Journal on Emerging and Selected Topics in Circuits and Systems · doi:10.1109/jetcas.2022.3202204 · Cited by 65
Metamorphic testing of oracle quantum programs
Abreu, R., Fernandes, J. P., Llana, L., & Tavares, G. (2022) · doi:10.1145/3528230.3529189 · Cited by 46
Vasques, X., Paik, H., & Cif, L. (2023) · Scientific Reports · doi:10.1038/s41598-023-38558-z · Cited by 51
Securing IoT systems in a post-quantum environment: Vulnerabilities, attacks, and possible solutions
Alomari, A., & Kumar, S. (2024) · Internet of Things · doi:10.1016/j.iot.2024.101132 · Cited by 51
Quantum Key Agreement Against Collective Decoherence
Huang, W., Su, Q., Wu, X., Li, Y., & Sun, Y. (2014) · International Journal of Theoretical Physics · doi:10.1007/s10773-014-2087-8 · Cited by 46
Assessing the similarity of quantum images based on probability measurements
Yan, F., Le, P. Q., Iliyasu, A. M., Sun, B., Garcia, J. A. S., Dong, F., & Hirota, K. (2012) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2012.6256418 · Cited by 44
Long-range coupling and scalable architecture for superconducting flux qubits
Fowler, A. G., Thompson, W. F., Yan, Z., Stephens, A. M., Plourde, B. L. T., & Wilhelm, F. K. (2007) · Physical Review B · doi:10.1103/physrevb.76.174507 · Cited by 46
Noise-based logic hyperspace with the superposition of states in a single wire
Kish, L. B., Khatri, S. P., & Sethuraman, S. (2009) · Physics Letters A · doi:10.1016/j.physleta.2009.03.059 · Cited by 47
Novel classical post-processing for quantum key distribution-based quantum private query
Yang, Y., Liu, Z., Chen, X., Cao, W., Zhou, Y., & Shi, W. (2016) · Quantum Information Processing · doi:10.1007/s11128-016-1367-z · Cited by 46
Quantum-Fourier-transform-based quantum arithmetic with qudits
Pavlidis, A., & Floratos, E. G. (2021) · Physical Review A · doi:10.1103/physreva.103.032417 · Cited by 47
Quantum Circuit Optimization by Changing the Gate Order for 2D Nearest Neighbor Architectures
Hattori, W., & Yamashita, S. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-99498-7_16 · Cited by 46
The multi-level and multi-dimensional quantum wavelet packet transforms
Li, H.-S., Fan, P., Xia, H., Song, S., & He, X. (2018) · Scientific Reports · doi:10.1038/s41598-018-32348-8 · Cited by 46
Quantum unary approach to option pricing
Ramos-Calderer, S., Pérez-Salinas, A., García-Martín, D., Bravo-Prieto, C., Cortada, J., Planagumà, J., & Latorre, J. I. (2021) · Physical Review A · doi:10.1103/physreva.103.032414 · Cited by 58
Semantic Security and Indistinguishability in the Quantum World
Gagliardoni, T., Hülsing, A., & Schaffner, C. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-53015-3_3 · Cited by 62
Multilevel 2-D Quantum Wavelet Transforms
Li, H.-S., Fan, P., Peng, H., Song, S., & Long, G. (2021) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2021.3049509 · Cited by 46
Intelligent Computing Everywhere
Schuster, A. (2007) · Springer eBooks · doi:10.1007/978-1-84628-943-9_1 · Cited by 46
Exact analytical results for quantum walks on star graphs
Xu, X. P. (2009) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/42/11/115205 · Cited by 49
Reversible simulation of irreversible computation
Li, M., Tromp, J., & Vitanyi, P. M. B. (1998) · Physica D Nonlinear Phenomena · doi:10.1016/s0167-2789(98)00052-9 · Cited by 46
General-purpose parallel simulator for quantum computing
Niwa, J., Matsumoto, K., & Imai, H. (2002) · Physical Review A · doi:10.1103/physreva.66.062317 · Cited by 45
Quantum Hoare Logic with Classical Variables
Feng, Y., & Ying, M. (2021) · ACM Transactions on Quantum Computing · doi:10.1145/3456877 · Cited by 63
Configurable sublinear circuits for quantum state preparation
Araujo, I. F., Park, D. K., Ludermir, T. B., de Oliveira, W. R., Petruccione, F., & da Silva, A. J. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03869-7 · Cited by 55
Formal Verification of Quantum Programs: Theory, Tools, and Challenges
Lewis, M., Soudjani, S., & Zuliani, P. (2023) · ACM Transactions on Quantum Computing · doi:10.1145/3624483 · Cited by 65
On the Implementation of Fuzzy Inference Engines on Quantum Computers
Acampora, G., Schiattarella, R., & Vitiello, A. (2022) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2022.3202348 · Cited by 47
Performance Evaluation of Post-Quantum TLS 1.3 on Resource-Constrained Embedded Systems
Tasopoulos, G., Li, J., Fournaris, A. P., Zhao, R. K., Sakzad, A., & Steinfeld, R. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-21280-2_24 · Cited by 51
Stereoscopic scalable quantum convolutional neural networks
Baek, H., Yun, W. J., Park, S., & Kim, J. (2023) · Neural Networks · doi:10.1016/j.neunet.2023.06.027 · Cited by 47
EQNAS: Evolutionary Quantum Neural Architecture Search for Image Classification
Li, Y., Liu, R., Hao, X., Shang, R., Zhao, P., & Jiao, L. (2023) · Neural Networks · doi:10.1016/j.neunet.2023.09.040 · Cited by 45
Akter, M. S., Rodriguez-Cardenas, J., Shahriar, H., Cuzzocrea, A., & Wu, F. (2023) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata59044.2023.10386889 · Cited by 46
Quantum Finance: Exploring the Implications of Quantum Computing on Financial Models
Zhou, J. (2025) · Computational Economics · doi:10.1007/s10614-025-10894-4 · Cited by 56
An introduction to quantum annealing
de Falco, D., & Tamascelli, D. (2011) · RAIRO - Theoretical Informatics and Applications · doi:10.1051/ita/2011013 · Cited by 52
Jogenfors, J. (2019) · IEEE International Conference on Blockchain and Cryptocurrency (ICBC) · doi:10.1109/bloc.2019.8751473 · Cited by 47
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
