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 6,201–6,300 of 8,792
The European Chips Act, The ISOLDE Project, and Open-Source Hardware
Krenn, W., Wilson, A., Suresh, A., et al. (2024) · Argentine Conference on Electronics (CAE) · doi:10.1109/cae59785.2024.10487147 · Cited by 1
Quantum Algorithm for the Traveling Salesperson Problem
Haverly, A., Novotny, M. A., & Rahimi, S. (2023) · IEEE Asia-Pacific Conference on Computer Science and Data Engineering (CSDE) · doi:10.1109/csde59766.2023.10487691 · Cited by 1
Depth–measurement trade-off for quantum search on block ciphers
Ng, W.-J., & Tan, C. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04359-0 · Cited by 1
Shandilya, S. K., Datta, A., Kartik, Y., & Nagar, A. K. (2024) · EAI/Springer Innovations in Communication and Computing · doi:10.1007/978-3-031-53290-0_7 · Cited by 1
Co-Design of Quantum Hardware and Algorithms in Nuclear and High Energy Physics
Franz, M., Zurita, P., Diefenthaler, M., & Mauerer, W. (2024) · EPJ Web of Conferences · doi:10.1051/epjconf/202429512002 · Cited by 3
Quantum metric learning with fuzzy-informed learning
Huang, C., Zhang, S., Chang, Y. Z., & Yan, L. (2024) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2024.129801 · Cited by 1
Grover's Quantum Search for the Signal Detection of OFDMA Downlink and SC-FDMA Uplink
Mondal, S., Zarin, N. N., & Kadir, M. I. (2024) · International Conference on Electrical Engineering and Information Communication Technology · doi:10.1109/iceeict62016.2024.10534323 · Cited by 1
Verifiable distributed blind quantum computation
Wenbiao, X., Junyu, Q., Xingjia, X., Jiang, Z., & Qin, L. (2024) · Zhongguo kexue. Wulixue Lixue Tianwenxue · doi:10.1360/sspma-2024-0133 · Cited by 1
Quantum FP-Growth for Association Rules Mining
Belkadi, W. H., Drias, Y., & Drias, H. (2024) · Information systems engineering and management · doi:10.1007/978-3-031-59318-5_8 · Cited by 1
Quantum Slime Mould Algorithm and Application to Urgent Transportation
Khelfa, C., Drias, H., & Khennak, I. (2024) · Information systems engineering and management · doi:10.1007/978-3-031-59318-5_7 · Cited by 1
Quantum Iterative Algorithm for Linear Systems of Equation
Roy, D., & Chandra, S. R. (2024) · Lecture notes in networks and systems · doi:10.1007/978-3-031-62281-6_38 · Cited by 1
Task Manager of Quantum Web Services Through a Load Balancing Solution
Alvarado‐Valiente, J., Romero‐Álvarez, J., Moguel, E., et al. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-62362-2_24 · Cited by 1
Quantum Property Testing Algorithm for the Concatenation of Two Palindromes Language
Khadiev, K. R., & Serov, D. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-63742-1_10 · Cited by 1
A quantum algorithm of multislice method
Wang, Y. C., Sun, Y., & Ding, Z. (2024) · Results in Physics · doi:10.1016/j.rinp.2024.107834 · Cited by 1
Towards an efficient variational quantum algorithm for solving linear equations
Xu, W.-S., Zhou, R., Li, Y., & Zhang, X.-X. (2024) · Communications in Theoretical Physics · doi:10.1088/1572-9494/ad597d · Cited by 1
FPGA Bitstream Fault Injection Attack and Countermeasures on the Sampling Counter in CRYSTALS Kyber
Ni, Z., Khalid, A., Liu, W., et al. (2024) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas58744.2024.10557946 · Cited by 1
Avances de la computación cuántica en México
Palacios-Razo, L., & Sun, G.-H. (2024) · PÄDI Boletín Científico de Ciencias Básicas e Ingenierías del ICBI · doi:10.29057/icbi.v12i23.11467 · Cited by 1
Quantum computation by cooling
Cho, J. (2024) · Journal of the Korean Physical Society · doi:10.1007/s40042-024-01137-0 · Cited by 1
Quantum rectangular MinRank attack on multi-layer UOV signature schemes
Cho, S.-M., & Seo, S.-H. (2024) · Scientific Reports · doi:10.1038/s41598-024-66841-0 · Cited by 1
Understanding Quantum Parallelism Through Programming
Sang, J., & Yu, C. (2023) · International Conference on Computational Science and Computational Intelligence (CSCI) · doi:10.1109/csci62032.2023.00177 · Cited by 1
The Potential of Quantum Cryptography in Securing Future Communication Channels
Sihare, S. R. (2024) · Advances in systems analysis, software engineering, and high performance computing book series · doi:10.4018/978-1-7998-9522-0.ch005 · Cited by 1
Sihare, S. R. (2024) · Advances in systems analysis, software engineering, and high performance computing book series · doi:10.4018/978-1-7998-9522-0.ch009 · Cited by 1
Zhang, K., Shang, T., Tang, Y., & Liu, J. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04491-x · Cited by 1
A Quantum Annealing Approach to Fluid Dynamics Problems Solving Navier-Stokes Equations
Rodríguez, J. D. D., Pérez, A. P., Fernández, E. I., & Valera, A. J. J. (2024) · International Conference on Smart and Sustainable Technologies (SpliTech) · doi:10.23919/splitech61897.2024.10612316 · Cited by 1
Quantum Solution for Configuration Selection and Prioritization
Ammermann, J., Brenneisen, F. J., Bittner, T., et al. (2024) · doi:10.1145/3643667.3648221 · Cited by 1
Quantum Computers and their Application in Future Era
Fernandes, O. M., Nisha, N., Naik, O., et al. (2024) · International Journal of Advanced Research in Science Communication and Technology · doi:10.48175/ijarsct-19331 · Cited by 1
Song, G., & Seo, H. (2024) · Electronics · doi:10.3390/electronics13163167 · Cited by 1
Advances in Electron-Based Qubits: A Review
Gao, Z., Amaratunga, G. A. J., Wang, X., & Ma, B. (2024) · Journal of Physics Conference Series · doi:10.1088/1742-6596/2809/1/012028 · Cited by 2
Improving Generic Attacks Using Exceptional Functions
Bonnetain, X., Boissier, R. H., Leurent, G., & Schrottenloher, A. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-68385-5_4 · Cited by 2
An Unconditionally Secure Encryption Protocol for Cloud Storage
Moltafet, M., Sadjadpour, H. R., & Rezki, Z. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619595 · Cited by 1
Depth Optimized Quantum Circuits for HIGHT and LEA
Jang, K., Oh, Y., Lee, M., Kim, D., & Seo, H. (2024) · Silicon Valley Cybersecurity Conference (SVCC) · doi:10.1109/svcc61185.2024.10637378 · Cited by 1
Quantum Walks Advantage on the Dihedral Group for Uniform Sampling Problem
Dhamapurkar, S., Dang, Y., Wagh, S., & Deng, X. (2024) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc62729.2024.00026 · Cited by 1
Quantum-Accelerated Flight Selection: Probing Grover's Algorithm and Quantum Device Efficiency
Hire, J. V., Gawande, V., & Dhande, S. (2024) · International Journal of Innovative Science and Research Technology (IJISRT) · doi:10.38124/ijisrt/ijisrt24aug998 · Cited by 1
Speeding up Answer Set Programming by Quantum Computing
Romanello, R., Giustina, D. D., Pessotto, S., et al. (2024) · doi:10.1145/3660318.3660328 · Cited by 1
Improving Quantum Optimization Algorithms by Constraint Relaxation
Pecyna, T., & Różycki, R. (2024) · Applied Sciences · doi:10.3390/app14188099 · Cited by 1
Quantum Convolutional Neural Network based on Variational Quantum Fuzzy Inference
Zheng, F., Liu, Z., & Zhang, S. (2024) · International Conference on Information Science, Parallel and Distributed Systems (ISPDS) · doi:10.1109/ispds62779.2024.10667586 · Cited by 1
An MLWE-Based Cut-and-Choose Oblivious Transfer Protocol
Tang, Y., Guo, M., Huo, Y., et al. (2024) · Entropy · doi:10.3390/e26090793 · Cited by 1
Raja, T. Y., Bhattacherjee, R., & Bitragunta, S. (2024) · IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT) · doi:10.1109/conecct62155.2024.10677246 · Cited by 1
Genetic Quantum Algorithms with Binary Observation
Skobtsov, Y. (2024) · Studies in systems, decision and control · doi:10.1007/978-3-031-67685-7_16 · Cited by 1
Efficient quantum multi-authority attribute-based encryption and generalizations
Chaudhury, S. S. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04538-z · Cited by 1
Searching for a pixel's position in a grayscale quantum image with Grover's algorithm
Gueddana, A. (2024) · doi:10.1117/12.3025644 · Cited by 1
Resource Efficient Boolean Function Solver on Quantum Computer
Li, X., Shen, H., Gao, W., & Li, Y. (2024) · Quantum · doi:10.22331/q-2024-10-10-1500 · Cited by 1
Chen, Y., Cheng, J., Miao, H., et al. (2024) · Frontiers in Earth Science · doi:10.3389/feart.2024.1483776 · Cited by 1
On the stabilizer formalism and its generalization
Descamps, É., & Dakić, B. (2024) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ad8607 · Cited by 1
Sepúlveda, W. C., Villegas-Martínez, B. M., Gesing, S., Sánchez-Mondragón, J. J., Sánchez-Pérez, J. C., Vidales-Basurto, C. A., Escobedo-Alatorre, J., Torres-Palencia, Á. D., Palillero-Sandoval, O., Licea‐Rodriguez, J., et al. (2024) · PeerJ Computer Science · doi:10.7717/peerj-cs.2318 · Cited by 1
Demonstration of Grover’s algorithm for retrieving secret keys in a basic SPN block cipher
Vu, M. T., Nguyen, V. N., Le, Q. D., & Do, Q. T. (2024) · CTU Journal of Innovation and Sustainable Development · doi:10.22144/ctujoisd.2024.317 · Cited by 1
A Systematic Review of Quantum BenchMarking
Malhotra, P., Kumar, A., & Garhwal, S. (2024) · International Journal of Theoretical Physics · doi:10.1007/s10773-024-05811-8 · Cited by 1
Securing the Quantum Future: Evaluating and Standardizing Quantum Encryption Algorithms
Soumya, S., & Chithralekha, T. (2024) · International Conference on Computing, Communication and Networking Technologies (ICCCNT) · doi:10.1109/icccnt61001.2024.10724027 · Cited by 1
Quantum algorithms for weighted constrained sampling and weighted model counting
Riguzzi, F. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00209-5 · Cited by 1
Bayesian network structure learning using quantum generative models
Ohno, H. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00217-5 · Cited by 1
Toward Applying Quantum Computing to Network Verification
Dozier, K., Beltran, J., Berg, K. J., et al. (2024) · ACM Workshop on Hot Topics in Networks (HotNets) · doi:10.1145/3696348.3696891 · Cited by 1
Effective and Efficient Parallel Qubit Mapper
Fu, H., Zhu, M., Chen, F., Zhang, C., Wu, J., Xie, W., & Li, X. (2024) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2024.3500784 · Cited by 4
Towards Wave Function Collapse using Optimization with Quantum Algorithms
Zhang, Z., Cheng, S., Xiao, K., et al. (2024) · SIGGRAPH Asia Technical Communications · doi:10.1145/3681758.3698015 · Cited by 1
Quantum rectangle attack and its application on Deoxys-BC
Xu, Y., Luo, Y.-B., Yuan, Z., et al. (2024) · Designs Codes and Cryptography · doi:10.1007/s10623-024-01526-3 · Cited by 1
Quantum implementation of bilinear interpolation algorithm based on NEQR and center alignment
蔡, S. 硕. C., & Zhou, R. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad9651 · Cited by 1
Code-Based Cryptography and Its Place in Quantum-Safe Strategies
Zafar, A., & Iqbal, S. S. (2024) · Advances in information security, privacy, and ethics book series · doi:10.4018/979-8-3693-9220-1.ch004 · Cited by 1
Quantum Blockchain Architecture for Transportation Services
Moskvin, V. S. (2024) · Intelligent Technologies and Electronic Devices in Vehicle and Road Transport Complex (TIRVED) · doi:10.1109/tirved63561.2024.10769810 · Cited by 4
Generalized Hybrid Search with Applications to Blockchains and Hash Function Security
Cojocaru, A., Garay, J. A., & Song, F. (2024) · Lecture notes in computer science · doi:10.1007/978-981-96-0947-5_3 · Cited by 2
Coherent and non-unitary errors in ZZ-generated gates
Müller, T., Stollenwerk, T., Headley, D., Epping, M., & Wilhelm, F. K. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad9be2 · Cited by 4
Toward a Quantum-Inspired Framework for Modelling Legal Rules
Godfrey, N. (2024) · Quantum Economics and Finance · doi:10.1177/29767032241298302 · Cited by 1
Xia, Q., Zhu, Q., Xie, H., & Yang, L. (2024) · The Computer Journal · doi:10.1093/comjnl/bxae129 · Cited by 1
Physical synthesis in distributed quantum architectures
Mousavi, S. M., & Mohammadzadeh, N. (2024) · Physica Scripta · doi:10.1088/1402-4896/ada18b · Cited by 1
Recovery for secret key in CTIDH-512 through Fault Injection Attack
Kim, H., Im, W., Jeong, S., Kim, H., Seo, C., & Kang, C. (2025) · Computers & Electrical Engineering · doi:10.1016/j.compeleceng.2024.110057 · Cited by 1
Hybrid Meta-Solving for Practical Quantum Computing
Eichhorn, D., Schweikart, M., Poser, N., et al. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00056 · Cited by 1
Hybrid Quantum Search Algorithm for Solving the Multi-Dimensional Knapsack Problem
Cui, G., Sato, R., Saito, K., et al. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.10376 · Cited by 1
Physical Qubits Estimation for Quantum S-Box
Lee, Y.-S., Lee, J., Chung, B., & Kang, Y. (2024) · Information and Communication Technology Convergence · doi:10.1109/ictc62082.2024.10826924 · Cited by 1
Lower bounds for quantum-inspired classical algorithms via communication complexity
Mande, N. S., & Shao, C. (2025) · Quantum · doi:10.22331/q-2025-01-14-1593 · Cited by 1
Simulation of Quantum Homomorphic Encryption: Demonstration and Analysis
Ganjian, S., Paddock, C., & Broadbent, A. (2024) · IEEE International Conference on Trust, Privacy and Security in Intelligent Systems and Applications (TPS-ISA) · doi:10.1109/tps-isa62245.2024.00066 · Cited by 1
A Pattern Matching Based Framework for Quantum Circuit Rewriting
Jiang, H., Li, D.-K., Deng, Y., & Xu, M. Q. (2024) · Journal of Computer Science and Technology · doi:10.1007/s11390-024-2726-3 · Cited by 2
Quantum cryptanalysis of reduced-round E2 algorithm
Xu, Y., Du, X., Jia, M., et al. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04649-1 · Cited by 1
Implementation of finite state logic machines via the dynamics of atomic systems
Hailu, D. H. (2025) · Results in Optics · doi:10.1016/j.rio.2025.100789 · Cited by 3
Modeling Musical Knowledge With Quantum Bayesian Networks
Krebs, F., Fürntratt, H., Unterberger, R., & Graf, F. (2024) · International Workshop on Content-Based Multimedia Indexing (CBMI) · doi:10.1109/cbmi62980.2024.10859245 · Cited by 1
Oh, Y., Jang, K., & Seo, H. (2025) · Lecture notes in computer science · doi:10.1007/978-981-96-1624-4_27 · Cited by 1
A note on quantum divide and conquer for minimal string rotation
Wang, Q. (2025) · Theoretical Computer Science · doi:10.1016/j.tcs.2025.115120 · Cited by 1
Pseudorandom bit generation with asymmetric numeral systems
Pieprzyk, J., Pawlowski, M. P., Morawiecki, P., et al. (2025) · International Journal of Information Security · doi:10.1007/s10207-025-00995-4 · Cited by 1
Understanding nature’s selection of genetic languages
Patel, A. (2025) · Biosystems · doi:10.1016/j.biosystems.2025.105428 · Cited by 1
Range dependent Hamiltonian algorithms for numerical QUBO formulation
Lee, H., & Jun, K. (2025) · Scientific Reports · doi:10.1038/s41598-025-93552-x · Cited by 1
Emulation of Density Matrix Dynamics With Classical Analog Circuits
Cressman, A. J., & Sarpeshkar, R. (2025) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2025.3552736 · Cited by 1
A quantum approach for optimal control
Sandesara, H., Shukla, A., & Vedula, P. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04710-z · Cited by 2
Reducing the Number of Qubits in Solving LWE
Benedikt, B. J. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-86602-9_9 · Cited by 1
Quantum circuit implementation and security analysis of IVLBC
Ding, L., Luo, Q.-B., Lv, Y., Zheng, Y., Liao, H., & Chen, Z. (2025) · Classical and Quantum Gravity · doi:10.1088/1361-6382/adc6eb · Cited by 1
Optimal sampling of tensor networks targeting wave function's fast decaying tails
Ballarin, M., Silvi, P., Montangero, S., & Jaschke, D. (2025) · Quantum · doi:10.22331/q-2025-04-18-1714 · Cited by 4
Quantum Computer-Generated Holography
Shimobaba, T., Wang, F., & Ito, T. (2025) · IEEE Access · doi:10.1109/access.2025.3564553 · Cited by 1
Post-Kuantum Kriptografi Anahtar Değişim Mekanizması ile Kaotik Akış Şifreleme Algoritması
Kalkavan, V., & KASAPBAŞI, M. C. (2025) · Haliç Üniversitesi Fen Bilimleri Dergisi · doi:10.46373/hafebid.1610167 · Cited by 1
Quantum-Safe Hash Time-Locked Cross-Chain Transaction Mechanism
Hu, X., Cheng, W., Bai, S., Ma, C., & Liu, Y. (2025) · Studies in computational intelligence · doi:10.1007/978-3-031-78373-9_6 · Cited by 1
Application of quantum computing in choice-based network revenue management
Dalgaard, M., Boulanger, A., Papen, A., Hansen, R. T., Fiig, T., & Wesenberg, J. (2025) · Journal of Revenue and Pricing Management · doi:10.1057/s41272-025-00527-8 · Cited by 1
Kleptographic Attacks Against Implicit Rejection
Joux, A., Loss, J., & Wagner, B. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-91829-2_7 · Cited by 1
Quantum-Resistant Cryptography
Maqousi, A. Y. A., & Basu, K. (2025) · IGI Global eBooks · doi:10.4018/979-8-3373-1370-2.ch004 · Cited by 1
Problem Specific Communications in Distributed Quantum Computing
Basak, J., Wang, B., & Rajasekaran, S. (2025) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc64685.2025.00069 · Cited by 1
Understanding Noise-Adaptive Transpilation Techniques Using the SupermarQ Benchmark
Vorathammathorn, S., Binhar, M., Patamawisut, N., Chanchuphol, S., Prechaprapranwong, P., Hansomboon, J., & Sarochawikasit, R. (2025) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc64685.2025.00071 · Cited by 1
Liao, H., Luo, Q.-B., Zheng, Y., et al. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04749-y · Cited by 1
Seismic Wave Propagation Simulation With Quantum Computing
Wen, X., & Wang, Y. (2025) · Journal of Geophysical Research Machine Learning and Computation · doi:10.1029/2024jh000473
Quantum Computing- A Revolutionizing the Computational Paradigm
Dabass, V., & Suman (2025) · International Journal of Research and Review in Applied Science Humanities and Technology · doi:10.71143/rtx55e08 · Cited by 1
Impact of Noise and Hardware Connectivity on Grover’s Quantum Search Algorithm in NISQ Devices
Joshi, M., Mishra, M. K., & Karthikeyan, S. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-88881-6_4 · Cited by 1
q-Point: A Numeric Format for Quantum Circuit Simulation Using Polar Form Complex Numbers
Choi, S., Jang, E., Kim, Y., Ahn, S., & Ro, W. W. (2025) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2025.3572935 · Cited by 1
Consider the energy consumption of your quantum circuits
Calero, C., Polo, M., Desdentado, E., et al. (2025) · Nature Reviews Physics · doi:10.1038/s42254-025-00846-0 · Cited by 1
QuantuML: Machine Learning Algorithms and K-Means on Quantum Cloud Offering
Bitsakos, C., Nikas, K., & Koziris, N. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-94677-6_9 · Cited by 1
Vanitha Muthu., P., & Karthiyayini, R. (2025) · Symmetry · doi:10.3390/sym17060965 · Cited by 1
Chen, T. (2025) · Future Internet · doi:10.3390/fi17060263 · Cited by 1
$$\epsilon $$-Uniform mixing in discrete quantum walks
Zhan, H. (2025) · Journal of Algebraic Combinatorics · doi:10.1007/s10801-025-01431-5 · Cited by 1
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
