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 2,401–2,500 of 8,792
Storing Images in Entangled Quantum SystemsPreprint
Venegas-Andraca, S. E., & Ball, J. L. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0402085 · Cited by 14
A theory of computation based on quantum logic (I)
Ying, M. (2005) · IEEE International Conference on Granular Computing (GrC) · doi:10.1109/grc.2005.1547240 · Cited by 14
Round2: KEM and PKE based on GLWR.Preprint
Baan, H., Bhattacharya, S., García-Morchón, Ó., Rietman, R., Tolhuizen, L. M. G. M., Torre-Arce, J. L., & Zhang, Z. (2017) · IACR Cryptology ePrint Archive · Cited by 14
Dash, A., Rout, S., Behera, B. K., & Panigrahi, P. K. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1710.05196 · Cited by 16
An algorithm for DNA read alignment on quantum acceleratorsPreprint
Sarkar, A., Al-Ars, Z., Almudéver, C. G., & Bertels, K. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.05563 · Cited by 15
Quantum Algorithms for Reinforcement Learning with a Generative ModelPreprint
Wang, D., Sundaram, A., Kothari, R., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2112.08451 · Cited by 14
A Serverless Cloud Integration For Quantum ComputingPreprint
Grossi, M., Crippa, L., Aita, A., Bartoli, G., Sammarco, V., Picca, E., Said, N., Tramonto, F., & Mattei, F. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.02007 · Cited by 23
QuEst: Graph Transformer for Quantum Circuit Reliability EstimationPreprint
Wang, H., Liu, P., Cheng, J., Liang, Z., Gu, J., Li, Z., Ding, Y., Jiang, W., Shi, Y., Qian, X., et al. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2210.16724 · Cited by 36
Quantum Optimization Algorithms in Operations Research: Methods, Applications, and ImplicationsPreprint
Klug, F. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4854668 · Cited by 18
Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition
Kagai, F., Branch, P., But, J., & Allen, R. (2025) · Telecom · doi:10.3390/telecom6040100 · Cited by 15
“Comparable security margins can be restored by doubling key sizes (for example, AES-128 to AES-256) [13].”
InfluentialIrreconcilable difference between quantum walks and adiabatic quantum computing
Wong, T. G., & Meyer, D. A. (2016) · Physical Review A · doi:10.1103/physreva.93.062313 · Cited by 13
Farooq, U., Singh, P., & Kumar, A. (2025) · Computer Science Review · doi:10.1016/j.cosrev.2025.100763 · Cited by 19
Raavi, M., Khan, Q., Wuthier, S., Chandramouli, P., Balytskyi, Y., & Chang, S. (2025) · Cryptography · doi:10.3390/cryptography9020038 · Cited by 23
Kundu, S., Gupta, T., Sardar, A., Bandyopadhyay, A., Swain, S., & Mallik, S. (2025) · Franklin Open · doi:10.1016/j.fraope.2025.100371 · Cited by 21
A novel quantum solution to secure two-party distance computation
Peng, Z., Shi, R., Wang, P.-H., et al. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-1911-0 · Cited by 13
Hamido, O. C., Cirillo, G. A., & Giusto, E. (2020) · International Audio Mostly Conference (AM) · doi:10.1145/3411109.3411135 · Cited by 13
Quantum Bloom Filter and Its Applications
Shi, R. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3054623 · Cited by 13
Fast Quantum Subroutines for the Simplex Method
Nannicini, G. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-73879-2_22 · Cited by 14
Searching a quantum database with Grover's search algorithm
Kain, B. (2021) · American Journal of Physics · doi:10.1119/10.0004835 · Cited by 13
Hardware Deployment of Hybrid PQC: SIKE+ECDH
Azarderakhsh, R., Khatib, R. E., Koziel, B., et al. (2021) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-030-90022-9_26 · Cited by 13
Novel Controlled Quantum Dialogue Protocols Without Information Leakage
Liu, B., & Liang, X.-Q. (2022) · International Journal of Theoretical Physics · doi:10.1007/s10773-022-05023-y · Cited by 13
Agile Acceleration of Stateful Hash-based Signatures in Hardware
Thoma, J. P., Hartlief, D., & Güneysu, T. E. (2022) · ACM Transactions on Embedded Computing Systems · doi:10.1145/3567426 · Cited by 13
Roy, K., & Kim, M.-K. (2022) · Electronics · doi:10.3390/electronics12010063 · Cited by 13
Pérez, I. F., la Prieta, F. D., Rodrı́guez, S., Corchado, J. M., & Prieto, J. (2023) · Lecture notes in networks and systems · doi:10.1007/978-3-031-22356-3_15 · Cited by 14
Jin, C., Yang, Z., Xiang, T., Adepu, S., & Zhou, J. (2023) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2023.3234873 · Cited by 13
HyQSAT: A Hybrid Approach for 3-SAT Problems by Integrating Quantum Annealer with CDCL
Tan, S., Yu, M., Python, A., Shang, Y., Li, T., Lu, L., & Yin, J. (2023) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca56546.2023.10071022 · Cited by 14
Optimizing Quantum Classification Algorithms on Classical Benchmark Datasets
John, M., Schuhmacher, J., Barkoutsos, P. K., Tavernelli, I., & Tacchino, F. (2023) · Entropy · doi:10.3390/e25060860 · Cited by 15
DeepQPrep: Neural Network Augmented Search for Quantum State Preparation
Selig, P., Murphy, N. P., Redmond, D., & Caton, S. J. (2023) · IEEE Access · doi:10.1109/access.2023.3296802 · Cited by 13
Benchmarking universal quantum gates via channel spectrum
Gu, Y., Zhuang, W.-F., Chai, X., & Liu, D. E. (2023) · Nature Communications · doi:10.1038/s41467-023-41598-8 · Cited by 14
Manenti, R., & Motta, M. (2023) · doi:10.1093/oso/9780198787488.001.0001 · Cited by 15
Leib, D., Seidel, T., Jäger, S., Heese, R., Jones, C. R., Awasthi, A., Niederle, A. E., & Bortz, M. (2023) · Scientific Reports · doi:10.1038/s41598-023-45668-1 · Cited by 18
A Primer on Underwater Quantum Key Distribution
Paglierani, P., Raouf, A. H. F., Pelekanakis, K., Petroccia, R., Alves, J., & Uysal, M. (2023) · Quantum Engineering · doi:10.1155/2023/7185329 · Cited by 16
Quantum algorithms for matrix operations and linear systems of equations
Qi, W., Zenchuk, A. I., Kumar, A., & Wu, J. (2024) · Communications in Theoretical Physics · doi:10.1088/1572-9494/ad2366 · Cited by 13
Role of Quantum Computing in the Era of Artificial Intelligence (AI)
Eswaran, U., Khang, A., & Eswaran, V. (2024) · Advances in computer and electrical engineering book series · doi:10.4018/979-8-3693-1168-4.ch003 · Cited by 13
Quantum Computing and Machine Learning on an Integrated Photonics Platform
Zhu, H., Lin, H., Wu, S., Luo, W., Zhang, H., Zhan, Y., Wang, X., Liu, A. Q., & Kwek, L. C. (2024) · Information · doi:10.3390/info15020095 · Cited by 13
Solving the vehicle routing problem via quantum support vector machines
Mohanty, N., Behera, B. K., & Ferrie, C. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00161-4 · Cited by 13
Developing intelligent cyber threat detection systems through quantum computing
Azeez, M., Nenebi, C. T., Asiam, L. K., Isoghie, E. J., Adesanya, O. R., & Abimbola, T. (2024) · International Journal of Science and Research Archive · doi:10.30574/ijsra.2024.12.2.1369 · Cited by 13
Estimating Interception Density in the BB84 Protocol: A Study with a Noisy Quantum Simulator
Fiorini, F., Pagano, M., Garroppo, R. G., & Osele, A. (2024) · Future Internet · doi:10.3390/fi16080275 · Cited by 14
Quantum image edge detection based on Haar wavelet transform
Wang, G., Zhao, W., Zou, P., et al. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04513-8 · Cited by 13
Grover-QAOA for 3-SAT: quadratic speedup, fair-sampling, and parameter clustering
Zhang, Z., Paredes, R., Sundar, B., Quiroga, D., Kyrillidis, A., Dueñas‐Osorio, L., Pagano, G., & Hazzard, K. R. A. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad895c · Cited by 25
Integration of AI and Quantum Computing in Cyber Security
Thirupathi, L., Akshaya, B., Reddy, P. C., Harsha, S. P., & Reddy, E. S. (2024) · Advances in mechatronics and mechanical engineering (AMME) book series · doi:10.4018/979-8-3693-7076-6.ch002 · Cited by 16
Resource‐Efficient Adaptive Variational Quantum Algorithm for Combinatorial Optimization Problems
Wu, S., Song, Y., Li, R., Qin, S., Wen, Q., & Gao, F. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202400484 · Cited by 17
Mandal, A. K., Nadim, M., Roy, C. K., Roy, B., & Schneider, K. A. (2025) · Automated Software Engineering · doi:10.1007/s10515-025-00493-w · Cited by 24
Bounds for Error Reduction with Few Quantum Queries
Chakraborty, S., Radhakrishnan, J., & Raghunathan, N. (2005) · Lecture notes in computer science · doi:10.1007/11538462_21 · Cited by 14
Robust variations of secret sharing through noisy quantum channel
Chen, X., Xu, G., Su, Y., et al. (2014) · Quantum Information and Computation · doi:10.26421/qic14.7-8-4 · Cited by 13
Unified quantum no-go theorems and transforming of quantum pure states in a restricted set
Luo, M., Li, H.-R., Lai, H., & Wang, X. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1754-0 · Cited by 13
Wang, L., & Ma, W. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1576-0 · Cited by 13
Entangling and disentangling in Grover's search algorithm
Pan, M., Qiu, D., Mateus, P., & Gruska, J. (2018) · Theoretical Computer Science · doi:10.1016/j.tcs.2018.10.001 · Cited by 13
Security is an architectural design constraint
Ravi, P., Najm, Z., Bhasin, S., Khairallah, M., Gupta, S. S., & Chattopadhyay, A. (2019) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2019.03.003 · Cited by 13
Key-recovery attacks on LED-like block ciphers
Xu, L., Guo, J., Jingyi, C., & Li, M. (2019) · Tsinghua Science & Technology · doi:10.26599/tst.2018.9010130 · Cited by 13
On the Difficulty of Inserting Trojans in Reversible Computing Architectures
Cui, X.-T., Saeed, S., Zulehner, A., Wille, R., Wu, K.-J., Drechsler, R., & Karri, R. (2017) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2018.2823315 · Cited by 12
An investigation on support vector clustering for big data in quantum paradigm
Bishwas, A. K., Mani, A., & Palade, V. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-2606-x · Cited by 16
Quantum verification of NP problems with single photons and linear optics
Zhang, A., Zhan, H., Liao, J., Zheng, K., Jiang, T., Mi, M., Yao, P., & Zhang, L. (2021) · Light Science & Applications · doi:10.1038/s41377-021-00608-4 · Cited by 13
Lattice-Based Proof-of-Work for Post-Quantum Blockchains
Behnia, R., Postlethwaite, E. W., Ozmen, M. O., & Yavuz, A. A. (2022) · Lecture notes in computer science · doi:10.1007/978-3-030-93944-1_21 · Cited by 14
End-to-end secure group communication for the Internet of Things
Lizardo, A., Barbosa, R., Neves, S., Correia, J., & Araújo, F. (2021) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2021.102772 · Cited by 13
Quantum-accelerated constraint programming
Booth, K. E. C., O’Gorman, B., Marshall, J., Hadfield, S., & Rieffel, E. G. (2021) · Quantum · doi:10.22331/q-2021-09-28-550 · Cited by 13
Indoor–Outdoor Detection in Mobile Networks Using Quantum Machine Learning Approaches
Phillipson, F., Wezeman, R. S., & Chiscop, I. (2021) · Computers · doi:10.3390/computers10060071 · Cited by 13
Hybrid quantum-classical algorithms: Foundation, design and applications
Chen, R.-Y.-L., Zhao, B., Song, Z., Zhao, X., Wang, K., & Wang, X. (2021) · Acta Physica Sinica · doi:10.7498/aps.70.20210985 · Cited by 13
Yu, S., & Nabil, T. (2021) · Frontiers in Physics · doi:10.3389/fphy.2021.730685 · Cited by 13
Quantum Advantage for Shared Randomness Generation
Guha, T., Alimuddin, M., Rout, S., Mukherjee, A., Bhattacharya, S. S., & Banik, M. (2021) · Quantum · doi:10.22331/q-2021-10-27-569 · Cited by 13
Quantum Attacks on Sum of Even–Mansour Construction with Linear Key Schedules
Zhang, P. (2022) · Entropy · doi:10.3390/e24020153 · Cited by 13
Commercial and Military Applications and Timelines for Quantum Technology
Parker, E. (2021) · RAND Corporation eBooks · doi:10.7249/rra1482-4 · Cited by 13
Improved Particle Swarm Optimization on Based Quantum Behaved Framework for Big Data Optimization
Baş, E. (2022) · Neural Processing Letters · doi:10.1007/s11063-022-10850-5 · Cited by 13
Peel | Pile? Cross-Framework Portability of Quantum Software
Schönberger, M., Franz, M., Scherzinger, S., & Mauerer, W. (2022) · IEEE International Conference on Software Architecture Companion (ICSA-C) · doi:10.1109/icsa-c54293.2022.00039 · Cited by 13
Quantum Attacks on Lai-Massey Structure
Mao, S., Guo, T., Wang, P., et al. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-17234-2_11 · Cited by 13
Quantum attacks on two-round even-mansour
Cai, B., Gao, F., & Leander, G. (2022) · Frontiers in Physics · doi:10.3389/fphy.2022.1028014 · Cited by 14
Quantum Circuit Simulator based on FPGA
Hong, Y., Jeon, S., Park, S., & Kim, B.-S. (2022) · International Conference on Information and Communication Technology Convergence (ICTC) · doi:10.1109/ictc55196.2022.9952408 · Cited by 13
Using quantum computing to solve the maximal covering location problem
Giraldo-Quintero, A., Pulido, J. G. L., Duque, J. C., & Sierra-Sosa, D. (2022) · Computational Urban Science · doi:10.1007/s43762-022-00070-x · Cited by 13
Approaches to Overpower Proof-of-Work Blockchains Despite Minority
Baniata, H., & Kertész, A. (2023) · IEEE Access · doi:10.1109/access.2023.3234322 · Cited by 16
Number-phase uncertainty relations and bipartite entanglement detection in spin ensembles
Vitagliano, G., Fadel, M., Apellaniz, I., Kleinmann, M., Lücke, B., Klempt, C., & Tóth, G. (2023) · Quantum · doi:10.22331/q-2023-02-09-914 · Cited by 12
Areion: Highly-Efficient Permutations and Its Applications to Hash Functions for Short Input
Isobe, T., Ito, R., Liu, F., et al. (2023) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2023.i2.115-154 · Cited by 13
Improved Low-Depth SHA3 Quantum Circuit for Fault-Tolerant Quantum Computers
Song, G., Jang, K., & Seo, H. (2023) · Applied Sciences · doi:10.3390/app13063558 · Cited by 14
Quantum Secure Multi-Party Summation Using Single Photons
Wu, W., & Xie, M.-Z. (2023) · Entropy · doi:10.3390/e25040590 · Cited by 13
Quantum circuit implementations of SM4 block cipher based on different gate sets
Lin, D., Xiang, Z.-J., Xu, R.-Q., Zeng, X.-Y., & Zhang, S. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04002-4 · Cited by 8
Hardware-Conscious Optimization of the Quantum Toffoli Gate
Bowman, M. A., Gokhale, P., Larson, J. M., Liu, J., & Suchara, M. (2023) · ACM Transactions on Quantum Computing · doi:10.1145/3609229 · Cited by 17
Kuo, S., Lai, Y.-T., Jiang, Y.-C., et al. (2023) · doi:10.1145/3583133.3596370 · Cited by 13
Optimal Layout Synthesis for Quantum Circuits as Classical Planning
Shaik, I., & van de Pol, J. (2023) · 2023 IEEE/ACM International Conference on Computer Aided Design (ICCAD) · doi:10.1109/iccad57390.2023.10323924 · Cited by 25
Non-unitary Trotter circuits for imaginary time evolution
Leadbeater, C., Fitzpatrick, N., Ramo, D. M., & Thom, A. J. W. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad53fb · Cited by 19
Quantum-assisted encryption for digital audio signals
Yang, Y., Tian, J., Sun, S.-J., et al. (2015) · Optik · doi:10.1016/j.ijleo.2015.07.082 · Cited by 13
A study of parallel neural networks
Weigang, L., & da Silva, N. C. (2003) · 2022 International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1999.831112 · Cited by 13
Exploring the search space of quantum programs
Leier, A., & Banzhaf, W. (2003) · doi:10.1109/cec.2003.1299571 · Cited by 13
A graph isomorphism algorithm using signatures computed via quantum walk search model
Wang, H., Wu, J., Yang, X., & Yi, X. (2015) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/48/11/115302 · Cited by 14
Fractional Order PID Controller Based on Particle Swarm Optimization Implemented with FPGA
Qu, L., Hu, H., & Huang, Y. (2010) · doi:10.1109/aici.2010.41 · Cited by 13
Ramos, R. V., & Mendes, F. V. (2014) · Physics Letters A · doi:10.1016/j.physleta.2014.02.008 · Cited by 13
Some Observations on Two-Way Finite Automata with Quantum and Classical States
Qiu, D. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-87442-3_1 · Cited by 13
Quantum Point Cloud and its Compression
Jiang, N., Hu, H., Dang, Y., et al. (2017) · International Journal of Theoretical Physics · doi:10.1007/s10773-017-3483-7 · Cited by 13
Correcting finite squeezing errors in continuous-variable cluster states
Su, D., Weedbrook, C., & Brádler, K. (2018) · Physical Review A · doi:10.1103/physreva.98.042304 · Cited by 13
A hybrid quantum-classical paradigm to mitigate embedding costs in quantum annealing
Abbott, A. A., Calude, C. S., Dinneen, M. J., & Hua, R. (2019) · International Journal of Quantum Information · doi:10.1142/s0219749919500424 · Cited by 16
Mapping from multiple-control Toffoli circuits to linear nearest neighbor quantum circuits
Cheng, X., Guan, Z., & Ding, W. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-1908-8 · Cited by 13
Image Thresholding Segmentation on Quantum State Space
Wang, X., Yang, C., Xie, G.-S., et al. (2018) · Entropy · doi:10.3390/e20100728 · Cited by 13
Exponential Separation between Quantum Communication and Logarithm of Approximate Rank
Sinha, M., & de Wolf, R. (2019) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2019.00062 · Cited by 19
Detecting Brute-Force Attacks on Cryptocurrency Wallets
Kiktenko, E. O., Kudinov, M., & Fedorov, A. K. (2019) · Lecture notes in business information processing · doi:10.1007/978-3-030-36691-9_20 · Cited by 16
Maitra, S., & MUKHOPADHYAY, P. (2005) · International Journal of Quantum Information · doi:10.1142/s0219749905000980 · Cited by 13
Quantum computation of eigenvalues within target intervals
Jensen, P. W. K., Kristensen, L. B., Kottmann, J. S., & Aspuru-Guzik, A. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abc096 · Cited by 13
Introducing structure to expedite quantum searching
Briański, M., Gwinner, J., Hlembotskyi, V., Jarnicki, W., Pliś, S., & Szady, A. (2021) · Physical Review A · doi:10.1103/physreva.103.062425 · Cited by 18
Enhancing Code Based Zero-Knowledge Proofs Using Rank Metric
Bellini, E., Gaborit, P., Hasikos, A., et al. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-65411-5_28 · Cited by 13
Benkoczi, R. R., Gaur, D. R., Nagy, N., et al. (2022) · Entropy · doi:10.3390/e24030323 · Cited by 13
SPEEDY Quantum Circuit for Grover’s Algorithm
Song, G., Jang, K., Kim, H., Eum, S., Sim, M., Kim, H., Lee, W.-K., & Seo, H. (2022) · Applied Sciences · doi:10.3390/app12146870 · Cited by 10
A Quantum Image Encryption Algorithm Based on Quantum Image Geometric Transformations
Zhou, R., Wu, Q. H., Zhang, M., et al. (2012) · Communications in computer and information science · doi:10.1007/978-3-642-33506-8_59 · Cited by 13
Deterministic polynomial-time quantum algorithms for Simon?s problem
Mihara, T., & Sung, S. C. (2003) · Computational Complexity · doi:10.1007/s00037-003-0181-z · Cited by 13
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
