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,101–2,200 of 8,792
An Improved Claw Finding Algorithm Using Quantum Walk
Tani, S. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-74456-6_48 · Cited by 16
On the Power of Non-adaptive Learning Graphs
Belovs, A., & Rosmanis, A. (2014) · Computational Complexity · doi:10.1007/s00037-014-0084-1 · Cited by 27
The block symmetric ciphers in the post-quantum period
Andrushkevych, A., Кузнецова, Т., Bilozertsev, I., et al. (2016) · International Scientific-Practical Conference Problems of Infocommunications Science and Technology · doi:10.1109/infocommst.2016.7905331 · Cited by 16
Mahmud, N., Haase-Divine, B., Kuhnke, A., et al. (2020) · Journal of Signal Processing Systems · doi:10.1007/s11265-020-01569-4 · Cited by 16
Logical abstractions for noisy variational Quantum algorithm simulation
Huang, Y., Holtzen, S., Millstein, T. D., den Broeck, G. V., & Martonosi, M. (2021) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3445814.3446750 · Cited by 17
Quantum Error Mitigation Relying on Permutation Filtering
Xiong, Y., Ng, S. X., & Hanzo, L. (2021) · IEEE Transactions on Communications · doi:10.1109/tcomm.2021.3132914 · Cited by 17
Quantum Version of the k‐NN Classifier Based on a Quantum Sorting Algorithm
Quezada, L. F., Sun, G.-H., & Dong, S. (2022) · Annalen der Physik · doi:10.1002/andp.202100449 · Cited by 16
Quantum spectral clustering algorithm for unsupervised learning
Li, Q., Huang, Y., Jin, S., Hou, X., & Wang, X. (2022) · Science China Information Sciences · doi:10.1007/s11432-022-3492-x · Cited by 17
Efficient Constructions for Simulating Multi Controlled Quantum Gates
Balauca, S., & Arusoaie, A. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-08760-8_16 · Cited by 17
Chou, Y.-H., Kuo, S.-Y., Jiang, Y.-C., Wu, C.-H., Shen, J.-Y., Hua, C.-Y., Huang, P.-S., Lai, Y.-T., Tong, Y.-F., & Chang, M. (2022) · GECCO Companion · doi:10.1145/3520304.3533956 · Cited by 19
Programming physical quantum systems with pulse-level control
Smith, K. N., Ravi, G. S., Alexander, T., Bronn, N. T., Carvalho, A. R. R., Cervera-Lierta, A., Chong, F. T., Chow, J. M., Cubeddu, M., Hashim, A., et al. (2022) · Frontiers in Physics · doi:10.3389/fphy.2022.900099 · Cited by 24
Equivalence checking paradigms in quantum circuit design
Peham, T., Burgholzer, L., & Wille, R. (2022) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/3489517.3530480 · Cited by 18
Efficient module learning with errors‐based post‐quantum password‐authenticated key exchange
Ren, P., Gu, X., & Wang, Z. (2022) · IET Information Security · doi:10.1049/ise2.12094 · Cited by 16
Jiang, J., Wang, D., Zhang, G., & Chen, Z. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-17146-8_15 · Cited by 16
Nouioua, T., & Belbachir, A. H. (2022) · Chinese Journal of Physics · doi:10.1016/j.cjph.2022.11.006 · Cited by 17
A Secured Half-Duplex Bidirectional Quantum Key Distribution Protocol against Collective Attacks
Khawasik, M., El-Sayed, W. G., Rashad, M. Z., et al. (2022) · Symmetry · doi:10.3390/sym14122481 · Cited by 16
Liu, A., Chen, X., Xu, S., Wang, Z., Li, Z., Xu, L., Zhang, Y., & Chen, Y. (2023) · Entropy · doi:10.3390/e25050811 · Cited by 16
Interconnect Fabrics for Multi-Core Quantum Processors
Escofet, P., Rached, S. B., Rodrigo, S., Almudéver, C. G., Alarcón, E., & Abadal, S. (2023) · International Workshop on Network on Chip Architectures (NoCArc) · doi:10.1145/3610396.3623267 · Cited by 23
Quantum Approximate Bayesian Optimization Algorithms With Two Mixers and Uncertainty Quantification
Kim, J. E., & Wang, Y. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3327055 · Cited by 17
Leveraging Larger AES Keys in LoRaWAN: A Practical Evaluation of Energy and Time Costs
Thaenkaew, P., Quoitin, B., & Meddahi, A. (2023) · Sensors · doi:10.3390/s23229172 · Cited by 16
Quantum‐Based Combinatorial Optimization for Optimal Sensor Placement in Civil Structures
Martín, G. S., & Droguett, E. L. (2024) · Structural Control and Health Monitoring · doi:10.1155/2024/6681342 · Cited by 21
SMAUG: Pushing Lattice-Based Key Encapsulation Mechanisms to the Limits
Cheon, J. H., Choe, H., Hong, D., et al. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-53368-6_7 · Cited by 16
Enabling continuous deployment techniques for quantum services
Romero‐Álvarez, J., Alvarado‐Valiente, J., Moguel, E., García-Alonso, J. M., & Murillo, J. M. (2024) · Software Practice and Experience · doi:10.1002/spe.3326 · Cited by 16
Yang, H., Liu, Y., Yue, Y., Zhang, D., & Ma, Y. (2024) · Electric Power Systems Research · doi:10.1016/j.epsr.2024.110957 · Cited by 17
Liliopoulos, I., Varsamis, G. D., Milchanowski, K. L., Martin-Cuevas, R., Safouri, K., Dimitrakis, P., & Karafyllidis, I. G. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00230-8 · Cited by 18
Quantum computer architectures: A survey
Jain, S. (2015) · International Conference on Computing for Sustainable Global Development · Cited by 16
Auxiliary qubit selection: a physical synthesis technique for quantum circuits
Mohammadzadeh, N., Zamani, M. S., & Sedighi, M. (2010) · Quantum Information Processing · doi:10.1007/s11128-010-0183-0 · Cited by 15
Strong ETH holds for regular resolution
Beck, C., & Impagliazzo, R. (2013) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2488608.2488669 · Cited by 16
Long-Term Public Blockchain: Resilience against Compromise of Underlying Cryptography
Sato, M., & Matsuo, S. (2017) · IEEE European Symposium on Security and Privacy Workshops (EuroS&PW) · doi:10.1109/eurospw.2017.49 · Cited by 16
A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY
Yamakami, T. (2020) · Journal of Symbolic Logic · doi:10.1017/jsl.2020.45 · Cited by 16
Practical designs for permutation-symmetric problem Hamiltonians on hypercubes
Dodds, A. B., Kendon, V. M., Adams, C. S., & Chancellor, N. (2019) · Physical Review A · doi:10.1103/physreva.100.032320 · Cited by 14
Trajectory optimization using quantum computing
Shukla, A., & Vedula, P. (2019) · Journal of Global Optimization · doi:10.1007/s10898-019-00754-5 · Cited by 16
Discrete-time quantum walk on the Cayley graph of the dihedral group
Dai, W., Yuan, J., & Li, D. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-2101-9 · Cited by 18
State-of-the-art quantum computing simulators: Features, optimizations, and improvements for D-GM
Ávila, A., Reiser, R., Pilla, M. L., & Yamin, A. (2019) · Neurocomputing · doi:10.1016/j.neucom.2019.01.118 · Cited by 16
Memristor Hardware Accelerator of Quantum Computations
Fyrigos, I.-A., Ntinas, V. G., Sirakoulis, G. C., Dimitrakis, P., & Karafyllidis, I. G. (2019) · IEEE International Conference on Electronics, Circuits and Systems (ICECS) · doi:10.1109/icecs46596.2019.8965109 · Cited by 16
Apon, D., Perlner, R. A., Robinson, A., & Santini, P. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-56877-1_14 · Cited by 19
Post Quantum Security Solution for Data Aggregation in Wireless Sensor Networks
Agarkar, A. A., Karyakarte, M. S., & Agrawal, H. (2020) · IEEE Wireless Communications and Networking Conference · doi:10.1109/wcnc45663.2020.9120843 · Cited by 16
Survey on Hybrid Classical-Quantum Machine Learning Models
Metawei, M. A., Said, H., Taher, M., Eldeib, H. E. S., & Nassar, S. M. (2020) · International Conference on Communications, Computing, Cybersecurity, and Informatics (CCCI) · doi:10.1109/ccci49893.2020.9256649 · Cited by 17
Quantum Algorithms for String Processing
Ablayev, F. M., Ablayev, M., Khadiev, K. R., Salikhova, N., & Vasiliev, A. (2021) · Lecture notes in computational science and engineering · doi:10.1007/978-3-030-87809-2_1 · Cited by 16
A novel quantum neural network based on multi-level activation function
Niu, X.-F., & Ma, W. (2021) · Laser Physics Letters · doi:10.1088/1612-202x/abd23c · Cited by 17
Chen, E., Zhu, Y., Zhu, G., Liang, K., & Feng, R. (2021) · Computers & Security · doi:10.1016/j.cose.2021.102318 · Cited by 17
Implementation of Grover’s Algorithm to Solve the Maximum Clique Problem
Haverly, A., & López, S. M. (2021) · IEEE Computer Society Annual Symposium on VLSI · doi:10.1109/isvlsi51109.2021.00087 · Cited by 16
A Complete Quantum Circuit to Solve the Information Set Decoding Problem
Perriello, S., Barenghi, A., & Pelosi, G. (2021) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce52317.2021.00056 · Cited by 19
Le, X.-B. D., Lin, S., Sun, J., & Sanán, D. (2022) · Proceedings of the ACM on Programming Languages · doi:10.1145/3498697 · Cited by 16
Tamate, S., Tabuchi, Y., & Nakamura, Y. (2021) · IEICE Transactions on Electronics · doi:10.1587/transele.2021sep0007 · Cited by 16
When Quantum Computation Meets Data Science: Making Data Science Quantum
Wang, Y. (2022) · Harvard Data Science Review · doi:10.1162/99608f92.ef5d8928 · Cited by 18
On the Isogeny Problem with Torsion Point Information
Fouotsa, T. B., Kutas, P., Merz, S.-P., & Ti, Y. B. (2022) · Lecture notes in computer science · doi:10.1007/978-3-030-97121-2_6 · Cited by 16
A Faster Half Subtractor Circuit Using Reversible Quantum Gates
Orts, F. J., Ortega, G., & Garzón, E. M. (2019) · Baltic Journal of Modern Computing · doi:10.22364/bjmc.2019.7.1.08 · Cited by 16
Nikolaeva, A. S., Kiktenko, E. O., & Fedorov, A. K. (2023) · Entropy · doi:10.3390/e25020387 · Cited by 23
Parallel quantum computer simulation on the GPU
Amariutei, A., & Caraiman, S. (2011) · Cited by 16
Brain-, Gene-, and Quantum Inspired Computational Intelligence: Challenges and Opportunities
Kasabov, N. K. (2007) · Studies in computational intelligence · doi:10.1007/978-3-540-71984-7_9 · Cited by 16
Quantum logic and automata theory
Ying, M. (2007) · Elsevier eBooks · doi:10.1016/b978-044452870-4/50037-6 · Cited by 16
Discrete-time quantum walks on one-dimensional lattices
Xu, X.-P. (2010) · The European Physical Journal B · doi:10.1140/epjb/e2010-00267-2 · Cited by 17
Free Search with Adaptive Differential Evolution Exploitation and Quantum-Inspired Exploration
Yin, J., Wang, Y., & Hu, J. (2011) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2011.12.004 · Cited by 16
Quantum circuit physical design methodology with emphasis on physical synthesis
Mohammadzadeh, N., Zamani, M. S., & Sedighi, M. (2013) · Quantum Information Processing · doi:10.1007/s11128-013-0661-2 · Cited by 16
Physical and architectural considerations in quantum repeaters
Razavi, M., Thompson, K., Farmanbar, H., Piani, M., & Lütkenhaus, N. (2008) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.811880 · Cited by 13
A quantum evolutionary algorithm for data clustering
Ramdane, C., Meshoul, S., Batouche, M., et al. (2010) · International Journal of Data Mining Modelling and Management · doi:10.1504/ijdmmm.2010.035564 · Cited by 16
Nontrivial Quantum Effects in Biology: A Skeptical Physicists' View
Wiseman, H. M., & Eisert, J. (2008) · IMPERIAL COLLEGE PRESS eBooks · doi:10.1142/9781848162556_0017 · Cited by 18
Applying evolutionary techniques to quantum computing problems
Hutsell, S. R., & Greenwood, G. W. (2007) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2007.4425003 · Cited by 16
Alajmi, M., Alfares, F. S., & Alfares, M. S. (2017) · Journal of Intelligent Manufacturing · doi:10.1007/s10845-017-1326-2 · Cited by 16
Quantum humanities: a vision for quantum computing in digital humanities
Barzen, J., & Leymann, F. (2019) · SICS Software-Intensive Cyber-Physical Systems · doi:10.1007/s00450-019-00419-4 · Cited by 16
Concurrency in DD-based Quantum Circuit Simulation
Hillmich, S., Zulehner, A., & Wille, R. (2020) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1109/asp-dac47756.2020.9045711 · Cited by 17
Finding Small and Large $k$-Clique Instances on a Quantum Computer
Metwalli, S. A., Gall, F. L., & Meter, R. V. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.3045692 · Cited by 16
Analysis of lackadaisical quantum walks
Høyer, P., & Yu, Z. (2020) · Quantum Information and Computation · doi:10.26421/qic20.13-14-4 · Cited by 16
EKERT, A. K., Hayden, P. M., Inamori, H., & Oi, D. K. L. (2001) · doi:10.1142/9789812811264_0016 · Cited by 16
Resource Letter ITP-1: Information Theory in Physics
Grandy, W. T. (1997) · American Journal of Physics · doi:10.1119/1.18776 · Cited by 16
Teleportation via generalized measurements, and conclusive teleportationPreprint
Mor, T., & Horodecki, P. (1999) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9906039 · Cited by 16
Semantics and simulation of communication in quantum programmingPreprint
Mauerer, W. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0511145 · Cited by 16
Quantum Image Representation Through Two-Dimensional Quantum States and Normalized AmplitudePreprint
Srivastava, M., Moulick, S. R., & Panigrahi, P. K. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1305.2251 · Cited by 16
Improving Coherence of Superconducting Qubits and Resonators
Geerlings, K. (2013) · ProQuest Demo Repository · Cited by 21
Quantum Distributed Algorithm for Triangle Finding in the CONGEST ModelPreprint
Izumi, T., Gall, F. L., & Magniez, F. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1908.11488 · Cited by 16
Optimizing Quantum Search Using a Generalized Version of Grover's AlgorithmPreprint
Gilliam, A., Pistoia, M., & Gonciulea, C. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.06468 · Cited by 27
Quantum Meta‐Heuristics and Applications
Prakash, K. B. (2021) · doi:10.1002/9781119711308.ch10 · Cited by 16
Quantum-Resistance in Blockchain Networks
López, M. A., León, D. L., Cerón, S., Batista, A. L., Pareja, A., da Silva, M. M., Pardo, A., Jones, D., Worrall, D., Merriman, B., et al. (2021) · doi:10.18235/0003313 · Cited by 19
Optimal Quantum Spatial Search with One-Dimensional Long-Range Interactions
Lewis, D., Benhemou, A., Feinstein, N., Banchi, L., & Bose, S. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.240502 · Cited by 16
Index Advisors on Quantum Platforms
Kesarwani, M., & Haritsa, J. R. (2024) · Proceedings of the VLDB Endowment · doi:10.14778/3681954.3682025 · Cited by 16
Quantum-Assisted Joint Multi-Objective Routing and Load Balancing for Socially-Aware Networks
Alanis, D., Hu, J., Botsinis, P., Babar, Z., Ng, S. X., & Hanzo, L. (2016) · IEEE Access · doi:10.1109/access.2016.2629671 · Cited by 15
QED driven QAOA for network-flow optimization
Zhang, Y., Zhang, R., & Potter, A. C. (2021) · Quantum · doi:10.22331/q-2021-07-27-510 · Cited by 19
NR-QNN: Noise-Resilient Quantum Neural Network
Sajadimanesh, S., Rad, H. A., Faye, J. P. L., & Atoofian, E. (2025) · IEEE Access · doi:10.1109/access.2025.3546956 · Cited by 19
Distributed Quantum Computing: Applications and Challenges
Boschero, J. C., Neumann, N. M. P., van der Schoot, W., Sijpesteijn, T., & Wezeman, R. S. (2025) · Lecture notes in networks and systems · doi:10.1007/978-3-031-92602-0_6 · Cited by 15
Aaronson, S., Bouland, A., Fitzsimons, J. F., & Lee, M. (2016) · Conference on Innovations in Theoretical Computer Science · doi:10.1145/2840728.2840739 · Cited by 15
Permutation Symmetric Hypergraph States and Multipartite Quantum Entanglement
Dutta, S., Sarkar, R., & Panigrahi, P. K. (2019) · International Journal of Theoretical Physics · doi:10.1007/s10773-019-04259-5 · Cited by 15
Quantum Neural Networks for Dynamic Route Identification to avoid traffic
Boyapati, S., Swarna, S. R., & Kumar, A. (2020) · International Conference on I-SMAC (IoT in Social, Mobile, Analytics and Cloud) (I-SMAC) · doi:10.1109/i-smac49090.2020.9243322 · Cited by 16
Perrier, E. (2021) · Proceedings of the AAAI/ACM Conference on AI Ethics and Society · doi:10.1145/3461702.3462611 · Cited by 15
Periodicity of quantum walks defined by mixed paths and mixed cycles
Kubota, S., Sekido, H., & Yata, H. (2021) · Linear Algebra and its Applications · doi:10.1016/j.laa.2021.07.022 · Cited by 16
An improved ant colony algorithm based on artificial potential field and quantum evolution theory
Zhai, L., & Feng, S. (2022) · Journal of Intelligent & Fuzzy Systems · doi:10.3233/jifs-212220 · Cited by 15
Chiribella, G., & Spekkens, R. W. (2015) · Fundamental theories of physics · doi:10.1007/978-94-017-7303-4_1 · Cited by 16
A quantum algorithm of K-means toward practical use
Ohno, H. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03485-x · Cited by 16
Quantum reinforcement learning
Neumann, N. M. P., de Heer, P. B. U. L., & Phillipson, F. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03867-9 · Cited by 21
Bit Flipping Key Encapsulation for the Post-Quantum Era
Nosouhi, M. R., Shah, S. W. A., Pan, L., & Doss, R. (2023) · IEEE Access · doi:10.1109/access.2023.3282928 · Cited by 20
Quaternary Reversible Circuit Optimization for Scalable Multiplexer and Demultiplexer
Monfared, A. T., Ciriani, V., Mikkonen, T., et al. (2023) · IEEE Access · doi:10.1109/access.2023.3274118 · Cited by 15
Quantum algorithm for unsupervised anomaly detection
Guo, M., Pan, S., Li, W., Gao, F., Qin, S., Yu, X., Zhang, X., & Wen, Q. (2023) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2023.129018 · Cited by 17
Quantum Computing: Principles and Applications
Feng, G., Lu, D., Li, J., Xin, T., & Zeng, B. (2023) · SPIN · doi:10.1142/s2010324723300013 · Cited by 18
Efficient Quantum Circuit Cutting by Neglecting Basis Elements
Chen, D. T., Hansen, E. H., Li, X., Kulkarni, V. R., Chaudhary, V., Ren, B. W., Guan, Q., Kuppannagari, S. R., Liu, J., & Xu, S. (2023) · IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum · doi:10.1109/ipdpsw59300.2023.00091 · Cited by 17
A hybrid quantum–classical neural network for learning transferable visual representation
Wang, R., Richerme, P., & Chen, F. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/acf1c7 · Cited by 16
Recommending Solution Paths for Solving Optimization Problems with Quantum Computing
Poggel, B., Quetschlich, N., Burgholzer, L., Wille, R., & Lorenz, J. M. (2023) · IEEE International Conference on Quantum Software (QSW) · doi:10.1109/qsw59989.2023.00017 · Cited by 16
Detecting Violations of Differential Privacy for Quantum Algorithms
Guan, J., Fang, W. S., Huang, M., & Ying, M. (2023) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3576915.3623108 · Cited by 15
Emulation of Quantum Algorithms Using CMOS Analog Circuits
Mourya, S., Cour, B. R. L., & Sahoo, B. D. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3319599 · Cited by 15
A Quantum Fingerprinting Algorithm for Next Generation Cellular Positioning
Zook, Y., Shokry, A., & Youssef, M. A. (2023) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2023.3322763 · Cited by 14
On the role of entanglement in qudit-based circuit compression
Gao, X., Appel, P., Friis, N., Ringbauer, M., & Huber, M. (2023) · Quantum · doi:10.22331/q-2023-10-16-1141 · Cited by 15
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
