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,501–1,600 of 8,792
Towards Optimal Separations between Quantum and Randomized Query Complexities
Tal, A. (2020) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs46700.2020.00030 · Cited by 32
Quantum locally linear embedding for nonlinear dimensionality reduction
He, X., Li, S., Lyu, C., & Wang, X. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02818-y · Cited by 27
Towards quantum computing based community detection
Akbar, S., & Saritha, S. K. (2020) · Computer Science Review · doi:10.1016/j.cosrev.2020.100313 · Cited by 26
Optical Realization of Wave-Based Analog Computing with Metamaterials
Cheng, K., Fan, Y., Zhang, W., Gong, Y., Shen, F., & Li, H. (2020) · Applied Sciences · doi:10.3390/app11010141 · Cited by 25
QCEC: A JKQ tool for quantum circuit equivalence checking
Burgholzer, L., & Wille, R. (2020) · Software Impacts · doi:10.1016/j.simpa.2020.100051 · Cited by 28
Orchestrated trios: compiling for efficient communication in Quantum programs with 3-Qubit gates
Duckering, C., Baker, J. M., Litteken, A., & Chong, F. T. (2021) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3445814.3446718 · Cited by 27
A quantum voting protocol using single-particle states
Li, Y.-R., Jiang, D., Zhang, Y., & Liang, X.-Q. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03048-6 · Cited by 27
Quantum Computing Platforms: Assessing the Impact on Quality Attributes and SDLC Activities
Sodhi, B., & Kapur, R. (2021) · IEEE International Conference on Software Architecture (ICSA) · doi:10.1109/icsa51549.2021.00016 · Cited by 25
Quantum advantage on proof of work
Bard, D. A., Kearney, J. J., & Pérez-Delgado, C. A. (2022) · Array · doi:10.1016/j.array.2022.100225 · Cited by 31
Coreset Clustering on Small Quantum Computers
Anschuetz, E. R. (2021) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 26
A Grover Search-Based Algorithm for the List Coloring Problem
Mukherjee, S. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2022.3151137 · Cited by 25
Fuzzy Logic on Quantum Annealers
Pourabdollah, A., Acampora, G., & Schiattarella, R. (2021) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2021.3113561 · Cited by 25
A novel quantum algorithm for ant colony optimisation
Ghosh, M., Dey, N., Mitra, D., et al. (2021) · IET Quantum Communication · doi:10.1049/qtc2.12023 · Cited by 25
Quantum algorithm for neighborhood preserving embedding
Pan, S., Wan, L., Liu, H., Wu, Y., Qin, S., Wen, Q., & Gao, F. (2022) · Chinese Physics B · doi:10.1088/1674-1056/ac523a · Cited by 25
Single shot i-Toffoli gate in dispersively coupled superconducting qubits
Baker, A. J., Huber, G. B. P., Glaser, N. J., Roy, F., Tsitsilin, I., Filipp, S., & Hartmann, M. J. (2022) · Applied Physics Letters · doi:10.1063/5.0077443 · Cited by 28
Fifty years of P vs. NP and the possibility of the impossible
Fortnow, L. (2021) · Communications of the ACM · doi:10.1145/3460351 · Cited by 49
QPlayer: Lightweight, scalable, and fast quantum simulator
Jin, K., & Cha, G. (2022) · ETRI Journal · doi:10.4218/etrij.2021-0442 · Cited by 25
SoK: Benchmarking the Performance of a Quantum Computer
Wang, J., Guo, G., & Shan, Z. (2022) · Entropy · doi:10.3390/e24101467 · Cited by 27
wpScalable Quantum Neural Networks for Classification
Wu, J., Tao, Z., & Li, Q. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00022 · Cited by 27
Solving DC power flow problems using quantum and hybrid algorithms
Gao, F., Wu, G., Guo, S., Dai, W., & Shuang, F. (2023) · Applied Soft Computing · doi:10.1016/j.asoc.2023.110147 · Cited by 25
Implementing Post-quantum Cryptography for Developers
Hekkala, J., Muurman, M., Halunen, K., & Vallivaara, V. (2023) · SN Computer Science · doi:10.1007/s42979-023-01724-1 · Cited by 33
Quantum Machine Learning: Foundation, New Techniques, and Opportunities for Database Research
Winker, T., Groppe, S., Uotila, V., Yan, Z., Lu, J., Franz, M., & Mauerer, W. (2023) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/3555041.3589404 · Cited by 37
An Empirical Comparison of Optimizers for Quantum Machine Learning with SPSA-Based Gradients
Wiedmann, M., Hölle, M., Periyasamy, M., Meyer, N., Ufrecht, C., Scherer, D. D., Plinge, A., & Mutschler, C. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00058 · Cited by 26
Chao, D., Xu, D., Gao, F., Zhang, C., Zhang, W., & Zhu, L. (2024) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2024.3350006 · Cited by 32
Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of Disjointness
Braverman, M., Garg, A., Ko, Y. K., Mao, J., & Touchette, D. (2015) · SIAM Journal on Computing · doi:10.1109/focs.2015.53 · Cited by 31
Quantum Random Walks – New Method for Designing Quantum Algorithms
Ambainis, A. (2008) · Springer eBooks · doi:10.1007/978-3-540-77566-9_1 · Cited by 25
Calude, C. S., Calude, E., & Dinneen, M. J. (2015) · ACM SIGACT News · doi:10.1145/2744447.2744459 · Cited by 28
Clark, K. B. (2009) · Biosystems · doi:10.1016/j.biosystems.2009.08.005 · Cited by 25
Convergence performance comparison of quantum-inspired multi-objective evolutionary algorithms
Li, Z., Rudolph, G., & Li, K. (2008) · Computers & Mathematics with Applications · doi:10.1016/j.camwa.2008.10.046 · Cited by 25
Ozols, M., Roetteler, M., & Roland, J. (2012) · Conference on Innovations in Theoretical Computer Science · doi:10.1145/2090236.2090261 · Cited by 37
A Quantum-inspired Genetic Algorithm for data clustering
Xiao, J., Yan, Y., Lin, Y., et al. (2008) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2008.4630993 · Cited by 25
Post-Quantum Static-Static Key Agreement Using Multiple Protocol Instances
Azarderakhsh, R., Jao, D., & Leonardi, C. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-72565-9_3 · Cited by 25
Post-quantum cryptography based on codes: State of the art and open challenges
Baldi, M., Santini, P., & Cancellieri, G. (2017) · AEIT International Annual Conference · doi:10.23919/aeit.2017.8240549 · Cited by 26
Optimal Merging in Quantum $$k$$-xor and k-sum Algorithms
Naya‐Plasencia, M., & Schrottenloher, A. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-45724-2_11 · Cited by 29
FPGA-based high-speed emulator of quantum computing
Fujishima, M. (2004) · IEEE International Conference on Field-Programmable Technology (FPT) · doi:10.1109/fpt.2003.1275727 · Cited by 25
Bound on the number of functions that can be distinguished with k quantum queries
Farhi, E., Goldstone, J., Gutmann, S., & Sipser, M. (1999) · Physical Review A · doi:10.1103/physreva.60.4331 · Cited by 32
Non-coherent multi-user detection based on quantum search
Imre, S., & Balázs, F. (2003) · International Conference on Communications · doi:10.1109/icc.2002.996861 · Cited by 26
Characterization of non-deterministic quantum query and quantum communication complexity
de Wolf, R. (2002) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.2000.856758 · Cited by 28
Quantum-Inspired Evolutionary Algorithms and Its Application to Numerical Optimization Problems
da Cruz, A. V. A., Barbosa, C. R. H., Pacheco, M. A. C., et al. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30499-9_31 · Cited by 25
Iqbal, A., & Toor, A. H. (2002) · Physics Letters A · doi:10.1016/s0375-9601(02)00067-1 · Cited by 25
The Quantum Fourier Transform and Extensions of the Abelian Hidden Subgroup ProblemPreprint
Hales, L. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0212002 · Cited by 24
Limits on Efficient Computation in the Physical WorldPreprint
Aaronson, S. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0412143 · Cited by 31
On the effect of quantum interaction distance on quantum addition circuitsPreprint
Choi, B.-S., & Meter, R. V. (2011) · Cited by 25
Quantum Image Compression: Fundamentals, Algorithms, and Advances
Deb, S. K., & Pan, W. D. (2024) · Computers · doi:10.3390/computers13080185 · Cited by 24
Toward Quantum-Native Communication Systems: State-of-the-Art, Trends, and Challenges
Zhou, X., Shen, A., Hu, S., Ni, W., Wang, X., & Hossain, E. (2025) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2025.3575842 · Cited by 52
Quantum approximate multi-objective optimization
Kotil, A., Pelofske, E., Riedmüller, S., Egger, D. J., Eidenbenz, S., Koch, T., & Woerner, S. (2025) · Nature Computational Science · doi:10.1038/s43588-025-00873-y · Cited by 42
Neuro-, Genetic-, and Quantum Inspired Evolving Intelligent Systems
Kasabov, N. K. (2006) · doi:10.1109/isefs.2006.251165 · Cited by 24
Application of distributed semi-quantum computing model in phase estimation
Li, K., Qiu, D., Li, L., Zheng, S., & Rong, Z. (2016) · Information Processing Letters · doi:10.1016/j.ipl.2016.12.002 · Cited by 24
Fuda, T., Funakawa, D., & Suzuki, A. (2018) · Journal of Mathematical Physics · doi:10.1063/1.5035300 · Cited by 21
Quantum private computation of cardinality of set intersection and union
Shi, R. (2018) · The European Physical Journal D · doi:10.1140/epjd/e2018-90380-7 · Cited by 24
Advanced exact synthesis of Clifford+T circuits
Niemann, P., Wille, R., & Drechsler, R. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02816-0 · Cited by 30
Quantum DevOps: Towards Reliable and Applicable NISQ Quantum Computing
Gheorghe-Pop, I.-D., Tcholtchev, N., Ritter, T., & Hauswirth, M. (2020) · IEEE Globecom Workshops (GC Wkshps) · doi:10.1109/gcwkshps50303.2020.9367411 · Cited by 30
Chang, W.-L., Chen, J.-C., Chung, W., Hsiao, C.-Y., Wong, R., & Vasilakos, A. V. (2021) · IEEE Transactions on NanoBioscience · doi:10.1109/tnb.2021.3075733 · Cited by 24
SoK: How (not) to Design and Implement Post-quantum Cryptography
Howe, J., Prest, T., & Apon, D. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-75539-3_19 · Cited by 25
Quantum second-order optimization algorithm for general polynomials
Gao, P., Li, K., Wei, S., & Long, G. (2021) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-021-1725-9 · Cited by 25
A Lattice-Based Ring Signature Scheme to Secure Automated Valet Parking
Xu, S., Chen, X., Wang, C., He, Y., Xiao, K., & Cao, Y. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-86130-8_6 · Cited by 24
Limiting the Search Space in Optimal Quantum Circuit Mapping
Burgholzer, L., Schneider, S., & Wille, R. (2022) · Springer eBooks · doi:10.1007/978-3-032-06770-8_11 · Cited by 28
Image encryption with quantum cellular neural network
Shi, J., Chen, S., Chen, T., Zhao, T., Tang, J., Li, Q., Yu, C., & Shi, H. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03555-0 · Cited by 24
Quantum Robustness Verification: A Hybrid Quantum-Classical Neural Network Certification Algorithm
Franco, N., Wollschläger, T., Gao, N., Lorenz, J. M., & Günnemann, S. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00033 · Cited by 28
Exploring SAT for Cryptanalysis: (Quantum) Collision Attacks Against 6-Round SHA-3
Guo, J., Liu, G., Song, L., & Tu, Y. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-22969-5_22 · Cited by 26
QEPP: A Quantum Efficient Privacy Protection Protocol in 6G-Quantum Internet of Vehicles
Qu, Z., Chen, Z., Ning, X., & Tiwari, P. (2023) · IEEE Transactions on Intelligent Vehicles · doi:10.1109/tiv.2023.3304852 · Cited by 24
AIM: Symmetric Primitive for Shorter Signatures with Stronger Security
Kim, S.-H., Ha, J., Son, M., Lee, B., Moon, D., Lee, J., Lee, S., Kwon, J., Cho, J., Yoon, H., et al. (2023) · IACR Cryptology ePrint Archive · doi:10.1145/3576915.3616579 · Cited by 34
Quantum-Assisted Solution Paths for the Capacitated Vehicle Routing Problem
Palackal, L., Poggel, B., Wulff, M., Ehm, H., Lorenz, J. M., & Mendl, C. B. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00080 · Cited by 24
Golden, J. K., Bärtschi, A., O’Malley, D., & Eidenbenz, S. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00063 · Cited by 42
Engineering Clock Transitions in Molecular Lanthanide Complexes
Stewart, R., Canaj, A. B., Liu, S., Martí, E. R., Celmina, A., Nichol, G. S., Cheng, H., Murrie, M., & Hill, S. (2024) · Journal of the American Chemical Society · doi:10.1021/jacs.3c09353 · Cited by 24
Overview of Startups Developing Artificial Intelligence for the Energy Sector
Lanbaran, N. M., Naujokaitis, D., Kairaitis, G., Jenciūtė, G., & Radziukynienė, N. (2024) · Applied Sciences · doi:10.3390/app14188294 · Cited by 34
Highlighting the Mechanism of the Quantum Speedup by Time-Symmetric and Relational Quantum Mechanics
Castagnoli, G. (2015) · Foundations of Physics · doi:10.1007/s10701-015-9968-4 · Cited by 25
Simulation of Quantum Circuits via Stabilizer Frames
García, H. J., & Markov, I. L. (2014) · IEEE Transactions on Computers · doi:10.1109/tc.2014.2360532 · Cited by 27
Novel hybrid approach to data-packet-flow prediction for improving network traffic analysis
Chang, B. R., & Tsai, H. F. (2009) · Applied Soft Computing · doi:10.1016/j.asoc.2009.03.003 · Cited by 24
Testing quantum dynamics in genetic information processing
Patel, A. D. (2001) · Journal of Genetics · doi:10.1007/bf02811417 · Cited by 24
Experimental Quantum Randomness Processing Using Superconducting Qubits
Yuan, X., Liu, K., Xu, Y., Wang, W., Ma, Y., Zhang, F., Yan, Z., Vijay, R., Sun, L., & Ma, X. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.010502 · Cited by 25
Wei, T.-C., & Huang, C.-Y. (2017) · Physical Review A · doi:10.1103/physreva.96.032317 · Cited by 24
Efficient Quantum Protocol for Private Set Intersection Cardinality
Shi, R. (2018) · IEEE Access · doi:10.1109/access.2018.2872741 · Cited by 24
The quantum Fourier transform based on quantum vision representation
Li, H.-S., Fan, P., Xia, H., Song, S., & He, X. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-2096-2 · Cited by 24
Application of Pontryagin's minimum principle to Grover's quantum search problem
Lin, C., Wang, Y., Kolesov, G., & Kalabic, U. V. (2019) · Physical Review A · doi:10.1103/physreva.100.022327 · Cited by 22
A quantum model of feed-forward neural networks with unitary learning algorithms
Shao, C. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-2592-z · Cited by 24
Search on vertex-transitive graphs by lackadaisical quantum walk
Rhodes, M. L., & Wong, T. G. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02841-z · Cited by 27
Two quantum Ising algorithms for the shortest-vector problem
Joseph, D., Callison, A., Ling, C., & Mintert, F. (2021) · Physical Review A · doi:10.1103/physreva.103.032433 · Cited by 32
Frontiers of information technology
Dillenberger, D. E., Gil, D., Nitta, S., & Ritter, M. (2011) · IBM Journal of Research and Development · doi:10.1147/jrd.2011.2163275 · Cited by 24
Chang, B. R. (2008) · Fuzzy Sets and Systems · doi:10.1016/j.fss.2008.04.003 · Cited by 24
Approximating fractional time quantum evolution
Sheridan, L., Maslov, D. A., & Mosca, M. (2009) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/42/18/185302 · Cited by 24
Graph matching using the interference of discrete-time quantum walks
Emms, D., Wilson, R. C., & Hancock, E. R. (2008) · Image and Vision Computing · doi:10.1016/j.imavis.2008.10.013 · Cited by 24
A SHORT SURVEY ON QUANTUM COMPUTERS
Kanamori, Y., Yoo, S.-M., Pan, W. D., & Sheldon, F. T. (2006) · International Journal of Computers and Applications · doi:10.2316/journal.202.2006.3.202-1700 · Cited by 33
Looking at Nature as a Computer
Margolus, N. (2003) · International Journal of Theoretical Physics · doi:10.1023/a:1024403618093 · Cited by 24
Quantum state manipulation of trapped atomic ions
Wineland, D. J., Monroe, C., Meekhof, D. M., King, B. E., Leibfried, D., Itano, W. M., Bergquist, J. C., Berkeland, D., Bollinger, J. J., & Miller, J. (1998) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.1998.0168 · Cited by 23
The effect of communication costs in solid-state quantum computing architectures
Copsey, D., Oskin, M., Metodiev, T., Chong, F. T., Chuang, I. L., & Kubiatowicz, J. D. (2003) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/777412.777424 · Cited by 23
Using HDLs for describing quantum circuits
Udrescu, M., Prodan, L., & Vlăduţiu, M. (2004) · ACM International Conference on Computing Frontiers (CF) · doi:10.1145/977091.977107 · Cited by 24
Quantum Walks and Electric NetworksPreprint
Belovs, A. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1302.3143 · Cited by 30
A Study of Parallel Self-Organizing MapPreprint
Weigang, L. (1998) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9808025 · Cited by 24
A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum AnnealingPreprint
Abbott, A. A., Calude, C. S., Dinneen, M. J., & Hua, R. (2018) · ResearchSpace (University of Auckland) · doi:10.48550/arxiv.1803.04340 · Cited by 22
Uncovering instabilities in variational-quantum deep Q-networks
Franz, M., Wolf, L., Periyasamy, M., Ufrecht, C., Scherer, D. D., Plinge, A., Mutschler, C., & Mauerer, W. (2023) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2022.08.021 · Cited by 26
Supercomputing leverages quantum machine learning and Grover’s algorithm
Khanal, B., Orduz, J., Rivas, P., & Baker, E. J. (2022) · The Journal of Supercomputing · doi:10.1007/s11227-022-04923-4 · Cited by 27
Quantum Authentication Evolution: Novel Approaches for Securing Quantum Key Distribution
Termos, H. (2024) · Entropy · doi:10.3390/e26060447 · Cited by 24
Quantum Computing in Intelligent Transportation Systems: A Survey
Zhuang, Y., Azfar, T., Wang, Y., Sun, W., Wang, X., Guo, Q., & Ke, R. (2024) · CHAIN · doi:10.23919/chain.2024.000007 · Cited by 34
PP-PQB: Privacy-Preserving in Post-Quantum Blockchain-Based Systems: A Systematization of Knowledge
Sezer, B. B., Akleylek, S., & Nuriyev, U. G. (2025) · IEEE Access · doi:10.1109/access.2025.3545943 · Cited by 35
Landauer principle and thermodynamics of computation
Chattopadhyay, P., Misra, A., Pandit, T., & Paul, G. (2025) · Reports on Progress in Physics · doi:10.1088/1361-6633/add6b3 · Cited by 33
Ballester, R., Cerquides, J., & Artiles, L. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-025-00292-2 · Cited by 38
Post-quantum Cryptography: A Review on Cryptographic Solutions for the Era of Quantum Computing
Singh, M., Sood, S. K., & Bhatia, M. (2025) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-025-10412-7 · Cited by 32
TESLA: Tightly-Secure Efficient Signatures from Standard Lattices.
Alkım, E., Bindel, N., Buchmann, J. A., Dagdelen, Ö., & Schwabe, P. (2015) · TUbilio (Technical University of Darmstadt) · Cited by 23
Experimental study of Forrelation in nuclear spins
Li, H., Gao, X., Xin, T., Yung, M., & Long, G. (2017) · 中国科学通报：英文版 · doi:10.1016/j.scib.2017.03.006 · Cited by 23
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
