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 1,401–1,500 of 8,792
Quantum Genetic Algorithm With Individuals in Multiple Registers
Ibarrondo, R., Gatti, G., & Sanz, M. (2023) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2023.3296780 · Cited by 27
Key Management Systems for Large-Scale Quantum Key Distribution Networks
James, P., Laschet, S., Ramacher, S., & Torresetti, L. (2023) · International Conference on Availability, Reliability and Security (ARES) · doi:10.1145/3600160.3605050 · Cited by 28
Quantum gate algorithm for reference-guided DNA sequence alignment
Varsamis, G. D., Karafyllidis, I. G., Gilkes, K. M., Arranz, U., Martin-Cuevas, R., Calleja, G., Dimitrakis, P., Kolovos, P., Sandaltzopoulos, R., Jessen, H. C., et al. (2023) · Computational Biology and Chemistry · doi:10.1016/j.compbiolchem.2023.107959 · Cited by 29
Quantum kernel estimation-based quantum support vector regression
Zhou, X., Yu, J., Tan, J., & Jiang, T. (2024) · Quantum Information Processing · doi:10.1007/s11128-023-04231-7 · Cited by 30
Quantum Computing for Cybersecurity
Alauthman, M., Almomani, A., Al–Qerem, A., Khaldy, M. A. A., Aldweesh, A. Y., Maqousi, A. Y. A., & Alkasassbeh, M. S. (2024) · Advances in information security, privacy, and ethics book series · doi:10.4018/979-8-3693-5330-1.ch004 · Cited by 28
An Applied Analysis of Securing 5G/6G Core Networks with Post-Quantum Key Encapsulation Methods
Scalise, P., Garcia, R., Boeding, M., et al. (2024) · Electronics · doi:10.3390/electronics13214258 · Cited by 27
Non-Markovian dynamics of a superconducting qubit in a phononic bandgap
Odeh, M., Godeneli, K., Li, E., Tangirala, R., Zhou, H., Zhang, X., Zhang, Z.-H., & Sipahigil, A. (2025) · Nature Physics · doi:10.1038/s41567-024-02740-5 · Cited by 38
A Survey of Post-Quantum Cryptography Migration in Vehicles
Lohmiller, N., Kaniewski, S., Menth, M., & Heer, T. (2025) · IEEE Access · doi:10.1109/access.2025.3528562 · Cited by 36
Quantum advantage without entanglement
Kenigsberg, D., Mor, A., & Ratsaby, G. (2006) · Quantum Information and Computation · doi:10.26421/qic6.7-4 · Cited by 27
Accuracy and Compactness in Decision Diagrams for Quantum Computation
Zulehner, A., Niemann, P., Drechsler, R., & Wille, R. (2019) · Design, Automation, and Test in Europe · doi:10.23919/date.2019.8715040 · Cited by 27
Bonny, T., & Ul-Haq, A. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02683-9 · Cited by 27
Improved Classical Cryptanalysis of SIKE in Practice
Costello, C., Longa, P., Naehrig, M., Renes, J., & Virdia, F. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-45388-6_18 · Cited by 27
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems
Gall, F. L., & Seddighin, S. (2022) · Algorithmica · doi:10.1007/s00453-022-01066-z · Cited by 27
Quantum Multiparty Privacy Set Intersection Cardinality
Shi, R. (2020) · IEEE Transactions on Circuits & Systems II Express Briefs · doi:10.1109/tcsii.2020.3032550 · Cited by 27
Lanczos recursion on a quantum computer for the Green's function and ground state
Baker, T. E. (2021) · Physical Review A · doi:10.1103/physreva.103.032404 · Cited by 33
Threshold-Based Quantum Optimization
Golden, J. K., Bärtschi, A., O’Malley, D., & Eidenbenz, S. (2021) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce52317.2021.00030 · Cited by 33
SpinQ Gemini: a desktop quantum computing platform for education and research
Hou, S., Feng, G., Wu, Z., Zou, H., Shi, W., Zeng, J., Cao, C., Yü, S., Sheng, Z., Rao, X., et al. (2021) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-021-00109-8 · Cited by 38
Quantum implementation and resource estimates for Rectangle and Knot
Baksi, A., Jang, K., Song, G., Seo, H., & Xiang, Z.-J. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03307-6 · Cited by 26
Open Problems Related to Quantum Query Complexity
Aaronson, S. (2021) · ACM Transactions on Quantum Computing · doi:10.1145/3488559 · Cited by 51
An Efficient Full Hardware Implementation of Extended Merkle Signature Scheme
Cao, Y., Wu, Y., Wang, W., et al. (2021) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2021.3115786 · Cited by 27
A brief introduction to quantum algorithms
Zhang, S., & Li, L. (2022) · CCF Transactions on High Performance Computing · doi:10.1007/s42514-022-00090-3 · Cited by 31
Semi-quantum secret sharing in high-dimensional quantum system using product states
Hu, W., Zhou, R., & Luo, J. (2022) · Chinese Journal of Physics · doi:10.1016/j.cjph.2022.03.031 · Cited by 27
On incorrectness logic for Quantum programs
Yan, P., Jiang, H., & Yu, N. (2022) · Proceedings of the ACM on Programming Languages · doi:10.1145/3527316 · Cited by 27
Tower: data structures in Quantum superposition
Yuan, C., & Carbin, M. (2022) · Proceedings of the ACM on Programming Languages · doi:10.1145/3563297 · Cited by 27
Securing Reset Operations in NISQ Quantum Computers
Mi, A., Deng, S., & Szefer, J. M. (2022) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3548606.3559380 · Cited by 27
CaQR: A Compiler-Assisted Approach for Qubit Reuse through Dynamic Circuit
Hua, F., Jin, Y., Chen, Y., Vittal, S., Krsulich, K., Bishop, L. S., Lapeyre, J., Javadi-Abhari, A., & Zhang, E. Z. (2023) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3582016.3582030 · Cited by 38
Design of Quantum Computer Antivirus
Deshpande, S. R., Xu, C., Trochatos, T., Wang, H., Erata, F., Han, S., Ding, Y., & Szefer, J. M. (2023) · Springer eBooks · doi:10.1007/978-3-032-09303-5_12 · Cited by 28
NAPA: Intermediate-Level Variational Native-Pulse Ansatz for Variational Quantum Algorithms
Liang, Z., Cheng, J., Ren, H., Wang, H., Hua, F., Song, Z., Ding, Y., Chong, F. T., Han, S., Qian, X., et al. (2024) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2024.3355277 · Cited by 58
Evolution of a human-competitive quantum fourier transform algorithm using genetic programming
Massey, P., Clark, J. A., & Stepney, S. (2005) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1068009.1068288 · Cited by 26
A parallel comparison of multiple pairs of images on quantum computers
Yan, F., Iliyasu, A. M., Le, P. Q., et al. (2013) · International Journal of Innovative Computing and Applications · doi:10.1504/ijica.2013.062955 · Cited by 27
Improved Complexity of Quantum Oracles for Ternary Grover Algorithm for Graph Coloring
Wang, Y., & Perkowski, M. A. (2011) · Proceedings/Proceedings - International Symposium on Multiple-Valued Logic · doi:10.1109/ismvl.2011.42 · Cited by 27
Superlinear advantage for exact quantum algorithms
Ambainis, A. (2013) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2488608.2488721 · Cited by 31
Measurement device-independent quantum dialogue
Maitra, A. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1757-x · Cited by 27
A Novel Quantum Group Proxy Blind Signature Scheme Based on Five-Qubit Entangled State
Liu, G., Ma, W., Cao, H., et al. (2019) · International Journal of Theoretical Physics · doi:10.1007/s10773-019-04093-9 · Cited by 27
Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing
Ambainis, A., Belovs, A., Regev, O., & de Wolf, R. (2015) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611974331.ch65 · Cited by 40
Quantum vision representations and multi-dimensional quantum transforms
Li, H.-S., Song, S., Fan, P., et al. (2019) · Information Sciences · doi:10.1016/j.ins.2019.06.037 · Cited by 27
Butko, A., Michelogiannakis, G., Williams, S., Iancu, C., Donofrio, D., Shalf, J. M., Carter, J. T., & Siddiqi, I. A. (2020) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc2020.2020.00011 · Cited by 32
Kendon, V. M., Nemoto, K., & Munro, W. J. (2010) · Strathprints: The University of Strathclyde institutional repository (University of Strathclyde) · Cited by 27
Basing Weak Public-Key Cryptography on Strong One-Way Functions
Biham, E., Goren, Y. J., & Ishai, Y. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-78524-8_4 · Cited by 27
Quantum Circuit Design and Analysis for Database Search Applications
Ju, Y.-L., Tsai, I.-M., & Kuo, S. (2007) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2007.907845 · Cited by 29
Exponential separation of quantum and classical online space complexity
Gall, F. L. (2006) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/1148109.1148119 · Cited by 31
Decoherence in Grover’s quantum algorithm: Perturbative approach
Azuma, H. (2002) · Physical Review A · doi:10.1103/physreva.65.042311 · Cited by 27
Reversible arithmetic coding for quantum data compression
Chuang, I. L., & Modha, D. S. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.841192 · Cited by 27
Quantum AlgorithmsPreprint
Mosca, M. (2008) · arXiv (Cornell University) · Cited by 32
Gate-based quantum computing for protein design
Khatami, M. H., Mendes, U. C., Wiebe, N., & Kim, P. M. (2023) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1011033 · Cited by 26
Fast Stabiliser Simulation with Quadratic Form Expansions
de Beaudrap, N., & Herbert, S. (2022) · Quantum · doi:10.22331/q-2022-09-15-803 · Cited by 26
NISQ Quantum Computing: A Security-Centric Tutorial and Survey [Feature]
Chen, F., Jiang, L., Müller, H. A., Richerme, P., Chu, C., Fu, Z., & Min, Y. (2024) · IEEE Circuits and Systems Magazine · doi:10.1109/mcas.2024.3349665 · Cited by 32
Tazeem, M., Elmedany, W. M., & Ali, M. (2024) · Internet of Things · doi:10.1016/j.iot.2024.101381 · Cited by 31
Practical Introduction to Benchmarking and Characterization of Quantum Computers
Hashim, A., Nguyen, L. B., Goss, N., Marinelli, B., Naik, R., Chistolini, T., Hines, J., Marceaux, J. P., Kim, Y., Gokhale, P., et al. (2025) · PRX Quantum · doi:10.1103/prxquantum.6.030202 · Cited by 85
Quantum Differential and Linear Cryptanalysis
Kaplan, M., Leurent, G., Leverrier, A., & Naya‐Plasencia, M. (2016) · IACR Transactions on Symmetric Cryptology · doi:10.46586/tosc.v2016.i1.71-94 · Cited by 40
Identity Confidentiality in 5G Mobile Telephony Systems
Khan, H., Dowling, B., & Martin, K. M. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-04762-7_7 · Cited by 26
Ding, J., & Yamashita, S. (2019) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2019.2907919 · Cited by 26
Quantum Random Oracle Model with Auxiliary Input
Hhan, M., Xagawa, K., & Yamakawa, T. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-34578-5_21 · Cited by 26
Villalba-Díez, J., & Zheng, X. (2020) · Sensors · doi:10.3390/s20205856 · Cited by 27
Optimization of Simultaneous Measurement for Variational Quantum Eigensolver Applications
Gokhale, P., Angiuli, O., Ding, Y., Gui, K., Tomesh, T., Suchara, M., Martonosi, M., & Chong, F. T. (2020) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00054 · Cited by 29
A lightweight approach to detect malicious/unexpected changes in the error rates of NISQ computers
Acharya, N., & Saeed, S. M. (2020) · doi:10.1145/3400302.3415684 · Cited by 27
Quantum Circuit Learning with Parameterized Boson Sampling
Shi, J., Tang, Y., Lu, Y., Feng, Y., Shi, R., & Zhang, S. (2021) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3095103 · Cited by 27
Post-quantum cryptography for automotive systems
Fritzmann, T., Vith, J., Flórez, D., & Sepúlveda, J. (2021) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2021.104379 · Cited by 26
Grover on KATAN: Quantum Resource Estimation
Rahman, M., & Paul, G. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2022.3140376 · Cited by 26
Ametepe, A. F.-X., Ahouandjinou, A., & Ezin, E. C. (2022) · Wireless Networks · doi:10.1007/s11276-022-02903-3 · Cited by 27
Song, X., Chen, G., & El‐Latif, A. A. A. (2022) · Mathematics · doi:10.3390/math10173038 · Cited by 26
Distributed Transport Protocols for Quantum Data Networks
Zhao, Y., & Qiao, C. (2023) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2023.3262547 · Cited by 33
Constructing Optimal Bushy Join Trees by Solving QUBO Problems on Quantum Hardware and Simulators
Nayak, N., Rehfeld, J., Winker, T., Warnke, B., Çalıkyılmaz, U., & Groppe, S. (2023) · International Workshop on Big Data in Emergent Distributed Environments (BiDEDE) · doi:10.1145/3579142.3594298 · Cited by 28
Quantum Computing in Telecommunication—A Survey
Phillipson, F. (2023) · Mathematics · doi:10.3390/math11153423 · Cited by 33
Tackling the Qubit Mapping Problem with Permutation-Aware Synthesis
Liu, J., Younis, E., Weiden, M., Hovland, P., Kubiatowicz, J. D., & Iancu, C. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00090 · Cited by 36
Universal fault tolerant quantum computation on bilinear nearest neighbor arrays
Stephens, A. M., Fowler, A. G., & Hollenberg, L. C. L. (2008) · Quantum Information and Computation · doi:10.26421/qic8.3-4-7 · Cited by 26
Non-Dominated Quantum Iterative Routing Optimization for Wireless Multihop Networks
Alanis, D., Botsinis, P., Babar, Z., Ng, S. X., & Hanzo, L. (2015) · IEEE Access · doi:10.1109/access.2015.2478793 · Cited by 29
Quantum information technology
Spiller, T. P. (2003) · Materials Today · doi:10.1016/s1369-7021(03)00130-5 · Cited by 26
Quantum search algorithms on the hypercube
Hein, B., & Tanner, G. (2009) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/42/8/085303 · Cited by 26
Quantum and Approximate Privacy
Klauck, H. (2003) · Theory of Computing Systems · doi:10.1007/s00224-003-1113-7 · Cited by 27
Quantum physical synthesis: Improving physical design by netlist modifications
Mohammadzadeh, N., Sedighi, M., & Zamani, M. S. (2010) · Microelectronics Journal · doi:10.1016/j.mejo.2010.02.005 · Cited by 25
Towards applying computational complexity to foundations of physics
Kreinovich, V., & Finkelstein, A. M. (2006) · Journal of Mathematical Sciences · doi:10.1007/s10958-006-0113-y · Cited by 27
Noise effects in the quantum search algorithm from the viewpoint of computational complexity
Gawron, P., Klamka, J., & Winiarczyk, R. (2012) · International Journal of Applied Mathematics and Computer Science · doi:10.2478/v10006-012-0037-2 · Cited by 26
Arrighi, P. J., Díaz-Caro, A., & Valiron, B. (2017) · Information and Computation · doi:10.1016/j.ic.2017.04.001 · Cited by 26
Szegedy’s quantum walk with queries
Santos, R. A. M. (2016) · Quantum Information Processing · doi:10.1007/s11128-016-1427-4 · Cited by 29
Periodicity of the Discrete-time Quantum Walk on a Finite Graph
Higuchi, Y., Konno, N., Sato, I., & Segawa, E. (2017) · Interdisciplinary Information Sciences · doi:10.4036/iis.2017.a.10 · Cited by 28
The Classical Complexity of Boson Sampling
Clifford, P., & Clifford, R. (2018) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611975031.10 · Cited by 49
Extreme Quantum Advantage when Simulating Classical Systems with Long-Range Interaction
Aghamohammadi, C., Mahoney, J. R., & Crutchfield, J. P. (2017) · Scientific Reports · doi:10.1038/s41598-017-04928-7 · Cited by 26
Long-Term Public Blockchain: Resilience against Compromise of Underlying Cryptography
Sato, M., & Matsuo, S. (2017) · International Conference on Computer Communication and Networks (ICCCN) · doi:10.1109/icccn.2017.8038516 · Cited by 26
Quantum Multicollision-Finding Algorithm
Hosoyamada, A., Sasaki, Y., & Xagawa, K. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-70697-9_7 · Cited by 28
A Third-Party E-payment Protocol Based on Quantum Multi-proxy Blind Signature
Niu, X.-F., Zhang, J.-Z., Xie, S.-C., et al. (2018) · International Journal of Theoretical Physics · doi:10.1007/s10773-018-3778-3 · Cited by 26
Grover Search as a Naturally Occurring Phenomenon
Roget, M., Guillet, S., Arrighi, P. J., & Molfetta, G. D. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.180501 · Cited by 31
A Quantum Computational Approach to Correspondence Problems on Point Sets
Golyanik, V., & Theobalt, C. (2020) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr42600.2020.00920 · Cited by 26
Subdivided Phase Oracle for NISQ Search Algorithms
Satoh, T., Ohkura, Y., & Meter, R. V. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.3012068 · Cited by 27
Shannon Perfect Secrecy in a Discrete Hilbert Space
Kuang, R., & Bettenburg, N. (2020) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00039 · Cited by 26
A Generalization of the Deutsch-Jozsa Algorithm to Multi-Valued Quantum Logic
Fan, Y. (2007) · Proceedings/Proceedings - International Symposium on Multiple-Valued Logic · doi:10.1109/ismvl.2007.3 · Cited by 26
Evolving Intelligence in Humans and Machines: Integrative Evolving Connectionist Systems Approach
Kasabov, N. K. (2008) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2008.926584 · Cited by 26
Quantum Complexity of Testing Group Commutativity
Magniez, F., & Nayak, A. (2005) · Lecture notes in computer science · doi:10.1007/11523468_106 · Cited by 25
Structure and interpretation of quantum mechanics
Karczmarczuk, J. (2003) · International Symposium on Haskell · doi:10.1145/871895.871901 · Cited by 26
Yamakami, T. (1999) · Lecture notes in computer science · doi:10.1007/3-540-46691-6_33 · Cited by 24
Lower bounds for randomized and quantum query complexity using Kolmogorov arguments
Laplante, S., & Magniez, F. (2004) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.2004.1313852 · Cited by 28
Asynchronous Entanglement Provisioning and Routing for Distributed Quantum Computing
Yang, L., Zhao, Y., Huang, L., & Qiao, C. (2023) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom53939.2023.10229101 · Cited by 25
On the Security of Quantum Key Distribution Networks
Lella, E., & Schmid, G. (2023) · Cryptography · doi:10.3390/cryptography7040053 · Cited by 25
A Leap From Theory to Reality: Knowledge Visualization of Quantum Computing
Rawat, K. S., & Sharma, T. K. (2024) · IEEE Transactions on Engineering Management · doi:10.1109/tem.2024.3466949 · Cited by 26
Asl, M. G., Jabeur, S. B., Nammouri, H., & Miled, K. B. H. (2024) · Energy Economics · doi:10.1016/j.eneco.2024.108017 · Cited by 30
Zhang, Z., Wu, Y., & Ma, X. (2025) · Energy Conversion and Management · doi:10.1016/j.enconman.2025.119694 · Cited by 30
Continuous discretization of infinite-dimensional Hilbert spaces
Vernaz-Gris, P., Ketterer, A., Keller, A., Walborn, S. P., Coudreau, T., & Milman, P. (2014) · Physical Review A · doi:10.1103/physreva.89.052311 · Cited by 25
Lackadaisical quantum walk for spatial search
Giri, P. R., & Korepin, V. E. (2019) · Modern Physics Letters A · doi:10.1142/s0217732320500431 · Cited by 25
Optimized Modular Multiplication for Supersingular Isogeny Diffie-Hellman
Liu, W., Ni, J., Liu, Z., Liu, C., & O'Neill, M. P. (2019) · IEEE Transactions on Computers · doi:10.1109/tc.2019.2899847 · Cited by 25
Full abstraction for the quantum lambda-calculus
Clairambault, P., & de Visme, M. (2019) · Proceedings of the ACM on Programming Languages · doi:10.1145/3371131 · Cited by 25
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
