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 5,301–5,400 of 8,792
Zhang, P., & Luo, Y. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04424-8 · Cited by 2
Quantum Ensemble Learning with Quantum Support Vector Machine
Yu, Z., Chen, Z., & Xue, C. (2024) · International Conference on Advanced Algorithms and Control Engineering (ICAACE) · doi:10.1109/icaace61206.2024.10548133 · Cited by 2
Huang, C., Yang, M., Li, B., et al. (2024) · Computational Intelligence · doi:10.1111/coin.12647 · Cited by 2
Implementation of Grover's Algorithm based on Quantum Reservoir Computing
Mehta, S., Bhallamudi, V. P., Sumanth, A., et al. (2024) · International Conference for Emerging Technology (INCET) · doi:10.1109/incet61516.2024.10593410 · Cited by 2
Efficient Power Grid Management Using Quantum Computing and Machine Learning
Aslam, S., Tabita, G., Krishna, J. S. V. G., & Palav, M. R. (2024) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-3693-4001-1.ch004 · Cited by 2
Carette, J., Heunen, C., Kaarsgaard, R., et al. (2024) · Proceedings of the ACM on Programming Languages · doi:10.1145/3674625 · Cited by 2
Design of Technology for Secure File Storage Based on Hybrid Cryptography Methods: Short Overview
Abitova, G., Manap, A., Kulniyaziva, K., & Nikulin, V. V. (2024) · IEEE International Conference on Smart Information Systems and Technologies (SIST) · doi:10.1109/sist61555.2024.10629334 · Cited by 3
Ochi, A. R., Mahmud, S. G., Ghosh, B. C., & Margala, M. (2024) · IEEE International Conference on Nanotechnology (IEEE-NANO) · doi:10.1109/nano61778.2024.10628970 · Cited by 2
The quest for a practical quantum advantage or the importance of applications for quantum computing
Lorenz, J. M. (2024) · Modern Physics Letters A · doi:10.1142/s0217732324300064 · Cited by 2
A clipping technique for shorter hash-based signatures
Zheng, A. Y. C. L., Ferraz, L. T. D., & Junior, M. A. S. (2018) · Simpósio Brasileiro de Cibersegurança (SBSeg) · doi:10.5753/sbseg.2018.4251 · Cited by 2
Nieman, K., Durand, H., Patel, S., Koch, D., & Alsing, P. M. (2024) · Digital Chemical Engineering · doi:10.1016/j.dche.2024.100180 · Cited by 2
Modern Power System Risk Assessment Using Quantum Computing
Hosseini, S. A., Monti, A., & Peyghami, S. (2024) · International Conference on Probabilistic Methods Applied to Power Systems (PMAPS) · doi:10.1109/pmaps61648.2024.10667102 · Cited by 2
Robustness of optimal quantum annealing protocols
Funcke, N., & Berberich, J. (2024) · New Journal of Physics · doi:10.1088/1367-2630/ad7b6b · Cited by 3
Transitioning RingCT Accounts: From Classical to Post-Quantum Security
Duan, J., Wang, W., Wang, L., & Gu, L. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2024.3466905 · Cited by 3
Sim, M., Lee, M., & Seo, H. (2024) · Electronics · doi:10.3390/electronics13193863 · Cited by 2
A quantum-secure partial parallel MAC QPCBC
Mao, S., Guo, T., Wang, P., et al. (2024) · Designs Codes and Cryptography · doi:10.1007/s10623-024-01506-7 · Cited by 2
Harris, V. G., & Andalib, P. (2024) · Frontiers in Materials · doi:10.3389/fmats.2024.1343005 · Cited by 2
When Quantum Computing Meets Database: A Hybrid Sampling Framework for Approximate Query Processing
Wu, S., Shi, M., Zhang, D., et al. (2024) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2024.3480278 · Cited by 2
Joint encryption and error correction for secure quantum communication
Jha, N., Parakh, A., & Subramaniam, M. (2024) · Scientific Reports · doi:10.1038/s41598-024-75212-8 · Cited by 3
Guţoiu, R. A., Tănăsescu, A., & Popescu, P. G. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04548-x · Cited by 3
Quantum Key Recovery Attack on Simplified Grain 4-Bit Cipher Using Grover's Algorithm
Mohankumar, M., Singh, B., Thamaraimanalan, T., Korada, S. K., Yuvaraj, P., & Jyothikamalesh, S. (2024) · International Conference on Advanced Computing and Communication Systems (ICACCS) · doi:10.1109/icaccs60874.2024.10716920 · Cited by 2
Chen, J., Wen, Z., Li, Z., Lu, J., Lu, H., Ren, Y., & Chen, W. (2024) · Graphical Models · doi:10.1016/j.gmod.2024.101237 · Cited by 3
Long-Term Time-Stamping Schemes Based on MACs, Archives, and Transient Keys
Meng, L., & Chen, L. (2024) · doi:10.1109/ithings-greencom-cpscom-smartdata-cybermatics62450.2024.00101 · Cited by 2
A survey of the research on quantum circuit synthesis and optimization of symmetric-key cryptography
Da, L., Fei, G., Jian, Z., Huang, Z., Sun, S., & Bing, S. (2024) · Zhongguo kexue. Wulixue Lixue Tianwenxue · doi:10.1360/sspma-2024-0433 · Cited by 2
Parmar, H., Sharma, V. S., & Singh, S. K. (2024) · Advances in information security, privacy, and ethics book series · doi:10.4018/979-8-3693-2223-9.ch012 · Cited by 2
Lightweight Yet Nonce-Misuse Secure Authenticated Encryption for Very Short Inputs
Adomnicăi, A., Minematsu, K., & Shikata, J. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2024.3481033 · Cited by 2
Li, L., Zhou, Q., Li, Z., Deng, Y., & Bossé, É. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04581-w · Cited by 2
Practical Quantum Combinatorial String Matching
Cantone, D. A., Caudullo, C., Faro, S., Marino, F. P., Pavone, A., & Viola, C. (2024) · Lecture notes in networks and systems · doi:10.1007/978-3-031-73125-9_42 · Cited by 2
Bashir, I., Sokolov, A., Wu, X., Giounanlis, P., Petropoulos, N., Leipold, D. R., Asker, M., Esmailiyan, A., Andrade‐Miceli, D., Haenlein, H., et al. (2024) · International Journal of Circuit Theory and Applications · doi:10.1002/cta.4350 · Cited by 2
Kunde, V., Nold, J. M., & Hielscher, J. (2024) · European Symposium on Usable Security (EuroUSEC) · doi:10.1145/3688459.3688468 · Cited by 2
Sudden death of quantum advantage in correlation generations
Sun, W., Wei, F., Shao, Y., & Wei, Z. (2024) · Science Advances · doi:10.1126/sciadv.adr5002 · Cited by 2
Quantum algorithm for unstructured search of ranked targets
Tani, K., Tsuchiya, S., Tani, S., & Takeuchi, Y. (2025) · Physica Scripta · doi:10.1088/1402-4896/ade377 · Cited by 4
Quantum Computing for Antennas and Propagation Problems: A gentle introduction.
Migliore, M. D. (2024) · IEEE Antennas and Propagation Magazine · doi:10.1109/map.2024.3498696 · Cited by 2
Quantum Algorithm for a Stochastic Multicloud Model
Ueno, K., & Miura, H. (2024) · SOLA · doi:10.2151/sola.2025-006 · Cited by 6
Architecting the Quantum Future: Key Devices and Layers in Quantum Network Design
Khan, M. A., Aman, M. N., & Sikdar, B. (2024) · IEEE Physical Assurance and Inspection of Electronics (PAINE) · doi:10.1109/paine62042.2024.10792827 · Cited by 2
A Tutorial on Quantum Computing and Deep Learning with Quantum Deep Neural Networks
Mohsen, S., Elnashar, G., & Abdel-Aziz, M. H. (2024) · International Mobile, Intelligent, and Ubiquitous Computing Conference (MIUCC) · doi:10.1109/miucc62295.2024.10783565 · Cited by 2
Szczesny, B., & Gryncewicz, W. (2024) · Lecture notes in networks and systems · doi:10.1007/978-3-031-78468-2_4 · Cited by 2
Chosen-Prefix Collisions on AES-like Hashing
Chen, S., Dong, X., Guo, J., et al. (2024) · IACR Transactions on Symmetric Cryptology · doi:10.46586/tosc.v2024.i4.64-96 · Cited by 2
Public Key Security for Quantum Key Distribution
Mamatha, G. S., ANEESH, A. S., & Chaithanya, G. K. (2024) · International Conference on Computation System and Information Technology for Sustainable Solutions (CSITSS) · doi:10.1109/csitss64042.2024.10817048 · Cited by 2
Discrete Randomized Smoothing Meets Quantum Computing
Wollschläger, T., Saxena, A., Franco, N., Lorenz, J. M., & Günnemann, S. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00180 · Cited by 3
QGrover: Teaching Grover's Algorithm Through Visual Exploration
Norrie, S., Estey, A., Müller, H. A., et al. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.20454 · Cited by 2
Parallel Ising annealer via gradient-based Hamiltonian Monte Carlo
Wang, H., Liu, Z., Xie, Z., Li, L., Miao, Z., Cui, W., & Pan, Y. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00231-7 · Cited by 2
HBSS: (Simple) hash-based stateless signatures – hash all the way to the rescue!
Dolev, S., Yagudaev, A., & Yung, M. M. (2025) · Cryptography and Communications · doi:10.1007/s12095-024-00772-5 · Cited by 2
Comparative Study of Quantum Computing Tools and Frameworks
Hamid, M., Alam, B., & Pal, O. (2025) · Communications in computer and information science · doi:10.1007/978-3-031-80842-5_8 · Cited by 2
Multiplexed Quantum Communication with Surface and Hypergraph Product Codes
Nishio, S., Connolly, N., Piparo, N. L., Munro, W. J., Scruby, T. R., & Nemoto, K. (2025) · Quantum · doi:10.22331/q-2025-01-28-1613 · Cited by 2
Multipartite entanglement distribution in a topological photonic network
Zurita, J., Casado, A. A., Creffield, C. E., et al. (2025) · Quantum · doi:10.22331/q-2025-02-10-1625 · Cited by 2
Fat-Tree QRAM: A High-Bandwidth Shared Quantum Random Access Memory for Parallel Queries
Xu, S., Lu, A., & Ding, Y. (2025) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3676641.3716256 · Cited by 3
Distributed Generalized Deutsch-Jozsa Algorithm
Li, H., Qiu, D., & Luo, L. (2025) · Lecture notes in computer science · doi:10.1007/978-981-96-1093-8_18 · Cited by 2
Faisal, G. M., & Abbood, S. K. (2025) · Journal of Lifestyle and SDGs Review · doi:10.47172/2965-730x.sdgsreview.v5.n03.pe05573 · Cited by 2
A Novel Two- and Three-Player Scheme for Quantum Direct Communication
Andronikos, T., & Sirokofskich, A. (2025) · Symmetry · doi:10.3390/sym17030379 · Cited by 2
Derandomization of quantum algorithm for triangle finding
Li, G., & Li, L. (2025) · Information and Computation · doi:10.1016/j.ic.2025.105295 · Cited by 2
Yamada, S., Shigemoto, I., Kawakami, T., Isobe, H., Shoji, M., Miyagawa, K., & Yamaguchi, K. (2025) · Chemistry · doi:10.3390/chemistry7020038 · Cited by 3
Rock the QASBA: Quantum Error Correction Acceleration via the Sparse Blossom Algorithm on FPGAs
Vénere, M., Branchini, B., Conficconi, D., et al. (2025) · ACM Transactions on Reconfigurable Technology and Systems · doi:10.1145/3723168 · Cited by 2
An Efficient Collision Attack on Castryck-Decru-Smith’s Hash Function
Ohashi, R., & Onuki, H. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-86602-9_4 · Cited by 2
Accelerating spectral clustering on quantum and analog platforms
Xu, X., & Sahai, T. (2025) · Academia quantum. · doi:10.20935/acadquant7587 · Cited by 2
Akrom, M., Rustad, S., Sutojo, T., Setiadi, D. R. I. M., Andono, P. N., Shidik, G. F., Dipojono, H. K., & Maezono, R. (2025) · Materials Today Communications · doi:10.1016/j.mtcomm.2025.112341 · Cited by 11
Standardisation of and Migration to Post-Quantum Cryptography
Chen, L. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-87541-0_1 · Cited by 2
PT -symmetric mapping of three states and its implementation on a cloud quantum processor
Balytskyi, Y., Kotukh, Y. V., Khalimov, G., & Chang, S. (2025) · Quantum · doi:10.22331/q-2025-04-18-1716 · Cited by 2
Impact of hardware connectivity on Grover’s algorithm in NISQ era
Joshi, M., Mishra, M. K., & Karthikeyan, S. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04733-6 · Cited by 2
A Comprehensive and Systematic Analysis of One-Way Hashing and Its Advancements
Chakraborty, A., & Biswas, A. K. (2025) · International Conference on Intelligent Systems, Advanced Computing and Communication (ISACC) · doi:10.1109/isacc65211.2025.10969265 · Cited by 2
Quantum global minimum finder based on variational quantum search
Soltaninia, M., & Zhan, J. (2025) · Scientific Reports · doi:10.1038/s41598-025-91407-z · Cited by 2
Grover's search meets Ising models: A quantum algorithm for finding low-energy states
Zhukov, A. A., Lebedev, A. V., & Pogosov, W. V. (2025) · Computer Physics Communications · doi:10.1016/j.cpc.2025.109627 · Cited by 2
Performance analysis of a filtering variational quantum algorithm
Marin-Sanchez, G., & Amaro, D. (2025) · New Journal of Physics · doi:10.1088/1367-2630/add365 · Cited by 4
Multi-party dynamic secret sharing protocol based on orthogonal product states
Chen, Y., Li, S., Li, J., et al. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04740-7 · Cited by 2
Grover’s Algorithm for Neural Networks
Haverly, A., Rahimi, S., & Novotny, M. A. (2025) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc64685.2025.00111 · Cited by 2
Advantages of two quantum programming platforms in quantum computing and quantum chemistry
Wang, P., Wu, W.-Y., Lee, C., Hong, J.-C., & Tseng, Y. J. (2025) · Journal of Cheminformatics · doi:10.1186/s13321-025-01026-z · Cited by 2
Adiabatic quantum support vector machines
Date, P., Woun, D. J., Hamilton, K. E., Pérez, E. A. C., Shekhar, M. C., Rios, F., Gounley, J. P., Suh, I., Humble, T. S., & Tourassi, G. D. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-025-00280-6 · Cited by 4
Heritage preservation in quantum computing era – reference procedures
Trček, D. (2025) · npj Heritage Science · doi:10.1038/s40494-025-01782-z · Cited by 2
Cyber Security and Data Ownership
Vrana, J. (2025) · Springer eBooks · doi:10.1007/978-3-031-84477-5_79 · Cited by 4
Hung, W.-H., & Chen, T. (2025) · doi:10.1109/icct-pacific63901.2025.11012890 · Cited by 2
A d-dimensional Efficient and Verifiable Quantum Multi-secret Sharing Scheme
Li, F., Gu, J., & Zhu, S. (2025) · International Journal of Theoretical Physics · doi:10.1007/s10773-025-06040-3 · Cited by 2
Quantum attacks on Sum of Even-Mansour construction utilizing online classical queries
Li, Z., Fan, S., Gao, F., et al. (2025) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-025-00374-x · Cited by 2
Analyzing, Fixing and Optimizing a Space-Efficient Quantum Circuit for the Graph K-Coloring Problem
Belletti, O., Reale, S., & Nitto, E. D. (2025) · doi:10.1109/q-se66736.2025.00011 · Cited by 2
Szreder, P., & Stolarski, P. (2025) · Lecture notes in business information processing · doi:10.1007/978-3-031-94193-1_15 · Cited by 2
Analysis of mathematical models of quantum parallelism
Kravets, P. A. (2025) · Vìsnik Nacìonalʹnogo unìversitetu Lʹvìvsʹka polìtehnìka Serìâ Ìnformacìjnì sistemi ta merežì · doi:10.23939/sisn2025.17.248 · Cited by 2
QPlacer: Frequency-Aware Component Placement for Superconducting Quantum Computers
Zhang, J., Wang, H., Ding, Q., Gu, J., Assouly, R., Oliver, W. D., Han, S., Brown, K. R., Li, H. H., & Chen, Y. (2025) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/3695053.3730994 · Cited by 10
Deterministic Search on Complete Bipartite Graphs by Continuous-Time Quantum Walk
Lin, H., & Shang, Y. (2024) · Quantum Information and Computation · doi:10.2478/qic-2024-0001 · Cited by 2
Quantum natural stochastic pairwise coordinate descent
Sohail, M. A., Heidari, M., & Pradhan, S. S. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01047-4 · Cited by 2
Qubit mapping: the adaptive divide-and-conquer approach
Huang, Y., Zhou, X., Meng, F., & Li, S. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04815-5 · Cited by 5
A novel quantum algorithm for efficient attractor search in gene regulatory networks
Rossini, M., Weidner, F. M., Ankerhold, J., & Kestler, H. A. (2025) · Patterns · doi:10.1016/j.patter.2025.101295 · Cited by 2
Time-adaptive single-shot crosstalk detector on a superconducting quantum computer
Kang, H., Harper, B., Usman, M., & Sevior, M. E. (2025) · Physical Review Applied · doi:10.1103/mbkk-j663 · Cited by 4
Enhancing Post-Quantum Cryptographic Protocols with Quantum-Resistant Key Exchange Mechanisms
Balakrishnan, G., Samudrala, A., Chanamala, S., Rajesh, S. B., & Naganathan, S. B. T. (2025) · doi:10.1109/iccsp64183.2025.11088727 · Cited by 2
Visualization of Noisy and Less Noisy Computational Basis States in Quantum Computing
Senapati, P., Guan, Q., Pugmire, D., et al. (2025) · IEEE International Conference on Quantum Software (QSW) · doi:10.1109/qsw67625.2025.00011 · Cited by 2
Perspectives on Utilization of Measurements in Quantum Algorithms
Uotila, V., Salmenperä, I., Becker, L., de Griend, A. M.-V., Shinde, A. R., & Nurminen, J. K. (2025) · IEEE International Conference on Quantum Software (QSW) · doi:10.1109/qsw67625.2025.00016 · Cited by 8
ProvideQ: A Quantum Optimization Toolbox
Eichhorn, D., Poser, N., Schweikart, M., et al. (2025) · IEEE International Conference on Quantum Software (QSW) · doi:10.1109/qsw67625.2025.00032 · Cited by 2
Efficient Dictionary Search Quantum Algorithms
Ablayev, F. M., Salikhova, N., & Ablayev, M. (2025) · Physics of Particles and Nuclei · doi:10.1134/s1063779625700017 · Cited by 2
Multiparty Quantum Secret Sharing of Classical Message Under Noisy Scenario
Basak, N., & Paul, G. (2025) · IEEE International Conference on Quantum Control, Computing and Learning (qCCL) · doi:10.1109/qccl65142.2025.11158800 · Cited by 1
Zhao, W., Wang, Z., Zhao, L., et al. (2025) · doi:10.1109/eeais66172.2025.11171168 · Cited by 2
Bertl, M., Mott, A., Sinno, S., & Bhalgamiya, B. (2025) · Lecture notes in computer science · doi:10.1007/978-3-032-01377-4_6 · Cited by 9
A novel quantum private query protocol and its application in private set intersection
Deng, Z., Sun, H., Zhang, K., et al. (2025) · Scientific Reports · doi:10.1038/s41598-025-91161-2 · Cited by 2
Quantum Advantage in Private Multiple Hypothesis Testing
Nam, S.-H., Park, H., Bae, J., & Lee, S.-H. (2025) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit63088.2025.11195216 · Cited by 1
Chen, M., Cheng, J., Li, P., Wang, H., Chen, T., & Liu, J. (2026) · npj Quantum Information · doi:10.1038/s41534-026-01195-1 · Cited by 6
Solving the Bernstein-Vazirani problem using Majorana-based topological quantum algorithms
Bedow, J., & Morr, D. K. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01120-y · Cited by 4
Implementation of magic state injection within heavy-hexagon architectures
Kim, H., Choi, W., & Kwon, Y. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-05004-0 · Cited by 2
Is Circuit Depth Accurate for Comparing Quantum Circuit Runtimes?
Tremba, M., Hovland, P., & Liu, J. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00049 · Cited by 5
Distributed Realization of Color Codes for Quantum Error Correction
Chandra, N. K., Tipper, D., Nejabati, R., Kaur, E., & Seshadreesan, K. P. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00269 · Cited by 12
Finding More Hints—Improved Power Analysis Attacks on Dilithium
Sun, Y., Zhang, T., Huang, Z., et al. (2025) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2025.3618387 · Cited by 2
OneAdapt: Resource-Adaptive Compilation of Measurement-Based Quantum Computing for Photonic Hardware
Zhang, H., Ruan, J., Tullsen, D. M., Ding, Y., Li, A., & Humble, T. (2025) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1145/3725843.3756100 · Cited by 2
Finding stable models via quantum computation.
Meyer, D., Pommersheim, J., & Remmel, J. B. (2004) · Cited by 2
Stimulated Emission Studies of Ultracold Rydberg Atoms
Brekke, E. (2009) · Cited by 2
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
