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 1,801–1,900 of 8,792
Quantum monte carlo for economics: Stress testing and macroeconomic deep learning
Skavysh, V., Priazhkina, S., Guala, D., & Bromley, T. R. (2023) · Journal of Economic Dynamics and Control · doi:10.1016/j.jedc.2023.104680 · Cited by 25
OneQ: A Compilation Framework for Photonic One-Way Quantum Computation
Zhang, H., Wu, A., Wang, Y., Li, G., Shapourian, H., Shabani, A., & Ding, Y. (2023) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/3579371.3589047 · Cited by 24
A biological sequence comparison algorithm using quantum computers
Kösoglu-Kind, B., Loredo, R., Grossi, M., Bernecker, C., Burks, J. M., & Buchkremer, R. (2023) · Scientific Reports · doi:10.1038/s41598-023-41086-5 · Cited by 23
Hybrid Gate-Pulse Model for Variational Quantum Algorithms
Liang, Z., Song, Z., Cheng, J., He, Z., Liu, J., Wang, H., Qin, R., Wang, Y., Han, S., Qian, X., et al. (2023) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac56929.2023.10247923 · Cited by 27
Innan, N., Khan, M. A.-Z., & Bennai, M. (2023) · Materials Today Communications · doi:10.1016/j.mtcomm.2023.107760 · Cited by 24
Compact Hybrid Signature for Secure Transition to Post-Quantum Era
Kwon, H.-Y., Bajuna, I., & Lee, M. (2024) · IEEE Access · doi:10.1109/access.2024.3374645 · Cited by 30
Quantum Computing: Exploring Superposition and Entanglement for Cutting-Edge Applications
Parmar, S. J., Parmar, V. R., Verma, J. P. V., Roy, S., & Bhattacharya, P. (2023) · International Conference on Security of Information and Networks (SIN) · doi:10.1109/sin60469.2023.10474803 · Cited by 20
Transition role of entangled data in quantum machine learning
Wang, X., Du, Y., Tu, Z., Luo, Y., Yuan, X., & Tao, D. (2024) · Nature Communications · doi:10.1038/s41467-024-47983-1 · Cited by 30
Noise-Aware Distributed Quantum Approximate Optimization Algorithm on Near-Term Quantum Hardware
Chen, K., Xu, X., Burt, F., Liu, C.-Y., Yu, S., & Leung, K. K. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.10268 · Cited by 25
Predominant Aspects on Security for Quantum Machine Learning: Literature Review
Franco, N., Sakhnenko, A., Stolpmann, L., Thuerck, D., Petsch, F., Rüll, A., & Lorenz, J. M. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00173 · Cited by 29
Towards quantum‐safe blockchain: Exploration of PQC and public‐key recovery on embedded systems
Marchsreiter, D. (2025) · IET Blockchain · doi:10.1049/blc2.12094 · Cited by 30
Quantum Walks with Multiple or Moving Marked Locations
Ambainis, A., & Rivosh, A. (2008) · Springer eBooks · doi:10.1007/978-3-540-77566-9_42 · Cited by 20
A theoretical framework for quantum image representation and data loading scheme
Hu, B.-Q., Huang, X., Zhou, R., Wei, Y., Wan, Q., & Pang, C.-Y. (2014) · Science China Information Sciences · doi:10.1007/s11432-013-4866-x · Cited by 23
Quantum algorithms: A survey of some recent results
Rötteler, M. (2006) · Informatik - Forschung und Entwicklung · doi:10.1007/s00450-006-0008-7 · Cited by 20
Kudrow, D., Bier, K., Deng, Z., Franklin, D. M., Tomita, Y., Brown, K. R., & Chong, F. T. (2013) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/2485922.2485937 · Cited by 21
Spatial quantum search in a triangular network
Abal, G., Donangelo, R., Forets, M., & Portugal, R. (2012) · Mathematical Structures in Computer Science · doi:10.1017/s0960129511000600 · Cited by 20
An Introduction to Quantum Computing
Charemza, M. (2005) · Cited by 21
High-fidelity spin measurement on the nitrogen-vacancy center
Hanks, M., Trupke, M., Schmiedmayer, J., Munro, W. J., & Nemoto, K. (2017) · New Journal of Physics · doi:10.1088/1367-2630/aa8085 · Cited by 19
An Improved Filtering Method for Quantum Color Image in Frequency Domain
Li, P., & Xiao, H. Y. (2017) · International Journal of Theoretical Physics · doi:10.1007/s10773-017-3561-x · Cited by 20
Quantum Query Algorithms Are Completely Bounded Forms
Arunachalam, S., Briët, J., & Palazuelos, C. (2019) · SIAM Journal on Computing · doi:10.1137/18m117563x · Cited by 33
Faster quantum mixing for slowly evolving sequences of Markov chains
Orsucci, D., Briegel, H. J., & Dunjko, V. (2018) · Quantum · doi:10.22331/q-2018-11-09-105 · Cited by 27
Use of quantum-inspired metaheuristics during last two decades
Karmakar, S., Dey, A., & Saha, I. (2017) · International Conference on Communication Systems and Network Technologies · doi:10.1109/csnt.2017.8418551 · Cited by 20
On Quantum Related-Key Attacks on Iterated Even-Mansour Ciphers
Hosoyamada, A., & Aoki, K. (2018) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1587/transfun.e102.a.27 · Cited by 20
Efficient Implementation of the SHA-512 Hash Function for 8-Bit AVR Microcontrollers
Cheng, H., Dinu, D., & Großschädl, J. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-12942-2_21 · Cited by 23
A Novel Quantum Visual Secret Sharing Scheme
Liu, W., Xu, Y., Zhang, M., Chen, J., & Yang, C. (2019) · IEEE Access · doi:10.1109/access.2019.2931073 · Cited by 23
Quantum Simulation Logic, Oracles, and the Quantum Advantage
Johansson, N., & Larsson, J.-Å. (2019) · Entropy · doi:10.3390/e21080800 · Cited by 25
A Reaction Attack Against Cryptosystems Based on LRPC Codes
Samardjiska, S., Santini, P., Persichetti, E., & Banegas, G. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-30530-7_10 · Cited by 20
Entanglement-based quantum deep learning
Yang, Z., & Zhang, X. (2020) · New Journal of Physics · doi:10.1088/1367-2630/ab7598 · Cited by 20
Quantum Secure Multi-party Private Set Intersection Cardinality
Liu, B., Zhang, M., & Shi, R. (2020) · International Journal of Theoretical Physics · doi:10.1007/s10773-020-04471-8 · Cited by 20
Exploring Quantum Reversibility with Young Learners
Franklin, D. M., Palmer, J., Jang, W., Lehman, E., Marckwordt, J., Landsberg, R. H., Muller, A., & Harlow, D. B. (2020) · ACM Conference on International Computing Education Research (ICER) · doi:10.1145/3372782.3406255 · Cited by 21
Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs. Coded Systems
Xiong, Y., Chandra, D., Ng, S. X., & Hanzo, L. (2020) · IEEE Access · doi:10.1109/access.2020.3045016 · Cited by 22
Quantum speedup in adaptive boosting of binary classification
Wang, X., Ma, Y., Hsieh, M.-H., & Yung, M. (2020) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-020-1638-5 · Cited by 22
Arrays vs. Decision Diagrams: A Case Study on Quantum Circuit Simulators
Grurl, T., Fus, J., Hillmich, S., et al. (2020) · Proceedings/Proceedings - International Symposium on Multiple-Valued Logic · doi:10.1109/ismvl49045.2020.000-9 · Cited by 20
Ghodsollahee, I., Davarzani, Z., Moghadam, M. Z., Pławiak, P., Houshmand, M., & Houshmand, M. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03170-5 · Cited by 21
Experimental Study of the Optical Qubit on the 435-nm Quadrupole Transition in the 171Yb+ Ion
Zalivako, I. V., Semerikov, I. A., Borisenko, A. S., Aksenov, M. A., Khabarova, K. Y., & Kolachevsky, N. (2021) · Journal of Experimental and Theoretical Physics Letters · doi:10.1134/s0021364021140113 · Cited by 19
Pattern Recognition with Quantum Neural Networks
Ezhov, A. A. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44732-6_7 · Cited by 20
Span-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas
Reichardt, B. W. (2014) · Lecture notes in computer science · doi:10.1007/978-3-642-54429-3_6 · Cited by 27
Bi-direction quantum crossover-based clonal selection algorithm and its applications
Dai, H., Yu, Y., Li, H., et al. (2014) · Expert Systems with Applications · doi:10.1016/j.eswa.2014.05.053 · Cited by 20
Faster quantum algorithm for evaluating game trees
Reichardt, B. W. (2011) · doi:10.5555/2133036.2133079 · Cited by 20
Quantum Algorithms for Matching Problems
Dörn, S. (2008) · Theory of Computing Systems · doi:10.1007/s00224-008-9118-x · Cited by 20
Global Trends in Intelligent Computing Research and Development
Tripathy, B. K., & Acharjya, D. P. (2013) · Advances in computational intelligence and robotics book series · doi:10.4018/978-1-4666-4936-1 · Cited by 20
Humble, T. S. (2018) · IEEE Consumer Electronics Magazine · doi:10.1109/mce.2017.2755298 · Cited by 22
An Analysis of Absorbing Times of Quantum Walks
Yamasaki, T., Kobayashi, H., & Imai, H. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45833-6_26 · Cited by 20
Application of Quantum Genetic Algorithm on Finding Minimal Reduct
Yue-jin, L., & Liu, N.-X. (2007) · IEEE International Conference on Granular Computing (GrC) · doi:10.1109/grc.2007.87 · Cited by 20
Fast quantum algorithms for handling probabilistic and interval uncertainty
Крейнович, В., & Longpré, L. (2004) · Mathematical logic quarterly · doi:10.1002/malq.200310116 · Cited by 20
The Complexity of the Consistency and N-representability Problems for Quantum StatesPreprint
Liu, Y.-K. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0712.3041 · Cited by 20
Quantum Algorithms to Matrix MultiplicationPreprint
Shao, C. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1803.01601 · Cited by 24
Quantum walk algorithm for element distinctnessPreprint
Ambainis, A. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0311001 · Cited by 20
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.005.0002 · Cited by 20
Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study
Gemeinhardt, F., Garmendia, A., Wimmer, M., Weder, B., & Leymann, F. (2024) · ACM Computing Surveys · doi:10.1145/3620668 · Cited by 22
Quantum-clustered two-photon walks
Simon, D. S., Osawa, S., & Sergienko, A. V. (2020) · Physical Review A · doi:10.1103/physreva.101.032118 · Cited by 20
Señor, J., Portilla, J., & Portela-Garcia, M. (2024) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2024.3423315 · Cited by 19
On the Power of Non-adaptive Learning Graphs
Belovs, A., & Rosmanis, A. (2013) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.2013.14 · Cited by 19
A quantum algorithm that deletes marked states from an arbitrary database
Liu, Y., & Ouyang, X. (2013) · Chinese Science Bulletin · doi:10.1007/s11434-013-5885-0 · Cited by 19
A novel quantum scheme for secure two-party distance computation
Peng, Z., Shi, R., Zhong, H., et al. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1766-9 · Cited by 19
Similarity analysis between quantum images
Zhou, R., Liu, X., Zhu, C., et al. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-1894-x · Cited by 19
Quantum Approach Explains the Need for Expert Knowledge: On the Example of Econometrics
Sriboonchitta, S., Nguyen, H. T., Kosheleva, O. M., et al. (2018) · Studies in computational intelligence · doi:10.1007/978-3-030-04263-9_15 · Cited by 19
An Overview of Quantum Key Distribution Protocols
Trizna, A., & Ozols, A. O. (2018) · Information Technology and Management Science · doi:10.7250/itms-2018-0005 · Cited by 19
Quantum Algorithm for Boolean Equation Solving and Quantum Algebraic Attack on Cryptosystems
Chen, Y.-A., & Gao, X.-S. (2021) · Journal of Systems Science and Complexity · doi:10.1007/s11424-020-0028-6 · Cited by 28
Modified Grover operator for quantum amplitude estimation
Uno, S., Suzuki, Y., Hisanaga, K., Raymond, R., Tanaka, T., Onodera, T., & Yamamoto, N. (2021) · New Journal of Physics · doi:10.1088/1367-2630/ac19da · Cited by 21
Privacy-Preserving Quantum Two-Party Geometric Intersection
Liu, W., Xu, Y., Yang, J. C. N., et al. (2019) · Computers, materials & continua/Computers, materials & continua (Print) · doi:10.32604/cmc.2019.03551 · Cited by 19
Low-rank density-matrix evolution for noisy quantum circuits
Chen, Y.-T., Farquhar, C., & Parrish, R. M. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00392-4 · Cited by 24
Accelerated RISC-V for Post-Quantum SIKE
Khatib, R. E., Koziel, B., Azarderakhsh, R., & Kermani, M. M. (2022) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2022.3162626 · Cited by 19
Memristor Crossbar Arrays Performing Quantum Algorithms
Fyrigos, I.-A., Ntinas, V. G., Vasileiadis, N., et al. (2021) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2021.3123575 · Cited by 19
Recompilation-enhanced simulation of electron–phonon dynamics on IBM quantum computers
Jaderberg, B., Eisfeld, A., Jaksch, D., & Mostame, S. (2022) · New Journal of Physics · doi:10.1088/1367-2630/ac8a69 · Cited by 19
Variational quantum extreme learning machine
Wang, Y., Lin, K.-Y., Cheng, S., & Li, L. (2022) · Neurocomputing · doi:10.1016/j.neucom.2022.09.068 · Cited by 20
BF-QC: Belief functions on quantum circuits
Zhou, Q., Tian, G., & Deng, Y. (2023) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.119885 · Cited by 22
Quantum-Inspired Fully Complex-Valued Neutral Network for Sentiment Analysis
Lai, W., Shi, J., & Chang, Y. (2023) · Axioms · doi:10.3390/axioms12030308 · Cited by 23
Conditional quantum circuit Born machine based on a hybrid quantum–classical framework
Zeng, Q.-W., Ge, H.-Y., Gong, C., & Zhou, N. (2023) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2023.128693 · Cited by 21
Towards an Automated Framework for Realizing Quantum Computing Solutions
Quetschlich, N., Burgholzer, L., & Wille, R. (2023) · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · doi:10.1109/ismvl57333.2023.00035 · Cited by 19
VENUS: A Geometrical Representation for Quantum State Visualization
Ruan, S., Yuan, R., Guan, Q., Lin, Y., Mao, Y., Jiang, W., Wang, Z., Xu, W. F., & Wang, Y. (2023) · Computer Graphics Forum · doi:10.1111/cgf.14827 · Cited by 19
DNA Assembly of Dye Aggregates—A Possible Path to Quantum Computing
Yurke, B. (2023) · Natural computing series · doi:10.1007/978-981-19-9891-1_9 · Cited by 19
Qubit Reduction and Quantum Speedup for Wireless Channel Assignment Problem
Sano, Y., Norimoto, M., & Ishikawa, N. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3293452 · Cited by 21
Zhang, Z., Wu, W., Sui, H., et al. (2023) · Chinese Journal of Electronics · doi:10.23919/cje.2021.00.294 · Cited by 19
Variational quantum and quantum-inspired clustering
Bermejo, P., & Orús, R. (2023) · Scientific Reports · doi:10.1038/s41598-023-39771-6 · Cited by 19
Optimized quantum implementation of AES
Lin, D., Xiang, Z., Xu, R., Zhang, S., & Zeng, X. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04043-9 · Cited by 19
Augmenting an electronic Ising machine to effectively solve boolean satisfiability
Sharma, A., Burns, M., Hahn, A., & Huang, M. C. Y. (2023) · Scientific Reports · doi:10.1038/s41598-023-49966-6 · Cited by 20
A Fast Quantum Algorithm for Searching the Quasi-Optimal Solutions of Unit Commitment
Zheng, X., Wang, J., & Yue, M. (2024) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2024.3350382 · Cited by 19
Khmelev, A. V., Duplinsky, A. V., Bakhshaliev, R. M., Ivchenko, E. I., Pismeniuk, L. V., Mayboroda, V., Nesterov, I., Chernov, A. N., Trushechkin, A. S., Kiktenko, E. O., et al. (2024) · Optics Express · doi:10.1364/oe.511772 · Cited by 20
Testing and Debugging Quantum Circuits
Metwalli, S. A., & Meter, R. V. (2024) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2024.3374879 · Cited by 28
What is Quantum Parallelism, Anyhow?
Markidis, S. (2024) · ISC High Performance (ISC) · doi:10.23919/isc.2024.10528926 · Cited by 26
A benchmarking study of quantum algorithms for combinatorial optimization
Sankar, K., Scherer, A., Kako, S., Reifenstein, S., Ghadermarzy, N., Krayenhoff, W. B., Inui, Y., Ng, E., Onodera, T., Ronagh, P., et al. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00856-3 · Cited by 22
Quantum computing and quantum-inspired techniques for feature subset selection: a review
Mandal, A. K., & Chakraborty, B. (2024) · Knowledge and Information Systems · doi:10.1007/s10115-024-02282-5 · Cited by 21
Quantum Implementation and Analysis of SHA-2 and SHA-3
Jang, K., Lim, S.-J., Oh, Y., Kim, H., Baksi, A., Chakraborty, S., & Seo, H. (2025) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2025.3546648 · Cited by 24
Improved output-sensitive quantum algorithms for Boolean matrix multiplication
Gall, F. L. (2012) · doi:10.5555/2095116.2095232 · Cited by 18
Noncoherent Quantum Multiple Symbol Differential Detection for Wireless Systems
Botsinis, P., Alanis, D., Babar, Z., Ng, S. X., & Hanzo, L. (2015) · IEEE Access · doi:10.1109/access.2015.2432015 · Cited by 19
Element Distinctness, Frequency Moments, and Sliding Windows
Beame, P. W., Raphaël Clifford, A., & Machmouchi, W. (2013) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2013.39 · Cited by 19
Quest for Fast Partial Search Algorithm
Korepin, V. E., & Liao, J. (2006) · Quantum Information Processing · doi:10.1007/s11128-006-0024-3 · Cited by 20
An MINLP Model for Scheduling and Placement of Quantum Circuits with a Heuristic Solution Approach
Bahreini, T., & Mohammadzadeh, N. (2015) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/2766452 · Cited by 21
A note on quantum sequential machines
Li, L., & Qiu, D. (2008) · Theoretical Computer Science · doi:10.1016/j.tcs.2008.08.026 · Cited by 19
Towards More Reliable Fixed Phase Quantum Search Algorithm,
Younes, A. (2013) · Applied Mathematics & Information Sciences · doi:10.12785/amis/070110 · Cited by 19
Quantum finite automata: Advances on Bertoni's ideas
Bianchi, M. P., Mereghetti, C., & Palano, B. (2016) · Theoretical Computer Science · doi:10.1016/j.tcs.2016.01.045 · Cited by 19
Entanglement cost and entangling power of bipartite unitary and permutation operators
Chen, L., & Yu, L. Z. (2016) · Physical Review A · doi:10.1103/physreva.93.042331 · Cited by 19
Quantum Computing and Shor's Algorithm
Hayward, M. W. (2015) · Cited by 19
Experimentally superposing two pure states with partial prior knowledge
Li, K., Long, G., Katiyar, H., Xin, T., Feng, G., Lu, D., & Laflamme, R. (2017) · Physical Review A · doi:10.1103/physreva.95.022334 · Cited by 19
Quantum Key Search with Side Channel Advice
Martin, D. P., Montanaro, A., Oswald, E., & Shepherd, D. J. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-72565-9_21 · Cited by 20
Corrigan-Gibbs, H., Wu, D. J., & Boneh, D. (2017) · Workshop on Hot Topics in Operating Systems · doi:10.1145/3102980.3102993 · Cited by 19
Trends, challenges and needs for lattice-based cryptography implementations
Nejatollahi, H., Dutt, N. D., & Cammarota, R. (2017) · doi:10.1145/3125502.3125559 · Cited by 19
Novel quantum secret image-sharing scheme
Luo, G., Zhou, R., & Hu, W. (2019) · Chinese Physics B · doi:10.1088/1674-1056/28/4/040302 · Cited by 19
A Feasible Quantum Protocol for Private Set Intersection Cardinality
Shi, R., & Zhang, M. (2019) · IEEE Access · doi:10.1109/access.2019.2919119 · Cited by 19
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
