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 4,401–4,500 of 8,792
Quantum Weighted Fractional Fourier Transform
Zhao, T., Yang, T., & Chi, Y. (2022) · Mathematics · doi:10.3390/math10111896 · Cited by 4
High-Precision Voltage Measurement for Optical Quantum Computation
Wereszczyński, K., Michalczuk, A., Paszkuta, M., & Gumiela, J. (2022) · Energies · doi:10.3390/en15124205 · Cited by 4
Collision Forgery Attack on the AES-OTR Algorithm under Quantum Computing
Chang, L., Wei, Y., Wang, X., & Pan, X. (2022) · Symmetry · doi:10.3390/sym14071434 · Cited by 4
Quantum Approach for Vertex Separator Problem in Directed Graphs
Zaiou, A., Bennani, Y., Hibti, M., et al. (2022) · IFIP advances in information and communication technology · doi:10.1007/978-3-031-08333-4_40 · Cited by 4
A First Attempt at Cryptanalyzing a (Toy) Block Cipher by Means of QAOA
Phab, L., Louise, S., & Sirdey, R. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-08760-8_19 · Cited by 4
Asymmetric scaling of a quantum image based on bilinear interpolation with arbitrary scaling ratio
Gao, C., Zhou, R., Li, X., et al. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03612-8 · Cited by 4
Optimizing the Quantum Circuit for Solving Boolean Equations Based on Grover Search Algorithm
Liu, H., Li, F., & Fan, Y. (2022) · Electronics · doi:10.3390/electronics11152467 · Cited by 4
Automatic oracle generation in Microsoft’s Quantum Development Kit using QIR and LLVM passes
Soeken, M., & Mykhailova, M. (2022) · Design Automation Conference · doi:10.1145/3489517.3530626 · Cited by 6
Reordering Decision Diagrams for Quantum Computing Is Harder Than You Might Think
Hillmich, S., Burgholzer, L., Stögmüller, F., & Wille, R. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-09005-9_7 · Cited by 4
A scheme for distributed quantum search through simultaneous state transfer mechanism
Gupta, M., & Pathak, A. (2007) · Annalen der Physik · doi:10.1002/andp.20075191202 · Cited by 4
Fu, S.-J., Zhang, K., Zhang, L., et al. (2022) · Frontiers in Physics · doi:10.3389/fphy.2022.1021113 · Cited by 4
Transitioning Towards Quantum-Safe Government
Kong, I. (2022) · International Conference on Theory and Practice of Electronic Governance · doi:10.1145/3560107.3560182 · Cited by 4
Pronin, C. B., Ostroukh, A. V., Maksimychev, O. I., et al. (2022) · Intelligent Technologies and Electronic Devices in Vehicle and Road Transport Complex (TIRVED) · doi:10.1109/tirved56496.2022.9965530 · Cited by 4
Quantum algorithm for learning secret strings and its experimental demonstration
Xu, Y., Zhang, S., & Li, L. (2022) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2022.128372 · Cited by 4
Quantum Spatial Search with Electric Potential: Long-Time Dynamics and Robustness to Noise
Fredon, T., Zylberman, J., Arnault, P., & Debbasch, F. (2022) · Entropy · doi:10.3390/e24121778 · Cited by 4
An Injectivity Analysis of Crystals-Kyber and Implications on Quantum Security
Ding, X., Esgin, M. F., Sakzad, A., et al. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-22301-3_17 · Cited by 4
A Comparative study on state of art Cryptographic key distribution with quantum networks
Hegde, S. B., Srivastav, S., & Ks, N. B. (2022) · IEEE Global Conference for Advancement in Technology (GCAT) · doi:10.1109/gcat55367.2022.9971870 · Cited by 4
Measurement-device-independent quantum protocol for E-payment based on blockchain
Li, E., Shi, R., Li, K., et al. (2023) · Quantum Information Processing · doi:10.1007/s11128-022-03770-9 · Cited by 4
Graph Partitioning Approach for Fast Quantum Circuit Simulation
Im, J., & Kang, S. (2023) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1145/3566097.3567928 · Cited by 4
A quantum algorithm for Toeplitz matrix-vector multiplication
Gao, S., & 杨, Y.-G. 宇. Y. (2023) · Chinese Physics B · doi:10.1088/1674-1056/acb914 · Cited by 4
Delgado, F., & Cardoso-Isidoro, C. (2023) · Entropy · doi:10.3390/e25020376 · Cited by 4
Quantum Machine Learning: A Review
Sarkar, S. (2023) · International Journal for Research in Applied Science and Engineering Technology · doi:10.22214/ijraset.2023.49421 · Cited by 4
A Novel State Connection Strategy for Quantum Computing to Represent and Compress Digital Images
Haque, M. E., Paul, M., Ulhaq, A., et al. (2023) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp49357.2023.10094832 · Cited by 4
Chiang, C.-F., & Alsing, P. M. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03968-5 · Cited by 4
A Variational Ansatz for Taylorized Imaginary Time Evolution
Koch, M., Schaudt, O., Mogk, G., Mrziglod, T., Berg, H., & Beck, M. E. (2023) · ACS Omega · doi:10.1021/acsomega.3c01060 · Cited by 6
A Side-Channel Attack Against Classic McEliece When Loading the Goppa Polynomial
Seck, B., Cayrel, P.-L., Drăgoi, V., Diop, I., Barbier, M., Klamti, J. B., Grosso, V., & Colombier, B. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-37679-5_5 · Cited by 4
Quantum Algorithm for Anomaly Detection of Sequences
Guo, M., Liu, H.-L., Pan, S., Li, W., Gao, F., Huang, X., Qin, S., & Wen, Q. (2023) · Advanced Quantum Technologies · doi:10.1002/qute.202300082 · Cited by 4
Quantum chip design optimization and automation in superconducting coupler architecture
Li, F.-Y., & Jin, L.-J. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/ace8b6 · Cited by 4
Advancing Comprehension of Quantum Application Outputs: A Visualization Technique
Senapati, P., Athawale, T. M., Pugmire, D., & Guan, Q. (2023) · doi:10.1145/3588983.3596689 · Cited by 4
QuChain: On the Security and Privacy of Peer-to-Peer System using Blind Quantum Computation
Waseem, H. M., Deebak, B. D., Majeed, A., & Hwang, S. O. (2023) · IEEE International Conference on Nanotechnology (IEEE-NANO) · doi:10.1109/nano58406.2023.10231156 · Cited by 5
Quantum key recovery attacks on tweakable Even–Mansour ciphers
Zhang, P., & Luo, Y. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04098-8 · Cited by 4
A Workflow for the Continuous Deployment of Quantum Services
Romero‐Álvarez, J., Alvarado‐Valiente, J., Moguel, E., García-Alonso, J. M., & Murillo, J. M. (2023) · IEEE International Conference on Software Services Engineering (SSE) · doi:10.1109/sse60056.2023.00015 · Cited by 4
Quantum Combinational Logics and their Realizations with Circuits
Tong, X., Chen, T., Pan, N., & Zhang, X. (2023) · Advanced Quantum Technologies · doi:10.1002/qute.202300251 · Cited by 4
Noisy Tree Data Structures and Quantum Applications
Khadiev, K. R., Savelyev, N. V., Ziatdinov, M., & Melnikov, D. (2023) · Mathematics · doi:10.3390/math11224707 · Cited by 4
Twin-field quantum encryption protocol for E-payment based on blockchain
Li, G., Luo, J., & Wang, Q. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04181-0 · Cited by 4
Efficient quantum circuit implementation of the SM4 S-box
JiaHong, L., Tan, X., Ming, L., & DaiPengWei, B. (2023) · Zhongguo kexue. Wulixue Lixue Tianwenxue · doi:10.1360/sspma-2023-0386 · Cited by 4
FIPS Compliant Quantum Secure Communication Using Quantum Permutation Pad
He, A., Lou, D., She, E., Guo, S., Watson, H., Weng, S., Perepechaenko, M., & Kuang, R. (2023) · World Symposium on Communication Engineering (WSCE) · doi:10.1109/wsce59557.2023.10365953 · Cited by 4
Evaluating KpqC Algorithm Submissions: Balanced and Clean Benchmarking Approach
Kwon, H., Sim, M., Song, G., et al. (2024) · Lecture notes in computer science · doi:10.1007/978-981-99-8024-6_26 · Cited by 4
Trajectory Planning for Automated Vehicles using Quantum Computing
Lilja, J. (2023) · IEEE International Conference on Intelligent Computer Communication and Processing (ICCP) · doi:10.1109/iccp60212.2023.10398673 · Cited by 4
Haque, M. E., Paul, M., Tohidi, F., et al. (2023) · International Conference on Digital Image Computing: Techniques and Applications (DICTA) · doi:10.1109/dicta60407.2023.00049 · Cited by 4
Grover’s search with learning oracle for constrained binary optimization problems
Ohno, H. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00148-1 · Cited by 4
A (t, n) threshold quantum image secret sharing scheme
Wang, H.-K., Xu, G., Liang, X.-Q., et al. (2024) · Multimedia Tools and Applications · doi:10.1007/s11042-024-18661-7 · Cited by 4
Existence and stability results for delay fractional deferential equations with applications
Hammad, H. A., Aloraini, N. M., & Abdel‐Aty, M. (2024) · Alexandria Engineering Journal · doi:10.1016/j.aej.2024.02.060 · Cited by 4
Ground state property calculations of LiHn complexes using IBM Qiskit’s quantum simulator
Avramidis, B., Paudel, H. P., Alfonso, D. R., Duan, Y., & Jordan, K. D. (2024) · AIP Advances · doi:10.1063/5.0188249 · Cited by 5
Lower rounds lattice-based anonymous AKA under the seCK model for the IoT
Wei, G., Fan, K., Zhang, K., et al. (2024) · Peer-to-Peer Networking and Applications · doi:10.1007/s12083-024-01676-0 · Cited by 4
Dissipative quantum Hopfield network: a numerical analysis
Torres, J. J., & Manzano, D. (2024) · New Journal of Physics · doi:10.1088/1367-2630/ad5e15 · Cited by 4
Homomorphic encryption of the k=2 Bernstein–Vazirani algorithm
Fernández, P., & Martin-Delgado, M. A. (2024) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ad6c04 · Cited by 4
Differential Privacy Preserving Quantum Computing via Projection Operator Measurements
Li, Y., Zhao, Y., Zhang, X., Zhong, H., Pan, M., & Zhang, C. (2024) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc62729.2024.00045 · Cited by 11
Patterns for Quantum Software Engineering
Bączyk, M., Pérez‐Castillo, R., & Piattini, M. G. (2024) · doi:10.1145/3665870.3665871 · Cited by 4
Bisection Grover’s Search Algorithm and Its Application in Analyzing CITE-seq Data
Ma, P., Chen, Y., Lu, H., & Zhong, W. (2024) · Journal of the American Statistical Association · doi:10.1080/01621459.2024.2404259 · Cited by 4
Kundu, S., Norga, Q., Karmakar, A., Gangopadhyay, S., Mera, J. M. B., & Verbauwhede, I. M. R. (2024) · ACM Transactions on Embedded Computing Systems · doi:10.1145/3696208 · Cited by 4
Complexity Considerations in the Heisenberg Uncertainty Principle
Nye, L. (2024) · Journal of High Energy Physics Gravitation and Cosmology · doi:10.4236/jhepgc.2024.104083 · Cited by 4
Design of a Quantum Walk Circuit to Solve the Subset-Sum Problem
Lancellotti, G., Perriello, S., Barenghi, A., & Pelosi, G. (2024) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/3649329.3657337 · Cited by 4
Semantic Security With Infinite-Dimensional Quantum Eavesdropping Channel
Frey, M., Bjelaković, I., Nötzel, J., & Stańczak, S. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3531250 · Cited by 5
Forward and Backward Constrained Bisimulations for Quantum Circuits Using Decision Diagrams
Burgholzer, L., Jiménez-Pastor, A., Larsen, K. G., Tribastone, M., Tschaikowski, M., & Wille, R. (2025) · ACM Transactions on Quantum Computing · doi:10.1145/3712711 · Cited by 4
State of practice: Evaluating GPU performance of state vector and tensor network methods
Vallero, M., Rech, P., & Vella, F. (2025) · Future Generation Computer Systems · doi:10.1016/j.future.2025.107927 · Cited by 4
Characterizing the Inter-Core Qubit Traffic in Large-Scale Quantum Modular Architectures
Rached, S. B., Agudo, I. L., Rodrigo, S., Bandić, M., García-Sáez, A., Feld, S., van Someren, H., Alarcón, E., Almudéver, C. G., & Abadal, S. (2025) · IEEE Access · doi:10.1109/access.2025.3583218 · Cited by 6
Model Reduction for Quantum Systems: Discrete-Time Quantum Walks and Open Markov Dynamics
Grigoletto, T., & Ticozzi, F. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3601118 · Cited by 4
Qonductor: A Cloud Orchestrator for Quantum Computing
Giortamis, E., Romão, F., Tornow, N., Lugovoy, D., & Bhatotia, P. (2025) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1145/3712285.3759785 · Cited by 22
Improving Boolean Circuit Testing by using Quantum Search
Chou, Y., & Kuo, S. (2008) · IEEE Conference on Nanotechnology (IEEE NANO) · doi:10.1109/nano.2008.185 · Cited by 4
Kosheleva, O. M., & Крейнович, В. (2016) · International Journal of Computing and Optimization · doi:10.12988/ijco.2016.648 · Cited by 4
A Perron–Frobenius Type of Theorem for Quantum Operations
Lagro, M., Yang, W.-S., & Xiong, S. (2017) · Journal of Statistical Physics · doi:10.1007/s10955-017-1862-3 · Cited by 5
Post-Quantum Cryptographic Schemes Based on Codes
Baldi, M. (2017) · International Conference on High Performance Computing & Simulation (HPCS) · doi:10.1109/hpcs.2017.151 · Cited by 4
Span program for non-binary functions
Beigi, S., & Taghavi, L. (2019) · Quantum Information and Computation · doi:10.26421/qic19.9-10-2 · Cited by 5
Quantum IDS for Mitigation of DDoS Attacks by Mirai Botnets
Balasubramanian, Y., Baggam, D. S., Venkatraman, S., et al. (2018) · Communications in computer and information science · doi:10.1007/978-981-10-8660-1_37 · Cited by 4
Quantum technologies and the National Quantum Initiative
Brown, K. R. (2019) · Quantum Engineering · doi:10.1002/que2.7 · Cited by 4
Reduction-Based Problem Mapping for Quantum Computing
Hu, S., Liu, P., Chen, C. R., et al. (2019) · Computer · doi:10.1109/mc.2019.2909709 · Cited by 4
Quantum circuits of c − Z and S W A P gates: optimization and entanglement
Bataille, M., & Luque, J.-G. (2019) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ab2cec · Cited by 8
Space-efficient classical and quantum algorithms for the shortest vector problem
Chen, Y., Chung, K.-M., & Lai, C. (2018) · Quantum Information and Computation · doi:10.26421/qic18.3-4-7 · Cited by 4
Correlation Property of Multipartite Quantum Image
Sanchez, M. A. M., Sun, G.-H., & Dong, S.-H. (2019) · International Journal of Theoretical Physics · doi:10.1007/s10773-019-04247-9 · Cited by 4
Secure Delegation of Isogeny Computations and Cryptographic Applications
Pedersen, R., & Uzunkol, O. (2019) · Cloud Computing Security Workshop · doi:10.1145/3338466.3358913 · Cited by 4
A Review on Quantum Computers with Emphasize on Linear Optics Quantum Computing
Sharma, A. K., & Ghunawat, A. K. (2019) · International Conference on Issues and Challenges in Intelligent Computing Techniques · doi:10.1109/icict46931.2019.8977637 · Cited by 4
The addition and subtraction of quantum matrix based on GNEQR
Li, H.-S., Xu, Y., Qin, Y., et al. (2019) · International Journal of Quantum Information · doi:10.1142/s0219749919500564 · Cited by 4
Modifying quantum Grover’s algorithm for dynamic multi-pattern search on reconfigurable hardware
Mahmud, N., Haase-Divine, B., MacGillivray, A., Srimoungchanh, B., Kuhnke, A., Blankenau, N., Rai, A., & El‐Araby, E. (2020) · Journal of Computational Electronics · doi:10.1007/s10825-020-01489-3 · Cited by 4
Quantum abstract detecting systems
Combarro, E. F., Ranilla, J., & Rúa, I. F. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02763-w · Cited by 4
The Promise and Challenges of Quantum Computing
Ritter, M. B. (2020) · International Symposium on VLSI Technology, Systems and Applications (VLSI-TSA) · doi:10.1109/vlsi-tsa48913.2020.9203596 · Cited by 4
Problems and solutions from the fourth International Students' Olympiad in Cryptography (NSUCRYPTO).
Gorodilova, A., Agievich, S., Carlet, C., et al. (2019) · Lirias (KU Leuven) · Cited by 4
Kang, I., Choung, J., Kang, D., & Park, I. (2020) · ETRI Journal · doi:10.4218/etrij.2019-0501 · Cited by 4
On protocols for increasing the uniformity of random bits generated with noisy quantum computers
Combarro, E. F., Carminati, F., Vallecorsa, S., et al. (2021) · The Journal of Supercomputing · doi:10.1007/s11227-020-03574-7 · Cited by 4
Optimized reversible quantum circuits for $${\mathbb {F}}_{2^8}$$ multiplication
Imaña, J. L. (2021) · Quantum Information Processing · doi:10.1007/s11128-020-02937-6 · Cited by 4
Isogeny-Based Cryptographic Access Control
Aleksandrova, E. B., Shtyrkina, А. А., & Yarmak, A. V. (2020) · Automatic Control and Computer Sciences · doi:10.3103/s0146411620080027 · Cited by 4
An Overview of Geometrical Optics Restricted Quantum Key Distribution
Pan, Z., & Djordjević, I. B. (2021) · Entropy · doi:10.3390/e23081003 · Cited by 5
Impact of Resource-Constrained Networks on the Performance of NIST Round-3 PQC Candidates
Auten, D., & Gamage, T. T. (2021) · IEEE Annual Computers, Software, and Applications Conference (COMPSAC) · doi:10.1109/compsac51774.2021.00109 · Cited by 4
Development of the RISC-V entropy source interface
Saarinen, M.-J. O., Newell, G. R., & Marshall, B. (2022) · Journal of Cryptographic Engineering · doi:10.1007/s13389-021-00275-6 · Cited by 4
Dirac Spatial Search with Electric Fields
Zylberman, J., & Debbasch, F. (2021) · Entropy · doi:10.3390/e23111441 · Cited by 4
Mereghetti, C., & Palano, B. (2021) · ACM SIGACT News · doi:10.1145/3494656.3494666 · Cited by 4
Grover’s Algorithm for Data Lake Optimization Queries
Cherradi, M., & Haddadi, A. E. (2022) · International Journal of Advanced Computer Science and Applications · doi:10.14569/ijacsa.2022.0130866 · Cited by 4
Quantum Computing and Computed Tomography: A Roadmap towards QuantumCT
Schielein, R., Basting, M., Dremel, K., Firsching, M., Fuchs, T. O. J., Graetz, J., Kasperl, S., Prjamkov, D., Semmler, S., Suth, D., et al. (2022) · e-Journal of Nondestructive Testing · doi:10.58286/26565 · Cited by 4
Algorithmic Container for Physics
Ozhigov, Y. I., Ozhigov, A. Y., Adenier, G., Khrennikov, A. Y., LAHTI, P. J., Man’ko, V. I., & Nieuwenhuizen, T. M. (2007) · AIP conference proceedings · doi:10.1063/1.2827301 · Cited by 4
Applying Quantum Search to a Known-Plaintext Attack on Two-Key Triple Encryption
Phaneendra, H. D., Raj, C., & Shivakumar, M. S. (2007) · Springer eBooks · doi:10.1007/978-0-387-44641-7_18 · Cited by 4
Applying quantum search to automated test pattern generation for VLSI circuits
Singh, S., & Singh, A. S. G. (2004) · doi:10.1109/pdcat.2003.1236383 · Cited by 4
Increasing Block Sizes Using Feistel Networks: The Example of the AES
Patarin, J., Gittins, B., & Treger, J. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-28368-0_8 · Cited by 4
Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields
Ivanyos, G., Karpiński, M., Sántha, M., et al. (2017) · Algorithmica · doi:10.1007/s00453-016-0273-1 · Cited by 4
Uniformity of quantum circuit families for error-free algorithms
Nishimura, H., & Ozawa, M. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2004.12.020 · Cited by 4
Mathematical models of quantum computation
Nishino, T. (2002) · New Generation Computing · doi:10.1007/bf03037370 · Cited by 6
Adaptive Phase Matching in Grover’s Algorithm
Li, P., & Song, K. (2011) · Journal of Quantum Information Science · doi:10.4236/jqis.2011.12006 · Cited by 4
Digital quantum forensics: future challenges and prospects
Overill, R. E. (2012) · International Journal of Information Technology Communications and Convergence · doi:10.1504/ijitcc.2012.050410 · Cited by 4
Square root of “not”: A major difference between fuzzy and quantum logics
Крейнович, В., Kohout, L., & Kim, E. (2008) · Annual Meeting of the North American Fuzzy Information Processing Society (NAFIPS) · doi:10.1109/nafips.2008.4531327 · Cited by 4
Lower bounds of a quantum search for an extreme point
Ozhigov, Y. (1999) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.1999.0397 · Cited by 4
On the Complexity of Searching for a Maximum of a Function on a Quantum Computer
Goćwin, M. (2006) · Quantum Information Processing · doi:10.1007/s11128-006-0011-8 · Cited by 6
Metadata
- Authors
- Grover, L. K.
- Affiliations
- AT&T (United States) (US)
- Corresponding author
- Grover, Lov K.
- Venue
- Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96
- Publisher
- ACM Press
- Published
- 1996
- Pages
- 212-219
- OpenAlex
- W2084652510
- Semantic Scholar
- 298d799da82395a64a3bda38ef9d2a4646828ccb
- Cited by
- 8,830
- References
- 24
- Citations by year
- 2026: 664 · 2025: 1066 · 2024: 896 · 2023: 841 · 2022: 674 · 2021: 655 · 2020: 529 · 2019: 423 · 2018: 288 · 2017: 283 · 2016: 219 · 2015: 221 · 2014: 184 · 2013: 161 · 2012: 158
- FWCI
- 36.24
- Type
- conference paper
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- ACM Symposium on Theory of Computing (STOC) (publishedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- quantum search, unsorted database search, Grover's algorithm, quantum algorithms, time complexity, quantum parallelism, lower bounds
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
A language model drew the claims from the paper on 2026-10-21, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-21 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
