The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index; none of the 8 sources its claims cite is checked for support yet.
A fast quantum mechanical algorithm for database search
Open accessAbstract
An unsorted database contains N records, of which just one satisfies a particular property.The problem is to identify that one record.Any classical algorithm, deterministic or probabilistic, will clearly take O (N) steps since on the average it will have to examine a large fraction of the N records.Quantum mechanical systems can do several operations simultaneously due to their wave like properties.This paper gives an O ( JN) step quantum mechanical algorithm for identifying that record.It is within a constant factor of the fastest possible quantum mechanical algorithm.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
19 No basis given · 8 Sources not found · 4 Own interpretation
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This paper gives an O ( JN) step quantum mechanical algorithm for identifying that record.”
§ A fast quantum mechanical algorithm for database search > Abstract
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- The authors state this as an assumption: There is a unique state that satisfies the condition C(S)=1.
- The authors state this as an assumption: For any state S, the condition C(S) can be evaluated in unit time.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Corollary 3.1-Let the state vector be as followsfor any one state the amplitude is k, for each of the remaining (N-1) states the amplitude is 1.Let k and 1 be real numbers (in general the amplitudes can be complex).Let k be negative and 1 be positive such that ~< ~N.Then after applying the diffusion transform both k and 1are positive numbers.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“First, it is proved that the system is a valid quantum mechanical system (theorems 1 & 2)”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
boosted- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“As mentioned in the introduction, the algorithm of this paper does not use any Imowledge about the problem.”
§ A fast quantum mechanical algorithm for database search > 114
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Theorem 1-The matix D is unitary.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The following sections prove that the system discussed in section 3 is indeed a valid quantum mechanical system and that it converges to the desired state with a probability O(l).”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- The authors state this as an assumption: There is a unique state that satisfies the condition C(S)=1.
- The authors state this as an assumption: For any state S, the condition C(S) can be evaluated in unit time.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Theorem 2 -D can be expressed as D = FRF, where F, the Fourier Transform Matrix and R, the rotation matrix are defined as follows”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Since the proba-& bility of the system being found in any particular state is proportional to the square of the amplitude, it follows that the probability of the system being in tlhe desired state when k is ~, 1 J2 is k2 = ~.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In case there is a unique state SV such that C(SV) = 1, the final state is SV with a probability of at least ~. 2”
§ A fast quantum mechanical algorithm for database search > T. Acknowledgments
plainconditional- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
- The authors state this as an assumption: There is a unique state that satisfies the condition C(S)=1.
- The authors state this as an assumption: For any state S, the condition C(S) can be evaluated in unit time.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“It can be easily modified to take care of the case when there are multiple states satisfying the condition C(S) = 1 and it is required to return one of these.”
§ A fast quantum mechanical algorithm for database search > 114
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Probably not a substantial claim. 8
- It may state two separate claims as one. 4
- The quote only partly states this claim. 1
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Theorem 5-Let the probability of a particular outcome in an experiment be &.Then if the experiment be repeated ~times, the probability that the outcome does not happen even once is less than or equal to e-K.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The change in k ( Ak) after steps (a) and (b) of the algorithm is lower bounded by Ak>~.Also after steps (a) and (b), 1>0.2fi”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Using this it immediately follows that there exists a number M less than EN, such that in M repetitions of the loop in step (ii), k wifl become ~.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The quote only partly states this claim.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The most efficient classical algorithm for this is to examine the items in the database one by one.”
§ A fast quantum mechanical algorithm for database search > ------------------------------------------------
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“Very recent results [Shor95] have shown the existence of quantum mechanical error corr~ting cod~which enable transmission of data even in the presence of noise”
§ A fast quantum mechanical algorithm for database search > 114
What the sources say
- Not matchedcites [Shor95]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
boosteddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This algorithm, by cleverly making use of some features of the structure of the problem, is the only known algorithm that solves the problem in O (logIV) steps.”
§ A fast quantum mechanical algorithm for database search > 114
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The phase does not have an analog in classical probabilistic algorithms.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This illustrates the point that, in quantum mechanics, the complete description of the system requires the amplitudes over all states, just the probabilities is not enough.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
In the paper
“For example Shor's primality testing algorithm [Shor94] for a number N can be viewed as a search of the (N-l) numbers smaller than N to see if any of them is a factor of N.”
§ A fast quantum mechanical algorithm for database search > 114
What the sources say
- Not matchedcites [Shor94]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
In the paper
“There is also a scheme discussed in [VV86] by which it is possible to modify any algorithm that solves an NPsearch problem with a unique solution and use it to solve an NP-search problem in general.”
§ A fast quantum mechanical algorithm for database search > 114
What the sources say
- Not matchedcites [VV86]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
hedgeddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
In the paper
“This operation is one of the things that makes quantum mechanical algorithms more powerful than classical algorithms and forms the basis for most significant quantum mechanical algorithms.”
§ A fast quantum mechanical algorithm for database search > T. Acknowledgments
What the sources say
- Not matchedcites [DJ92]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
- Not matched
The authors state this as an assumption.
There is a unique state that satisfies the condition C(S)=1.
“Let there be a unique state, say Sv, that satisfies the condition C(SV) = 1, whereas for all other states S, C(S) = 0”
“The algorithm as discussed here assumes a unique state that satisfies the desired condition.”
The authors state this as an assumption.
For any state S, the condition C(S) can be evaluated in unit time.
“(assume that for any state S, the condition C(S) can be evaluated in unit time)”
The paper relies on this without support.
There does not exist any sorting on the database that would aid selection of the desired item.
“However, there does not exist any sorting on the database that would aid its selection.”
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Symmetric cryptography remains comparatively resilient, yet Grover's algorithm offers a quadratic speed-up for brute-force key search, effectively halving the security margin of symmetric ciphers [13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Similarly, for hash functions, Grover's algorithm [185] can facilitate quantum birthday attack to find collision, thereby necessitating an output of larger size.”
From Zero Trust Architecture (ZTA): A Comprehensive Survey (2022) · cites this paper as [185]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Similarly, Grover’s algorithm concedes a quadratic advantage for mining blocks in certain consensus protocols such as proof of work.”
From Quantum-resistance in blockchain networks (2023) · cites this paper as [71]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Quantum computers will be able to find these nonces quadratically faster using Grover’s algorithm71.”
From Quantum-resistance in blockchain networks (2023) · cites this paper as [71]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“This model is realistic given the falling cost of storage, the rise of large-scale surveillance infrastructures, and the expected disruption of quantum algorithms such as Shor's and Grover's [1,2,13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measured
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Grover's algorithm provides only a quadratic speedup, effectively halving brute-force resistance. Comparable security margins can be restored by doubling key sizes (for example, AES-128 to AES-256) [13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“This explains why AES-256 maintains post-quantum security margins, whereas AES-128 requires upgrading to maintain equivalent protection levels [13,14].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“At the same time, Grover's algorithm shows that symmetric cryptography, though more resilient, also demands doubled key sizes to maintain equivalent margins [13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“In this sense, Grover-based optimization algorithms [184] such as Grover Adaptive Search [161] have been proposed.”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [184]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The former bound is tight since recent work of Grover [13] shows how to accept the class NP relative to any oracle on a quantum computer in time O (2 n/ 2 ).”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“In view of Grover's algorithm [13], we know that the constant '1 / 2' in the statement of Theorem 3.5 cannot be improved.”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The former bound is tight since recent work of Grover [13] shows how to accept the class NP relative to any oracle on a quantum computer in time O (2 n/ 2 ).”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“Grover’s algorithm [54] is a quantum algorithm for searching in a database, ofering quadratic speedup over classical searching methods.”
From QASMBench: A Low-Level Quantum Benchmark Suite for NISQ Evaluation and Simulation (2023) · cites this paper as [54]
The cited source says what the claim attributes to it.
In the citing paper
“However, quantum machines can recognize this language quadratically faster, in time O ( √ 2 n ), using Grover's algorithm [13].”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
The cited source says what the claim attributes to it.
In the citing paper
“That this was a real possibility is clear from Grover's [13] result, which gives a black-box approach to solving NP -complete problems in square-root as much time as is required classically.”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
The cited source says what the claim attributes to it.
In the citing paper
“Various strategies can be imagined, but a good one (called 'inversion about the average' by Grover [13]) is to perform an oracle-independent unitary transformation so as to change the phase difference into an amplitude difference, leaving the y term with the same sign as all the other terms but a magnitude approximately threefold larger.”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“The HNDL adversary departs from conventional cryptanalysis in its temporal asymmetry. Instead of attempting immediate decryption, the attacker passively collects encrypted traffic or stored archives and defers decryption until sufficient computational resources become available.”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredIn the citing paper
“This algorithm uses a single function evaluation to label the single state which satisfies the function, followed by a series of gates which drive the system into this particular state.”
From Implementation of a quantum search algorithm on a quantum computer (1998) · cites this paper as [9]
In the citing paper
“Here we show how such a computer can be used to implement a fast quantum search algorithm initially developed by Grover. 9, 10”
From Implementation of a quantum search algorithm on a quantum computer (1998) · cites this paper as [9]
In the citing paper
“Among other applications Grover's algorithms enable an extremely rapid search over the domain of a binary function to find elements for which this function is satisfied (that is, the function has the value 1).”
From Implementation of a quantum search algorithm on a quantum computer (1998) · cites this paper as [9]
In the citing paper
“the ability to efficiently perform Hamiltonian simulation is used in conjunction with another technique known as the quantum phase estimation algorithm (QPEA) 42 for efficiently obtaining the eigen-energies and eigenstates of a quantum system 38 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
In the citing paper
“The Quantum Phase Estimation (QPE) algorithm 38,99 is the natural translation of the FCI procedure to quantum computers 45 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
In the citing paper
“Abrams and Lloyd 38 focused on state preparation in more detail and described concrete initialization procedures.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
In the citing paper
“They pointed out that state preparation is conceptually easier in second quantization, where a Fock state is represented by a simple product state of qubits in {| 0 〉 , | 1 〉} states.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
Citations
Cites
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Scheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
Rapid solution of problems by quantum computation
Deutsch, D., & Jozsa, R. (1992) · Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences · doi:10.1098/rspa.1992.0167 · Cited by 2,700
The Emperor's New Mind: Concerning Computers, Minds, and The Laws of Physics
Penrose, R., & Gardner, M. (1989) · doi:10.1093/oso/9780198519737.001.0001 · Cited by 2,007
Strengths and Weaknesses of Quantum Computing
Bennett, C. H., Bernstein, E., Brassard, G., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300933 · Cited by 1,470
On the Power of Quantum Computation
Simon, D. R. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796298637 · Cited by 1,295
Bernstein, E., & Vazirani, U. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167097 · Cited by 1,284
Benioff, P. (1980) · Journal of Statistical Physics · doi:10.1007/bf01011339 · Cited by 1,244
The Emperor's New Mind: Concerning Computers, Minds, and the Laws of Physics
Penrose, R., & Landauer, R. (1990) · Physics Today · doi:10.1063/1.2810599 · Cited by 1,110
Research works printed but not linked: 2
- [9]9. R. Penrose, Shadows of the mind,. Oxford University Press, 1994, pp. 348- 388.
- [14]14. Yao93J A. Yao, Quantum circuit complexip, Proceedings 34th Annual Symposium on Foundations of Computer Science (FOCS), 1993, pp. 352-361.
Cited by
Sorted by citations
Items 3,601–3,700 of 8,792
Quantum Computing for Location DeterminationPreprint
Shokry, A., & Youssef, M. A. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.11751 · Cited by 18
The Acrobatics of BQPPreprint
Aaronson, S., Ingram, D., & Kretschmer, W. (2021) · arXiv (Cornell University) · doi:10.4230/lipics.ccc.2022.20 · Cited by 7
Wittek, P. (2014) · Elsevier eBooks · doi:10.1016/b978-0-12-800953-6.00001-3 · Cited by 7
Bernstein, D. J. (2024) · Springer eBooks · doi:10.1007/978-3-642-27739-9_386-2 · Cited by 7
Quantum Computing: A Concise Introduction
Lund, B. D., & Shahriar, S. (2025) · Encyclopedia · doi:10.3390/encyclopedia5040173 · Cited by 9
On recovering block cipher secret keys in the cold boot attack setting
Banegas, G., & Villanueva-Polanco, R. (2023) · Cryptography and Communications · doi:10.1007/s12095-022-00625-z · Cited by 8
Quantum Algorithm for Estimating Betti Numbers Using Cohomology Approach
Nghiem, N. A., Gu, X. D., & Wei, T.-C. (2025) · Quantum · doi:10.22331/q-2025-12-23-1955 · Cited by 6
Quantum algorithms for learning hidden strings with applications to matroid problems
Huang, X., Zhang, S., & Li, L. (2023) · Theoretical Computer Science · doi:10.1016/j.tcs.2023.114255 · Cited by 6
Quantum Path Parallelism: A Circuit-Based Approach to Text Searching
Faro, S., Pavone, A., & Viola, C. (2024) · Lecture notes in computer science · doi:10.1007/978-981-97-2340-9_21 · Cited by 6
Meta-optimization of resources on quantum computers
Mohammad, I. A., Pivoluska, M., & Plesch, M. (2024) · Scientific Reports · doi:10.1038/s41598-024-59618-y · Cited by 6
Towards High-performance Distributed Quantum Computing with Qubit Placement and Provisioning
Zhan, F., Zhao, Y., & Qiao, C. (2024) · IEEE/ACM International Symposium on Quality of Service (IWQoS) · doi:10.1109/iwqos61813.2024.10682847 · Cited by 6
Explainable Quantum Neural Networks: Example-Based and Feature-Based Methods
Tian, J., & Yang, W. (2024) · Electronics · doi:10.3390/electronics13204136 · Cited by 8
Quantum Annealing in Machine Learning: QBoost on D-Wave Quantum Annealer
Salloum, H., Salloum, A., Mazzara, M., & Zykov, S. V. (2024) · Procedia Computer Science · doi:10.1016/j.procs.2024.09.311 · Cited by 7
Quantum Benchmarking via Random Dynamical Quantum Maps
Volya, D., & Mishra, P. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00152 · Cited by 6
Study About the Performance of Ascon in Arduino Devices
Laborda, V. S., Hernández–Álvarez, L., Encinas, L. H., et al. (2025) · Applied Sciences · doi:10.3390/app15074071 · Cited by 6
Enhancing quantum support vector machines using multipartite entanglement
Ayachi, F. E., & Baz, M. E. (2025) · Physics Letters A · doi:10.1016/j.physleta.2025.130666 · Cited by 6
Allen, D. W. E., Berg, C., & Potts, J. (2025) · Cambridge University Press eBooks · doi:10.1017/9781009638616 · Cited by 3
IoT Security in the Quantum Era: State of the Art and Open Challenges
Diop, M., Ndiaye, P., Dione, D., & Diop, I. (2025) · International Conference on Innovative Research in Applied Science, Engineering and Technology (IRASET) · doi:10.1109/iraset64571.2025.11008105 · Cited by 7
Quantum graph learning and algorithms applied in quantum computer sciences and image classification
Shayeganfar, F., Ramazani, A., Sundararaghavan, V., & Duan, Y. (2025) · Applied Physics Reviews · doi:10.1063/5.0237599 · Cited by 6
Comprehensive Review of Metrics and Measurements of Quantum Systems
Soubra, H., Elsayed, H., Elbrolosy, Y., Adel, Y., & Attia, Z. (2025) · Metrics · doi:10.3390/metrics2020009 · Cited by 8
Quantum Circuit Construction and Optimization through Hybrid Evolutionary Algorithms
Sünkel, L., Altmann, P. J., Kölle, M., Stenzel, G., Gabor, T., & Linnhoff–Popien, C. (2025) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/3712256.3726392 · Cited by 8
Post-Quantum Key Exchange and Subscriber Identity Encryption in 5G Using ML-KEM (Kyber)
Khan, Q., Purification, S., & Chang, S. (2025) · Information · doi:10.3390/info16070617 · Cited by 6
Ashayer, S., Elhag, F., Sun, P., & Sartipi, M. (2025) · Transportation Research Record Journal of the Transportation Research Board · doi:10.1177/03611981251342248 · Cited by 7
Quantum-Resistant Security: PQC Readiness and Research Challenges (Invited)
Kundu, A., & Kompella, R. R. (2025) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac63849.2025.11132566 · Cited by 6
Zhang, B., Hong, J., Mao, G., Shen, S., Yang, H., Li, G., Lyu, S., Hung, P. S. Y., & Cheung, R. C. C. (2025) · Electronics · doi:10.3390/electronics14193908 · Cited by 9
Quantum network applications in 6G paradigm
Shukla, C., Rehman, J. U., & Chatzinotas, S. (2025) · AAPPS bulletin · doi:10.1007/s43673-025-00169-3 · Cited by 6
Task-Driven Device Fingerprinting for Quantum Cloud Platforms via Modeling QNN Outcomes Under Noise
Li, T., Zhao, Z., & Yin, J. (2025) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2025.3620985 · Cited by 6
Entropy computing, a paradigm for optimization in open photonic systems
Nguyen, L., Miri, M., Rupert, R. J., Dyk, W., Wu, S. B., Vrahoretis, N., Huang, I., Begliarbekov, M., Chancellor, N., Chukwu, U., et al. (2025) · Communications Physics · doi:10.1038/s42005-025-02324-6 · Cited by 17
Limitations of noisy quantum devices in computing and entangling power
Yan, Y., Du, Z., Chen, J., & Ma, X. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01136-4 · Cited by 17
General quantum Bernoulli factory: framework analysis and experiments
Liu, Y., Jiang, J., Zhu, P., Wang, D., Ding, J., Qiang, X., Huang, A., Xu, P., Zhang, J., Tian, G., et al. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/ac2061 · Cited by 6
Design and Analysis of Pattern Matching Algorithms Based on QuRAM Processing
Soni, K. K., & Malviya, A. K. (2021) · Arabian Journal for Science and Engineering · doi:10.1007/s13369-020-05310-y · Cited by 6
Nearly-frustration-free ground state preparation
Thibodeau, M., & Clark, B. K. (2023) · Quantum · doi:10.22331/q-2023-08-16-1084 · Cited by 6
Probability amplitude-encoded multichannel representation for quantum audio signals
Yan, F., Gao, S., Iliyasu, A. M., et al. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03435-7 · Cited by 6
Ternary logic design in topological quantum computing
Ilyas, M., Cui, S. X., & Perkowski, M. A. (2022) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ac7b55 · Cited by 9
Yetış, H., & Karaköse, M. (2022) · Traitement du signal · doi:10.18280/ts.390212 · Cited by 6
A Performance Comparison of Classical and Quantum Algorithm for Active User Detection
Habibie, M. I., Hamie, J., & Goursaud, C. (2022) · IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) · doi:10.1109/spawc51304.2022.9833942 · Cited by 6
Toward Next Generation Quantum-Safe eIDs and eMRTDs: A Survey
Alnahawi, N., Schmitt, N., Wiesmaier, A., & Zok, C.-M. (2023) · ACM Transactions on Embedded Computing Systems · doi:10.1145/3585517 · Cited by 8
Quantum Related-Key Attack Based on Simon’s Algorithm and Its Applications
Zhang, P. (2023) · Symmetry · doi:10.3390/sym15050972 · Cited by 6
Quantum Theory Approach to Performance Enhancement in Machine Learning
Adebiyi, M. O., Olaniyan, D., Osang, F. B., & Adebiyi, A. A. (2023) · International Conference on Science, Engineering and Business for Sustainable Development Goals (SEB-SDG) · doi:10.1109/seb-sdg57117.2023.10124582 · Cited by 6
Post-stroke Exercise Assessment using Hybrid Quantum Neural Network
Khan, M. A. A. H., Murikipudi, M., & Azmee, A. A. (2023) · IEEE Annual International Computer Software and Applications Conference (COMPSAC) · doi:10.1109/compsac57700.2023.00078 · Cited by 6
Decomposition Algorithm of an Arbitrary Pauli Exponential Through a Quantum Circuit
Mansky, M. B., Puigvert, V. R., Castillo, S. L., & Linnhoff–Popien, C. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00056 · Cited by 6
Elkabbany, G. F., Ahmed, H. I. S., Aslan, H. K., Cho, Y. I., & Abdallah, M. S. (2023) · Symmetry · doi:10.3390/sym16010012 · Cited by 6
Formal Analysis of Post-Quantum Hybrid Key Exchange SSH Transport Layer Protocol
Tran, D. D., Ogata, K., Escobar, S., et al. (2023) · IEEE Access · doi:10.1109/access.2023.3347914 · Cited by 6
Post-Quantum Secure Hybrid Methods for UE Primary Authentication in 6G with Forward Secrecy
Vuppala, R. C., Kumar, D., Je, D.-H., et al. (2023) · Globecom · doi:10.1109/globecom54140.2023.10437815 · Cited by 6
A Secure Quantum Proxy Group Signature Scheme Based on Three-qubit Entangled States
Lan, L., Lu, R., Zhong, J., et al. (2024) · International Journal of Theoretical Physics · doi:10.1007/s10773-024-05595-x · Cited by 6
A Review of Quantum Machine Learning for Image Classification
Li, Q., Huang, Z., Yang, H., & Song, M. (2023) · International Conference on Intelligent Management and Software Engineering (IMSE) · doi:10.1109/imse61332.2023.00021 · Cited by 7
Forward and Backward Constrained Bisimulations for Quantum Circuits
Jiménez-Pastor, A., Larsen, K. G., Tribastone, M., et al. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-57249-4_17 · Cited by 6
Calibration and Performance Evaluation of a Superconducting Quantum Processor in an HPC Center
Deng, X., Pogorzalek, S., Vigneau, F., Yang, P., Schulz, M., & Schulz, L. B. (2024) · ISC High Performance (ISC) · doi:10.23919/isc.2024.10528924 · Cited by 6
Quantum Speedup for Multiuser Detection With Optimized Parameters in Grover Adaptive Search
Norimoto, M., Mikuriya, T., & Ishikawa, N. (2024) · IEEE Access · doi:10.1109/access.2024.3413084 · Cited by 6
Benchmarking quantum versions of the kNN algorithm with a metric based on amplitude-encoded features
Guerrero-Estrada, A. Y., Quezada, L. F., & Sun, G.-H. (2024) · Scientific Reports · doi:10.1038/s41598-024-67392-0 · Cited by 7
Quantum Technologies for Space and Aerial Vehicles
Landers, V. S. (2024) · Space Law and Policy · doi:10.1007/978-3-031-62228-1_4 · Cited by 7
Quantum Differential Meet‐In‐The‐Middle Attack and Some Applications to Lightweight Ciphers
Xu, Y., Cai, B., Yuan, Z., Qin, S., Gao, F., & Wen, Q. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202400157 · Cited by 6
The Quantum Cyclic Rotation Gate
Pavone, A., & Viola, C. (2024) · SN Computer Science · doi:10.1007/s42979-024-03141-4 · Cited by 6
Automatic Test Pattern Generation for Robust Quantum Circuit Testing
Chen, K., & Ying, M. (2024) · ACM Transactions on Design Automation of Electronic Systems · doi:10.1145/3689333 · Cited by 7
PCQ: Parallel Compact Quantum Circuit Simulation
Liang, S., Lu, Y., Guo, C., Luk, W. W., & Kelly, P. H. J. (2024) · IEEE International Symposium on Field-Programmable Custom Computing Machines (FCCM) · doi:10.1109/fccm60383.2024.00013 · Cited by 6
Verifiable quantum homomorphic encryption based on garbled evaluation
He, R., Chen, L., Li, Q., Tan, X., & Lv, C. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad7a9c · Cited by 7
When are Quantum Algorithms Applicable for Signal Decoding in Wireless Communication?
Alsaui, A. A., Al-Nahhal, I., & Dobre, O. A. (2024) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2024.3461334 · Cited by 6
Correr, G. I., Medina, I., Azado, P. C., Drinko, A., & Soares-Pinto, D. O. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad80be · Cited by 11
Exploring the Versatility of QAOA: A Comprehensive Review
Kashapogu, R., Hasib, S., & Rasool, A. (2024) · International Conference on Computing, Communication and Networking Technologies (ICCCNT) · doi:10.1109/icccnt61001.2024.10725610 · Cited by 6
Quantum Combinatorial Optimization Algorithms for Network Reconfiguration: QRAO vs. QAOA
Ngo, A. P., & Nguyen, H. T. (2024) · North American Power Symposium (NAPS) · doi:10.1109/naps61145.2024.10741660 · Cited by 6
Quantum-Enhanced Strategies for Optimizing Disaster Response: A Machine Learning Approach
Karn, A. K., Sinha, P., Kaur, S., & Bansal, H. (2024) · Advances in Science, Technology & Innovation/Advances in science, technology & innovation · doi:10.1007/978-3-031-73350-5_12 · Cited by 6
A Survey on the Quantum Security of Block Cipher-Based Cryptography
Bootsma, S. E., & Vries, M. D. (2024) · IEEE Access · doi:10.1109/access.2024.3520364 · Cited by 6
Mjeda, A., & Murray, H. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.20460 · Cited by 6
Quantum Computer Fault Injection Attacks
Xu, C., Erata, F., & Szefer, J. M. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00047 · Cited by 7
Smith‐Miles, K. (2025) · Applied Mathematical Modelling · doi:10.1016/j.apm.2025.115965 · Cited by 8
Zylberman, J., Nzongani, U., Simonetto, A., & Debbasch, F. (2025) · ACM Transactions on Quantum Computing · doi:10.1145/3718348 · Cited by 18
Two-Step Quantum Search Algorithm for Solving Traveling Salesman Problems
Sato, R., Gordon, C., Saito, K., Kawashima, H., Nikuni, T., & Watabe, S. (2025) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2025.3548706 · Cited by 6
IPSeQ: A Security-Enhanced IPSec Protocol Integrated with Quantum Key Distribution
Gao, X., Xue, K., Li, J., et al. (2025) · IEEE Communications Magazine · doi:10.1109/mcom.004.2400475 · Cited by 6
Khan, M. A., Aman, M. N., & Sikdar, B. (2025) · IEEE Internet of Things Journal · doi:10.1109/jiot.2025.3551679 · Cited by 7
FQsun: A Configurable Wave Function-Based Quantum Emulator for Power-Efficient Quantum Simulations
Hai, V. T., Le, V. T. D., Pham, H. L., et al. (2025) · IEEE Access · doi:10.1109/access.2025.3573313 · Cited by 6
Quantum smoothed particle hydrodynamics algorithm inspired by quantum walks
Au-Yeung, R., Kendon, V. M., & Lind, S. (2025) · Physics of Fluids · doi:10.1063/5.0268240 · Cited by 9
QF2PM: Quantum-Secure Fine-Grained Privacy-Preserving Profile Matching for Mobile Social Networks
Huang, X., Zhang, W., Wang, X., Zhang, S., & Khan, M. K. (2025) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2025.3619531 · Cited by 7
Rational approximations and quantum algorithms with postselection
Mahadev, U., & de Wolf, R. (2015) · Quantum Information and Computation · doi:10.26421/qic15.3-4-5 · Cited by 8
Variational calculation of muonium hydride
Zhou, B.-L., Zhu, J.-M., & Yan, Z.-C. (2005) · Journal of Physics B Atomic Molecular and Optical Physics · doi:10.1088/0953-4075/38/3/014 · Cited by 6
Formal Analysis of Quantum Systems using Process Calculus
Davidson, T. A. S., Gay, S. J., & Nagarajan, R. (2011) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.59.9 · Cited by 6
A Novel Quantum-Inspired Genetic Algorithm with Expanded Solution Space
Liao, R., Wang, X., & Qin, Z. (2010) · International Conference on Intelligent Human-Machine Systems and Cybernetics · doi:10.1109/ihmsc.2010.148 · Cited by 6
Classification of patterns representing Apples and Oranges in three-qubit system
Singh, M. P., Radhey, K., Saraswat, V. K., et al. (2016) · Quantum Information Processing · doi:10.1007/s11128-016-1472-z · Cited by 6
XOR of PRPs in a Quantum World
Mennink, B., & Szepieniec, A. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_21 · Cited by 7
Practical quantum appointment scheduling
Touchette, D., Lovitz, B., & Lütkenhaus, N. (2018) · Physical Review A · doi:10.1103/physreva.97.042320 · Cited by 6
Quantum algorithm for the root-finding problem
Nagata, K., & Nakamura, T. (2018) · Quantum Studies Mathematics and Foundations · doi:10.1007/s40509-018-0171-0 · Cited by 7
A GENERALIZED MODEL OF FREDHOLM'S CRYPTOSYSTEM
Hryshchuk, R., & Hryshchuk, O. M. (2019) · Cybersecurity Education Science Technique · doi:10.28925/2663-4023.2019.4.1423 · Cited by 6
Quantum-Inspired Evolutionary Algorithms for Covering Arrays of Arbitrary Strength
Wagner, M., Kampel, L., & Simos, D. E. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-34029-2_20 · Cited by 6
Lockhart, J., & Simone Severini, B. (2021) · Linear Algebra and its Applications · doi:10.1016/j.laa.2021.02.014 · Cited by 6
Improved quantum algorithm for MMSE-based massive MIMO uplink detection
Meng, F., Yu, X., & Zhang, Z. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02768-5 · Cited by 6
Quantum One-class Classification With a Distance-based Classifier
de Oliveira, N. M., de Albuquerque, L. P., de Oliveira, W. R., Ludermir, T. B., & da Silva, A. J. (2021) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn52387.2021.9533441 · Cited by 6
Unstructured search by random and quantum walk
Wong, T. G. (2021) · Quantum Information and Computation · doi:10.26421/qic22.1-2-4 · Cited by 10
Special Session: Quantum Error Correction in Near Term Systems
Majumdar, R., & Sur‐Kolay, S. (2020) · Proceedings, IEEE International Conference on Computer Design/Proceedings - IEEE International Conference on Computer Design · doi:10.1109/iccd50377.2020.00015 · Cited by 6
Nahed, M., & Alawneh, S. G. (2020) · American Journal of Electrical and Computer Engineering · doi:10.11648/j.ajece.20200402.17 · Cited by 6
A Strategy Roadmap for Post-quantum Cryptography
Pandeya, G. R., Daim, T. U., & Marotzke, A. (2021) · Applied innovation and technology management · doi:10.1007/978-3-030-50502-8_4 · Cited by 7
A Secure Quantum Voting Scheme Based on Orthogonal Product States
Du, G., Zhou, B.-M., Ma, C., et al. (2021) · International Journal of Theoretical Physics · doi:10.1007/s10773-021-04763-7 · Cited by 6
Empirical evaluation of circuit approximations on noisy quantum devices
Wilson, E., Mueller, F., Oftelie, L. B., & Iancu, C. (2021) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1145/3458817.3476189 · Cited by 13
A Non-heuristic Approach to Time-Space Tradeoffs and Optimizations for BKW
Liu, H., & Yu, Y. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-22969-5_25 · Cited by 6
Periodicity of Grover walks on bipartite regular graphs with at most five distinct eigenvalues
Kubota, S. (2022) · Linear Algebra and its Applications · doi:10.1016/j.laa.2022.08.030 · Cited by 7
Computational Creativity and Aesthetics with Algorithmic Information Theory
Mondol, T., & Brown, D. G. (2021) · Entropy · doi:10.3390/e23121654 · Cited by 6
Quantum algorithm for the shortest superstring problem
Khadiev, K. R., & Machado, C. M. B. (2022) · International Conference on Micro- and Nano-Electronics (ICMNE) · doi:10.1117/12.2624618 · Cited by 6
Quantum matching pursuit: A quantum algorithm for sparse representations
Bellante, A., & Zanero, S. (2022) · Physical Review A · doi:10.1103/physreva.105.022414 · Cited by 6
High-dimensional Grover multi-target search algorithm on Cirq
Acar, E., Gündüz, S., Akpınar, G., et al. (2022) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-022-02460-w · Cited by 6
Towards Higher-Level Abstractions for Quantum Computing
Cobb, A., Schneider, J.-G., & Lee, K. (2022) · Australasian Computer Science Week Multiconference (ACSW) · doi:10.1145/3511616.3513106 · Cited by 6
Scaling up and down of 3-D floating-point data in quantum computation
Xu, M., Lu, D., & Sun, X. (2022) · Scientific Reports · doi:10.1038/s41598-022-06756-w · Cited by 6
Lattice surgery-based Surface Code architecture using remote logical CNOT operation
Lee, J., Kang, Y., Ha, J., & Heo, J. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03556-z · Cited by 6
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
