The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index; none of the 8 sources its claims cite is checked for support yet.
A fast quantum mechanical algorithm for database search
Open accessAbstract
An unsorted database contains N records, of which just one satisfies a particular property.The problem is to identify that one record.Any classical algorithm, deterministic or probabilistic, will clearly take O (N) steps since on the average it will have to examine a large fraction of the N records.Quantum mechanical systems can do several operations simultaneously due to their wave like properties.This paper gives an O ( JN) step quantum mechanical algorithm for identifying that record.It is within a constant factor of the fastest possible quantum mechanical algorithm.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
19 No basis given · 8 Sources not found · 4 Own interpretation
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This paper gives an O ( JN) step quantum mechanical algorithm for identifying that record.”
§ A fast quantum mechanical algorithm for database search > Abstract
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- The authors state this as an assumption: There is a unique state that satisfies the condition C(S)=1.
- The authors state this as an assumption: For any state S, the condition C(S) can be evaluated in unit time.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Corollary 3.1-Let the state vector be as followsfor any one state the amplitude is k, for each of the remaining (N-1) states the amplitude is 1.Let k and 1 be real numbers (in general the amplitudes can be complex).Let k be negative and 1 be positive such that ~< ~N.Then after applying the diffusion transform both k and 1are positive numbers.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“First, it is proved that the system is a valid quantum mechanical system (theorems 1 & 2)”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
boosted- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“As mentioned in the introduction, the algorithm of this paper does not use any Imowledge about the problem.”
§ A fast quantum mechanical algorithm for database search > 114
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Theorem 1-The matix D is unitary.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The following sections prove that the system discussed in section 3 is indeed a valid quantum mechanical system and that it converges to the desired state with a probability O(l).”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- The authors state this as an assumption: There is a unique state that satisfies the condition C(S)=1.
- The authors state this as an assumption: For any state S, the condition C(S) can be evaluated in unit time.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Theorem 2 -D can be expressed as D = FRF, where F, the Fourier Transform Matrix and R, the rotation matrix are defined as follows”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Since the proba-& bility of the system being found in any particular state is proportional to the square of the amplitude, it follows that the probability of the system being in tlhe desired state when k is ~, 1 J2 is k2 = ~.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In case there is a unique state SV such that C(SV) = 1, the final state is SV with a probability of at least ~. 2”
§ A fast quantum mechanical algorithm for database search > T. Acknowledgments
plainconditional- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
- The authors state this as an assumption: There is a unique state that satisfies the condition C(S)=1.
- The authors state this as an assumption: For any state S, the condition C(S) can be evaluated in unit time.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“It can be easily modified to take care of the case when there are multiple states satisfying the condition C(S) = 1 and it is required to return one of these.”
§ A fast quantum mechanical algorithm for database search > 114
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Probably not a substantial claim. 8
- It may state two separate claims as one. 4
- The quote only partly states this claim. 1
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Theorem 5-Let the probability of a particular outcome in an experiment be &.Then if the experiment be repeated ~times, the probability that the outcome does not happen even once is less than or equal to e-K.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The change in k ( Ak) after steps (a) and (b) of the algorithm is lower bounded by Ak>~.Also after steps (a) and (b), 1>0.2fi”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Using this it immediately follows that there exists a number M less than EN, such that in M repetitions of the loop in step (ii), k wifl become ~.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The quote only partly states this claim.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The most efficient classical algorithm for this is to examine the items in the database one by one.”
§ A fast quantum mechanical algorithm for database search > ------------------------------------------------
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“Very recent results [Shor95] have shown the existence of quantum mechanical error corr~ting cod~which enable transmission of data even in the presence of noise”
§ A fast quantum mechanical algorithm for database search > 114
What the sources say
- Not matchedcites [Shor95]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
boosteddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This algorithm, by cleverly making use of some features of the structure of the problem, is the only known algorithm that solves the problem in O (logIV) steps.”
§ A fast quantum mechanical algorithm for database search > 114
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The phase does not have an analog in classical probabilistic algorithms.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This illustrates the point that, in quantum mechanics, the complete description of the system requires the amplitudes over all states, just the probabilities is not enough.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
In the paper
“For example Shor's primality testing algorithm [Shor94] for a number N can be viewed as a search of the (N-l) numbers smaller than N to see if any of them is a factor of N.”
§ A fast quantum mechanical algorithm for database search > 114
What the sources say
- Not matchedcites [Shor94]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
In the paper
“There is also a scheme discussed in [VV86] by which it is possible to modify any algorithm that solves an NPsearch problem with a unique solution and use it to solve an NP-search problem in general.”
§ A fast quantum mechanical algorithm for database search > 114
What the sources say
- Not matchedcites [VV86]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
hedgeddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
In the paper
“This operation is one of the things that makes quantum mechanical algorithms more powerful than classical algorithms and forms the basis for most significant quantum mechanical algorithms.”
§ A fast quantum mechanical algorithm for database search > T. Acknowledgments
What the sources say
- Not matchedcites [DJ92]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
- Not matched
The authors state this as an assumption.
There is a unique state that satisfies the condition C(S)=1.
“Let there be a unique state, say Sv, that satisfies the condition C(SV) = 1, whereas for all other states S, C(S) = 0”
“The algorithm as discussed here assumes a unique state that satisfies the desired condition.”
The authors state this as an assumption.
For any state S, the condition C(S) can be evaluated in unit time.
“(assume that for any state S, the condition C(S) can be evaluated in unit time)”
The paper relies on this without support.
There does not exist any sorting on the database that would aid selection of the desired item.
“However, there does not exist any sorting on the database that would aid its selection.”
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Symmetric cryptography remains comparatively resilient, yet Grover's algorithm offers a quadratic speed-up for brute-force key search, effectively halving the security margin of symmetric ciphers [13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Similarly, for hash functions, Grover's algorithm [185] can facilitate quantum birthday attack to find collision, thereby necessitating an output of larger size.”
From Zero Trust Architecture (ZTA): A Comprehensive Survey (2022) · cites this paper as [185]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Similarly, Grover’s algorithm concedes a quadratic advantage for mining blocks in certain consensus protocols such as proof of work.”
From Quantum-resistance in blockchain networks (2023) · cites this paper as [71]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Quantum computers will be able to find these nonces quadratically faster using Grover’s algorithm71.”
From Quantum-resistance in blockchain networks (2023) · cites this paper as [71]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“This model is realistic given the falling cost of storage, the rise of large-scale surveillance infrastructures, and the expected disruption of quantum algorithms such as Shor's and Grover's [1,2,13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measured
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Grover's algorithm provides only a quadratic speedup, effectively halving brute-force resistance. Comparable security margins can be restored by doubling key sizes (for example, AES-128 to AES-256) [13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“This explains why AES-256 maintains post-quantum security margins, whereas AES-128 requires upgrading to maintain equivalent protection levels [13,14].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“At the same time, Grover's algorithm shows that symmetric cryptography, though more resilient, also demands doubled key sizes to maintain equivalent margins [13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“In this sense, Grover-based optimization algorithms [184] such as Grover Adaptive Search [161] have been proposed.”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [184]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The former bound is tight since recent work of Grover [13] shows how to accept the class NP relative to any oracle on a quantum computer in time O (2 n/ 2 ).”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“In view of Grover's algorithm [13], we know that the constant '1 / 2' in the statement of Theorem 3.5 cannot be improved.”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The former bound is tight since recent work of Grover [13] shows how to accept the class NP relative to any oracle on a quantum computer in time O (2 n/ 2 ).”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“Grover’s algorithm [54] is a quantum algorithm for searching in a database, ofering quadratic speedup over classical searching methods.”
From QASMBench: A Low-Level Quantum Benchmark Suite for NISQ Evaluation and Simulation (2023) · cites this paper as [54]
The cited source says what the claim attributes to it.
In the citing paper
“However, quantum machines can recognize this language quadratically faster, in time O ( √ 2 n ), using Grover's algorithm [13].”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
The cited source says what the claim attributes to it.
In the citing paper
“That this was a real possibility is clear from Grover's [13] result, which gives a black-box approach to solving NP -complete problems in square-root as much time as is required classically.”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
The cited source says what the claim attributes to it.
In the citing paper
“Various strategies can be imagined, but a good one (called 'inversion about the average' by Grover [13]) is to perform an oracle-independent unitary transformation so as to change the phase difference into an amplitude difference, leaving the y term with the same sign as all the other terms but a magnitude approximately threefold larger.”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“The HNDL adversary departs from conventional cryptanalysis in its temporal asymmetry. Instead of attempting immediate decryption, the attacker passively collects encrypted traffic or stored archives and defers decryption until sufficient computational resources become available.”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredIn the citing paper
“This algorithm uses a single function evaluation to label the single state which satisfies the function, followed by a series of gates which drive the system into this particular state.”
From Implementation of a quantum search algorithm on a quantum computer (1998) · cites this paper as [9]
In the citing paper
“Here we show how such a computer can be used to implement a fast quantum search algorithm initially developed by Grover. 9, 10”
From Implementation of a quantum search algorithm on a quantum computer (1998) · cites this paper as [9]
In the citing paper
“Among other applications Grover's algorithms enable an extremely rapid search over the domain of a binary function to find elements for which this function is satisfied (that is, the function has the value 1).”
From Implementation of a quantum search algorithm on a quantum computer (1998) · cites this paper as [9]
In the citing paper
“the ability to efficiently perform Hamiltonian simulation is used in conjunction with another technique known as the quantum phase estimation algorithm (QPEA) 42 for efficiently obtaining the eigen-energies and eigenstates of a quantum system 38 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
In the citing paper
“The Quantum Phase Estimation (QPE) algorithm 38,99 is the natural translation of the FCI procedure to quantum computers 45 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
In the citing paper
“Abrams and Lloyd 38 focused on state preparation in more detail and described concrete initialization procedures.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
In the citing paper
“They pointed out that state preparation is conceptually easier in second quantization, where a Fock state is represented by a simple product state of qubits in {| 0 〉 , | 1 〉} states.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
Citations
Cites
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Scheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
Rapid solution of problems by quantum computation
Deutsch, D., & Jozsa, R. (1992) · Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences · doi:10.1098/rspa.1992.0167 · Cited by 2,700
The Emperor's New Mind: Concerning Computers, Minds, and The Laws of Physics
Penrose, R., & Gardner, M. (1989) · doi:10.1093/oso/9780198519737.001.0001 · Cited by 2,007
Strengths and Weaknesses of Quantum Computing
Bennett, C. H., Bernstein, E., Brassard, G., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300933 · Cited by 1,470
On the Power of Quantum Computation
Simon, D. R. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796298637 · Cited by 1,295
Bernstein, E., & Vazirani, U. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167097 · Cited by 1,284
Benioff, P. (1980) · Journal of Statistical Physics · doi:10.1007/bf01011339 · Cited by 1,244
The Emperor's New Mind: Concerning Computers, Minds, and the Laws of Physics
Penrose, R., & Landauer, R. (1990) · Physics Today · doi:10.1063/1.2810599 · Cited by 1,110
Research works printed but not linked: 2
- [9]9. R. Penrose, Shadows of the mind,. Oxford University Press, 1994, pp. 348- 388.
- [14]14. Yao93J A. Yao, Quantum circuit complexip, Proceedings 34th Annual Symposium on Foundations of Computer Science (FOCS), 1993, pp. 352-361.
Cited by
Sorted by citations
Items 4,701–4,800 of 8,792
Thota, S., & Dash, S. K. (2025) · International Conference on Machine Learning and Autonomous Systems (ICMLAS) · doi:10.1109/icmlas64557.2025.10968522 · Cited by 3
Simplified Periodic Distinguishers Searching: Application to GFS-4F/2F and TWINE
Chen, J., Liu, Q., Li, B., et al. (2025) · Lecture notes in computer science · doi:10.1007/978-981-96-4734-7_21 · Cited by 3
Optimizing Code-Based Cryptography for Efficient and Secure Post-Quantum Key Agreement
Iqbal, S. S., & Zafar, A. (2025) · Procedia Computer Science · doi:10.1016/j.procs.2025.04.057 · Cited by 3
Quantum Neural Networks for Solving Power System Transient Simulation Problem
Soltaninia, M., & Zhan, J. (2025) · Energies · doi:10.3390/en18102525 · Cited by 3
An FPGA-based Emulation Process for Dynamic Quantum Circuits
Song, Y., & Žilić, Ž. (2025) · International Symposium on Quality Electronic Design (ISQED) · doi:10.1109/isqed65160.2025.11014465 · Cited by 3
An Analysis of Existing Hash-Based Post-Quantum Signature Schemes
Păcurar, C. M., Bocu, R., & Iavich, M. (2025) · Symmetry · doi:10.3390/sym17060919 · Cited by 6
Qunicorn: A Middleware for the Unified Execution Across Heterogeneous Quantum Cloud Offerings
Weder, B., Barzen, J., Beisel, M., Bühler, F., Georg, D., Leymann, F., & Stiliadou, L. (2025) · IEEE/ACM International Workshop on Quantum Software Engineering (Q-SE) · doi:10.1109/q-se66736.2025.00009 · Cited by 3
Optimal Control-Based Grover’s Algorithm for a Six-Jointed Articulated Robotic Arm
Dahassa, M. S., & Zioui, N. (2025) · Electronics · doi:10.3390/electronics14132503 · Cited by 3
Distributed Multi-objective Quantum Search Algorithm
Li, H., & Qiu, D. (2025) · Lecture notes in computer science · doi:10.1007/978-981-96-9894-3_36 · Cited by 3
Quantum Computing: Threat to Cybersecurity
Pal, D., & Sau, D. (2025) · Springer eBooks · doi:10.1007/978-981-96-4948-8_7 · Cited by 3
Efficient Encoding of the Traveling Salesperson Problem on a Quantum Computer
Stenger, J., Crowe, S., Diaz, J., Rodriguez, R., Gunlycke, D., & Ptasinski, J. (2025) · Quantum Reports · doi:10.3390/quantum7030032 · Cited by 3
Evolution of Artificial Intelligence and Quantum Computing
Dubey, S. M., Jambhale, K. K., Shaikh, R. M. H., & Doss, S. (2025) · Springer eBooks · doi:10.1007/978-3-031-87931-9_2 · Cited by 3
A quantum theory with non-collapsing measurements
Fiorentino, V., & Weigert, S. (2025) · Physics Letters A · doi:10.1016/j.physleta.2025.130903 · Cited by 6
Qmod: Expressive High-Level Quantum Programming
Vax, M., Emanuel, P., Cornfeld, E., et al. (2025) · IEEE International Conference on Quantum Software (QSW) · doi:10.1109/qsw67625.2025.00026 · Cited by 3
A Framework for Debugging Quantum Programs
Rovara, D., Burgholzer, L., & Wille, R. (2025) · IEEE International Conference on Quantum Software (QSW) · doi:10.1109/qsw67625.2025.00024 · Cited by 3
Reducing quantum resources for attacking S-AES on quantum devices
Wang, Z., Zheng, M., Wu, J., Wen, K., Wei, S., & Long, G. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01106-w · Cited by 3
ElBedoui, K., Lakhal, N. B., & Barhoumi, W. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-025-07789-4 · Cited by 3
Quantum noise modeling through reinforcement learning
Bordoni, S., Papaluca, A., Buttarini, P., Sopena, A., Giagu, S., & Carrazza, S. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/ae1e98 · Cited by 7
Tedeschi, L. O. (2025) · Journal of Animal Science · doi:10.1093/jas/skaf445 · Cited by 5
Solving k–SAT problems with generalized quantum measurement
Zhang, Y., Lewalle, P., & Whaley, K. B. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01069-y · Cited by 6
Secure Satellite Communication in the Post‐Quantum Era: A Lattice‐Based Cryptographic Approach
Ghosh, T., & Nath, I. (2026) · International Journal of Satellite Communications and Networking · doi:10.1002/sat.70041 · Cited by 4
Quantum Algorithms for Intersection and Proximity Problems
Sadakane, K., Sugawara, N., & Tokuyama, T. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45678-3_14 · Cited by 3
Compilation to Quantum Circuits for a Language with Quantum Data and Control
Rouselakis, Y., Papaspyrou, N., Tsiouris, Y., et al. (2015) · Cited by 3
A Fast Measurement based fixed-point Quantum Search Algorithm
Mani, A., & Patvardhan, C. (2011) · International Conference on Quantum Information · doi:10.1364/icqi.2011.qmi28 · Cited by 3
Power-law scaling for the adiabatic algorithm for search-engine ranking
Frees, A., Gamble, J. K., Rudinger, K., et al. (2013) · Physical Review A · doi:10.1103/physreva.88.032307 · Cited by 3
DNA and quantum based algorithms for VLSI circuits testing
Singh, A. S. G., Bharadwaj, L. M., & Harpreet, S. (2005) · Natural Computing · doi:10.1007/s11047-004-3591-1 · Cited by 3
A quantum inspired algorithm for the job shop scheduling problem
Wu, X., & Li, S. (2011) · IEEE International Conference on Computing, Control and Industrial Engineering · doi:10.1109/ccieng.2011.6008104 · Cited by 3
Synthesis of Quantum Arrays from Kronecker Functional Lattice Diagrams
Lukáč, M., Shah, D., Perkowski, M. A., et al. (2014) · IEICE Transactions on Information and Systems · doi:10.1587/transinf.2013lop0015 · Cited by 3
Authenticated multiparty secret key sharing using quantum entanglement swapping
Alshowkan, M., & Elleithy, K. M. (2014) · doi:10.1109/aseezone1.2014.6820637 · Cited by 3
Patil, S. R., Javadi-Abhari, A., Chiang, C.-F., Heckey, J., Martonosi, M., & Chong, F. T. (2014) · IEEE International Symposium on Workload Characterization · doi:10.1109/iiswc.2014.6983057 · Cited by 6
Improving the network flow problem using quantum search
Yu, C.-M., Tsai, I.-M., Chou, Y., et al. (2007) · IEEE Conference on Nanotechnology (IEEE NANO) · doi:10.1109/nano.2007.4601381 · Cited by 3
Inverting a permutation is as hard as unordered search
Nayak, A. (2011) · Theory of Computing · doi:10.4086/toc.2011.v007a002 · Cited by 3
Using the Asynchronous Paradigm for Reversible Sequential Circuit Implementation
Feinstein, D. Y., & Thornton, M. A. (2012) · Proceedings/Proceedings - International Symposium on Multiple-Valued Logic · doi:10.1109/ismvl.2012.33 · Cited by 3
Designing And Comparing Classic Versus Quantum Artificial Bee Colony Algorithm
Manochehri, K., & Alizadegan, A. (2015) · Journal of Mathematics and Computer Science · doi:10.22436/jmcs.014.03.01 · Cited by 3
Surface code continuous quantum error correction using feedback
Nguyen, T., Hill, C. D., Hollenberg, L. C. L., & James, M. R. (2015) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2015.7403339 · Cited by 3
Quantum Query Complexity of Almost All Functions with Fixed On-set Size
Ambainis, A., Iwama, K., Nakanishi, M., Nishimura, H., Raymond, R., Tani, S., & Yamashita, S. (2016) · Computational Complexity · doi:10.1007/s00037-016-0139-6 · Cited by 3
Efficient simulation of open quantum system in duality quantum computing
Wei, S.-J., & Long, G. (2016) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.2245869 · Cited by 3
Singh, M. P., Radhey, K., & Kumar, S. (2017) · International Journal of Theoretical Physics · doi:10.1007/s10773-017-3405-8 · Cited by 3
A Quantum Probability Inspired Framework for Image-Set Based Face Identification
Hassanpour, N., & Chen, L. (2017) · International Conference on Automatic Face and Gesture Recognition · doi:10.1109/fg.2017.73 · Cited by 3
Quantum Associative Memory with Quantum Neural Network via Adiabatic Hamiltonian Evolution
Osakabe, Y., Akima, H., Sakuraba, M., Kinjo, M., & Sato, S. (2017) · IEICE Transactions on Information and Systems · doi:10.1587/transinf.2017edp7138 · Cited by 3
Remarks on Qubit neuron-based quantum neural servo controller
Takahashi, K. (2012) · Cited by 3
Trade-off between Performance and Security for Supersingular Isogeny-Based Cryptosystems
Téllez, C., & Borges, F. (2018) · Simpósio Brasileiro de Cibersegurança (SBSeg) · doi:10.5753/sbseg.2018.4247 · Cited by 3
Quantum key distribution protocol based on CSS error correcting codes
Jia, W., Bao, F., Yu, H. C., et al. (2019) · ACM Turing Celebration Conference - China (ACM TURC) · doi:10.1145/3321408.3326680 · Cited by 3
Quantum Branch-and-Bound Algorithm and its Application to the Travelling Salesman Problem
Markevich, E. A., & Trushechkin, A. S. (2019) · Journal of Mathematical Sciences · doi:10.1007/s10958-019-04415-6 · Cited by 3
A Comparison of NIST 2nd Round Candidates’ MQ-based Signature Schemes
Bai, Y., Kim, A., & Seo, S.-H. (2019) · International Conference on Information and Communication Technology Convergence (ICTC) · doi:10.1109/ictc46691.2019.8939690 · Cited by 3
Combining Perfect Shuffle and Bitonic Networks for Efficient Quantum Sorting
Mahmud, N., Srimoungchanh, B., Haase-Divine, B., Blankenau, N., Kuhnke, A., & El‐Araby, E. (2019) · IEEE/ACM International Workshop on Heterogeneous High-performance Reconfigurable Computing (H2RC) · doi:10.1109/h2rc49586.2019.00011 · Cited by 3
Detailed Fault Model for Physical Quantum Circuits
Deb, A., & Das, D. K. (2019) · Proceedings - Asian Test Symposium/Proceedings · doi:10.1109/ats47505.2019.00028 · Cited by 3
Experimental semi-autonomous eigensolver using reinforcement learning
Pan, C.-Y., Hao, M., Barraza, N., Solano, E., & Albarrán-Arriagada, F. (2021) · Scientific Reports · doi:10.1038/s41598-021-90534-7 · Cited by 3
Implementing a Quantum Coin Scheme
Murray, H., Horgan, J., Santos, J. F., Malone, D., & Šiljak, H. (2020) · Maynooth University ePrints and eTheses Archive (Maynooth University) · Cited by 3
Quantum Weighted Model Counting
Riguzzi, F. (2020) · Frontiers in artificial intelligence and applications · doi:10.3233/faia200401 · Cited by 3
Blind quantum computation with hybrid model
Zeng, X., Tan, X., Xu, Q., & Huang, R. (2020) · International Journal of Modern Physics B · doi:10.1142/s021797922050277x · Cited by 3
Bahreini, T., & Mohammadzadeh, N. (2020) · Quantum Engineering · doi:10.1002/que2.57 · Cited by 3
Quantum Search for a Given Substring in the Text Using a Hashing Technique
Ablayev, M., & Salikhova, N. (2020) · Učenye zapiski Kazanskogo gosudarstvennogo universiteta. Seriâ Fiziko-matematičeskie nauki/Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki · doi:10.26907/2541-7746.2020.3.241-258 · Cited by 3
Ciphertext-Only Attacks Against Compact-LWE Submitted to NIST PQC Project
Li, H., Liu, R., Liu, Z., et al. (2021) · Journal of Systems Science and Complexity · doi:10.1007/s11424-021-0042-3 · Cited by 3
Secure Cryptography Integration: NoC-Based Microarchitectural Attacks and Countermeasures
Sepúlveda, J. (2021) · Springer eBooks · doi:10.1007/978-3-030-69131-8_7 · Cited by 3
Recent advances of quantum neural networks on the near term quantum processor
Lü, Y., Gao, Q. Z., Lü, J., Pan, Y., & Dong, D. (2021) · Scientia Sinica Technologica · doi:10.1360/sst-2020-0459 · Cited by 3
Algorithm for initializing a generalized fermionic Gaussian state on a quantum computer
Kaicher, M., Jäger, S. B., & Wilhelm, F. K. (2021) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ac1f3c · Cited by 3
Nagata, K., & Nakamura, T. (2021) · International Journal of Theoretical Physics · doi:10.1007/s10773-021-04894-x · Cited by 3
Mielke, D. M., Mäurer, N., Gräupl, T., & Bellido-Manganell, M. A. (2021) · Digitale Welt · doi:10.1007/s42354-021-0401-1 · Cited by 3
Solving Large Steiner Tree Problems in Graphs for Cost-efficient Fiber-To-The-Home Network Expansion
Müller, T., Schmid, K., Schuman, D., Gabor, T., Friedrich, M., & Geitz, M. (2022) · International Conference on Agents and Artificial Intelligence (ICAART) · doi:10.5220/0010749300003116 · Cited by 3
Quantum Color Image Scaling on QIRHSI Model
Chen, G., & Song, X. (2021) · Communications in computer and information science · doi:10.1007/978-981-16-5940-9_35 · Cited by 3
Quantum Differential Collision Distinguishing Attacks on Feistel Schemes
Zhongya, Z., Wu, W., & Bolin, W. (2021) · Chinese Journal of Electronics · doi:10.1049/cje.2021.07.026 · Cited by 3
Quantum Supremacy: How far along are we on the journey?
Chanu, A. M., & Kumar, V. (2021) · Asian Conference on Innovation in Technology (ASIANCON) · doi:10.1109/asiancon51346.2021.9544619 · Cited by 3
On Forging SPHINCS$$^{+}$$-Haraka Signatures on a Fault-Tolerant Quantum Computer
Berger, R., & Tiepelt, M. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-88238-9_3 · Cited by 4
Artificial Intelligence in Medicine Using Quantum Computing in the Future of Healthcare
Davids, J., Lidströmer, N., & Ashrafian, H. (2021) · Springer eBooks · doi:10.1007/978-3-030-58080-3_338-1 · Cited by 4
A Note on Quantum Collision Resistance of Double-Block-Length Compression Functions
Hirose, S., & Kuwakado, H. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92641-0_8 · Cited by 3
Kieferová, M., & Sanders, Y. R. (2022) · Harvard Data Science Review · doi:10.1162/99608f92.69c5328d · Cited by 3
Possible Applications of Quantum Computing, Especially in Vehicle Technology: A Review Article
Ignácz, F., Feszty, D., & Lakatos, I. (2022) · Periodica Polytechnica Transportation Engineering · doi:10.3311/pptr.16547 · Cited by 3
Quantum partial search algorithm with smaller oracles for multiple target items
Li, D., Qian, L., Zhou, Y., et al. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03496-8 · Cited by 3
Graph properties and circular functions: how low can quantum query complexity go?
Sun, X., Yao, A. C.-C., & Zhang, S. (2004) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.2004.1313851 · Cited by 23
Yang, Y.-F., Duan, L., Qiu, T., et al. (2022) · Frontiers in Physics · doi:10.3389/fphy.2022.875441 · Cited by 3
(Quantum) Time-Memory-Data Tradeoff Attacks on the SNOW-V Stream Cipher
Li, S., Liao, Z., Wu, Z., et al. (2022) · Symmetry · doi:10.3390/sym14061127 · Cited by 3
Emergent Intelligence in Generalized Pure Quantum Systems
Svítek, M. (2022) · Computation · doi:10.3390/computation10060088 · Cited by 3
Boosting for quantum weak learners
Ohno, H. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03548-z · Cited by 3
Quantum Linear System Algorithm for General Matrices in System Identification
Li, K., Zhang, M., Liu, X., Liu, Y., Dai, H., Zhang, Y., & Dong, C. (2022) · Entropy · doi:10.3390/e24070893 · Cited by 3
Three principles of quantum computing
Ozhigov, Y. (2022) · Quantum Information and Computation · doi:10.26421/qic22.15-16-2 · Cited by 3
Towards a Scalable and Secure Blockchain Based on Post-Quantum Cryptography.
Ahubele, B. O., & Musa, M. O. (2022) · IJARCCE · doi:10.17148/ijarcce.2022.11703 · Cited by 4
Post-Quantum Cryptographic Accelerators
Khalid, A., & Kundi, D. (2022) · Springer eBooks · doi:10.1007/978-981-15-6401-7_8-1 · Cited by 3
$$T{-}depth$$ Reduction Method for Efficient $$SHA{-}256$$ Quantum Circuit Construction
Lee, J., Lee, S., Lee, Y.-S., & Choi, D. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-08896-4_20 · Cited by 3
Tseng, W.-H., & Chang, Y. (2022) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/3489517.3530483 · Cited by 3
An Efficient Method to Decompose and Map MPMCT Gates That Accounts for Qubit Placement
Matsuo, A., Hattori, W., & Yamashita, S. (2022) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1587/transfun.2022eap1050 · Cited by 3
Quantum voting protocol without quantum memory
Xu, L., & Wang, M. (2022) · Frontiers in Physics · doi:10.3389/fphy.2022.1023992 · Cited by 3
Iterative Qubits Management for Quantum Index Searching in a Hybrid System
Mu, W., Mao, Y., Cheng, L., Wang, Q., Jiang, W., & Chen, P. (2022) · IEEE International Performance, Computing, and Communications Conference · doi:10.1109/ipccc55026.2022.9894308 · Cited by 3
Decomposition Analysis of Quantum Native Gates on Various Quantum Computers
Heng, S., Kim, D., Heng, S., et al. (2022) · International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC) · doi:10.1109/itc-cscc55581.2022.9894863 · Cited by 3
Minimal resources for exact simulation of quantum walks
Grigoletto, T., & Ticozzi, F. (2022) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc51059.2022.9993322 · Cited by 3
Exploiting Reversible Computing for Verification
Burgholzer, L., & Wille, R. (2023) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1145/3566097.3567914 · Cited by 3
Quantum decomposition algorithm for master equations of stochastic processes: The damped spin case
AlMasri, M. W., & Wahiddin, M. R. (2022) · Modern Physics Letters A · doi:10.1142/s0217732322502169 · Cited by 3
Molotkov, S. N. (2023) · Journal of Experimental and Theoretical Physics Letters · doi:10.1134/s0021364022602846 · Cited by 3
The Prospects of Quantum Secure Communication for Secret Sharing
Chou, Y., Tseng, K.-C., Kuo, S., Kuo, S., & Sheu, B. J. (2023) · IEEE Nanotechnology Magazine · doi:10.1109/mnano.2023.3249520 · Cited by 4
Quancorde: Boosting fidelity with Quantum Canary Ordered Diverse Ensembles
Ravi, G. S., Baker, J. M., Smith, K. N., Earnest, N., Javadi-Abhari, A., & Chong, F. T. (2022) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc57508.2022.00014 · Cited by 19
Quantum Computing-Enabled Machine Learning for an Enhanced Model Training Approach
Soni, J., Prabakar, N., & Upadhyay, H. (2023) · Studies in computational intelligence · doi:10.1007/978-981-19-9530-9_12 · Cited by 3
Quantum Algorithm for Dynamic Programming Approach for DAGs and Applications
Khadiev, K. R., & Safina, L. (2023) · Lobachevskii Journal of Mathematics · doi:10.1134/s1995080223020191 · Cited by 6
Role of Quantum Computing in Transformation of Artificial Intelligence - A Review
Krishan, R. (2023) · BENTHAM SCIENCE PUBLISHERS eBooks · doi:10.2174/9789815080537123010018 · Cited by 3
Ghidle: Efficient Large-State Block Ciphers for Post-quantum Security
Nakahashi, M., Shiba, R., Anand, R., et al. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-35486-1_18 · Cited by 3
Quantum Traveler’s dilemma and the role of non-maximal entanglement
Banu, H., & Rao, K. R. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04016-y · Cited by 3
Quantum Algorithm for Position Weight Matrix Matching
Miyamoto, K., Yamamoto, N., & Sakakibara, Y. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3293562 · Cited by 3
An Adaptive Hybrid Quantum Algorithm for the Metric Traveling Salesman Problem
Li, F., & Mazumder, A. R. (2023) · Proceedings - IEEE International Parallel and Distributed Processing Symposium · doi:10.1109/ipdps54959.2023.00082 · Cited by 3
Security Loophole and Improvement of Quantum Private Query Protocol Based on W State
Zhang, X. J., Qin, S., Zhang, X., et al. (2023) · International Journal of Theoretical Physics · doi:10.1007/s10773-023-05396-8 · Cited by 3
Barbeau, M. (2023) · F1000Research · doi:10.12688/f1000research.140027.1 · Cited by 3
Orchestrating Measurement-Based Quantum Computation over Photonic Quantum Processors
Li, Y., Pawar, A., Azari, M., Guo, Y., Zhang, Y., Yang, J., Seshadreesan, K. P., & Tang, X. (2023) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac56929.2023.10247944 · Cited by 5
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
