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 5,201–5,300 of 8,792
On the Active Security of the PEARL-SCALLOP Group Action
Fouotsa, T. B., Houben, M., Lorenzon, G., et al. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-22698-3_3 · Cited by 2
On the Energy Cost of Post-Quantum Key Establishment in Wireless Low-Power Personal Area Networks
Liu, T., Ramachandran, G. S., & Jurdak, R. (2026) · doi:10.1145/3774906.3802784 · Cited by 5
Exploring the Synergy of Quantum-Classical Integration in Machine Learning Algorithms
Vedhashree, L., V, Anushree, G., C, U. K., Suresha, R., Jeevitha, R., & Kathyanian, A. (2026) · International Conference on Smart Futuristic Technology (SMARTTECH) · doi:10.1109/icsft66733.2026.11508098 · Cited by 3
Qi, H., Xu, Y., Wang, H., Gani, A., & Por, L. Y. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05186-1 · Cited by 2
Chen, K., Li, C., Dong, M., & Ota, K. (2026) · IEEE Internet of Things Journal · doi:10.1109/jiot.2026.3696152 · Cited by 2
On the Stability of Local Interpretable Model-Agnostic Explanations for Quantum Classifiers
Acampora, G., & Vitiello, A. (2026) · Machine Learning · doi:10.1007/s10994-026-07071-5 · Cited by 2
Topology-Oblivious Random-Walk Key Relaying in Quantum Key Distribution Networks
Petručeņa, K., Kozlovičs, S., Vīksna, J., Kalniņa, E., Isaks, R., Celms, E., Lāce, L., & Rencis, E. (2026) · Entropy · doi:10.3390/e28060696 · Cited by 2
Bridging Quantum Computing and Artificial Intelligence for Next-Generation Innovation
Infant Kavin, F., DanielRaj, K., Ponseka, G., Ananthakumari, A., Raja, A. K., & Thomson, F. A. (2026) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-2600-2601-4.ch005 · Cited by 3
Quantum bioinformatics: a systematic review of methods, trends, and challenges
Khalaj, M., Rayan, S., & Jin, L. (2026) · Briefings in Bioinformatics · doi:10.1093/bib/bbag383 · Cited by 2
Correcting for potential barriers in quantum walk search
Ambainis, A., & Wong, T. G. (2015) · Quantum Information and Computation · doi:10.26421/qic15.15-16-7 · Cited by 4
Secret key sharing using entanglement swapping and remote preparation of quantum state
Alshowkan, M., & Elleithy, K. M. (2014) · IEEE Long Island Systems, Applications and Technology Conference (LISAT) · doi:10.1109/lisat.2014.6845215 · Cited by 2
A quantum probability splitter and its application to qubit preparation
Sgarbas, K. (2012) · Quantum Information Processing · doi:10.1007/s11128-012-0402-y · Cited by 2
Alternative combination of quantum immune algorithm and back propagation neural network
Ji, X. Y., Liu, Y., Yu, X., et al. (2011) · International Conference on Natural Computation (ICNC) · doi:10.1109/icnc.2011.6021912 · Cited by 2
A quantum algorithm for Viterbi decoding of classical convolutional codes
Grice, J. R., & MEYER, D. A. (2015) · Quantum Information Processing · doi:10.1007/s11128-015-1003-3 · Cited by 2
Information entropy of multi-photon field interacting with single-qubit circuit
Kadry, H., Cheong, L. Y., & Zakaria, N. (2013) · IEEE International Conference on System Engineering and Technology (ICSET) · doi:10.1109/icsengt.2013.6650167 · Cited by 2
Techniques for Formal Modelling and Analysis of Quantum Systems
Gay, S. J., & Nagarajan, R. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38164-5_18 · Cited by 2
Hybrid evolutionary algorithm for multi-objective job shop scheduling
Qin, C., Zhu, J., & Zheng, J. (2009) · doi:10.1109/icicisys.2009.5358297 · Cited by 2
Classical and Quantum Algorithms for USO Recognition
Bosshard, V. (2015) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-a-010540777 · Cited by 2
Advantages of Ultrametric Counter Automata.
Adamsons, V., Jerins, K., Krišlauks, R., et al. (2015) · Cited by 2
Singh, M. P., & Rajput, B. S. (2017) · International Journal of Theoretical Physics · doi:10.1007/s10773-016-3269-3 · Cited by 2
Using Reed-Muller Expansions in the Synthesis and Optimization of Boolean Quantum Circuits
Younes, A. (2017) · Emergence, complexity and computation · doi:10.1007/978-3-319-67997-6_5 · Cited by 2
Efficient Quantum Algorithm for Similarity Measures for Molecules
Yang, L., Lu, S., & Li, L. (2018) · International Journal of Theoretical Physics · doi:10.1007/s10773-018-3805-4 · Cited by 2
Efficient Quantum Algorithm for the Parity Problem of a Certain Function
Nagata, K., Nakamura, T., Batle, J. A. I., & Farouk, A. (2018) · International Journal of Theoretical Physics · doi:10.1007/s10773-018-3827-y · Cited by 2
Effectiveness of quantum algorithms on classical computing complexities
Amellal, H., Meslouhi, A., & Allati, A. E. (2018) · International Conference on Smart City Applications (SCA) · doi:10.1145/3286606.3286811 · Cited by 2
Proposal for realization of a Toffoli gate via cavity-assisted collision
Ollivier, H., & Milman, P. (2003) · HAL (Le Centre pour la Communication Scientifique Directe) · doi:10.48550/arxiv.quant-ph/0306064 · Cited by 2
Improving Emulation of Quantum Algorithms using Space-Efficient Hardware Architectures
Mahmud, N., & El‐Araby, E. (2019) · IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP) · doi:10.1109/asap.2019.000-1 · Cited by 2
Reversible Data Hiding for Quantum Images using Quantum Controlled-NOT Gate Operation
Luo, G., Shi, L., Shi, Z., et al. (2020) · Journal of Engineering Science and Technology Review · doi:10.25103/jestr.132.24 · Cited by 2
Experimental technique for multi-qubit nuclear magnetic resonance system
Jian, P., Qi, Y., & Peng, X. (2017) · Acta Physica Sinica · doi:10.7498/aps.66.150302 · Cited by 2
Quantum information processing by nuclear magnetic resonance on quadrupolar nuclei
Oão, B. Y. J., Eles, T., Duardo, E., et al. (2015) · Cited by 2
Simon’s Algorithm and Autocorrelation Spectrum
Sapv, T., Bera, D., Maitra, A., et al. (2021) · SpringerBriefs in computer science · doi:10.1007/978-981-16-3061-3_4 · Cited by 2
A Review on the Impact of Quantum Computing on Blockchain Technology
Shrestha, R. B. (2021) · International Journal for Research in Applied Science and Engineering Technology · doi:10.22214/ijraset.2021.38510 · Cited by 2
Muten, E. R., Yusuf, T. T., & Tomut, A. V. (2021) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce52317.2021.00024 · Cited by 2
Shukla, M., Tupsamudre, H., & Lodha, S. (2021) · IGI Global eBooks · doi:10.4018/978-1-6684-3698-1.ch021 · Cited by 2
Drias, H., Drias, Y., Bendimerad, L. S., et al. (2022) · Lecture notes in networks and systems · doi:10.1007/978-3-030-96308-8_28 · Cited by 2
State complexity of one-way quantum finite automata together with classical states
Xiao, L., & Qiu, D. (2025) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2025.103659 · Cited by 2
Schuld, M., & Petruccione, F. (2018) · Quantum science and technology · doi:10.1007/978-3-319-96424-9_4 · Cited by 2
LaPierre, R. (2021) · The Materials Research Society series · doi:10.1007/978-3-030-69318-3_12 · Cited by 2
Alpha-Beta Hybrid Quantum Associative Memory Using Hamming Distance
Sánchez-Manilla, A. A., López-Yáñez, I., & Sun, G.-H. (2022) · Entropy · doi:10.3390/e24060789 · Cited by 2
Error-Tolerant Mapping for Quantum Computing
Saki, A. A., Alam, M., Li, J., & Ghosh, S. (2022) · Computer architecture and design methodologies · doi:10.1007/978-981-16-7487-7_12 · Cited by 4
A Post-quantum Zero-Knowledge Proof System Using Quantum Information Theory
Mahapatra, S., Wooldridge, T., & Wang, X. (2022) · Lecture notes in networks and systems · doi:10.1007/978-981-19-1610-6_76 · Cited by 2
Superimposition and Antagonism in Chain Synthesis Using Entangled Biphotonic Control
Ozhigov, Y. I., & Pluzhnikov, I. R. (2022) · Computational Mathematics and Modeling · doi:10.1007/s10598-022-09553-2 · Cited by 2
Public Key Protocols over Skew Dihedral Group Rings
de la Cruz, J., Martı́nez-Moro, E., & Villanueva-Polanco, R. (2022) · Mathematics · doi:10.3390/math10183343 · Cited by 2
Quantum Key Recovery Attacks on 3-Round Feistel-2 Structure Without Quantum Encryption Oracles
Daiza, T., & Yoneyama, K. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-15255-9_7 · Cited by 2
Rebound Attacks on $$\textsf{SKINNY}$$ Hashing with Automatic Tools
Li, S., Liu, G., & Pham, P. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-23020-2_37 · Cited by 3
An SMT-Solver-Based Synthesis of NNA-Compliant Quantum Circuits Consisting of CNOT, H and T Gates
Seino, K., & Yamashita, S. (2023) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1145/3566097.3567931 · Cited by 2
A Novel 2D Mapping Scheme for Nearest Neighbor Design of Quantum Circuits
Kumar, S., Bhattacharjee, A., Ghosh, S., et al. (2022) · IEEE International Conference of Electron Devices Society Kolkata Chapter (EDKCON) · doi:10.1109/edkcon56221.2022.10032881 · Cited by 2
Role of Quantum Computing in a Data Analytics Environment
Tripathy, B. K., & Singh, A. (2023) · Advances in computational intelligence and robotics book series · doi:10.4018/978-1-6684-6821-0.ch014 · Cited by 2
Quantum Computing for Indoor Environmental Quality
Kapoor, N. R., Kumar, A., Kumar, A., Kumar, A., Arora, H. C., & Jahangir, H. (2023) · Advances in systems analysis, software engineering, and high performance computing book series · doi:10.4018/978-1-6684-6697-1.ch011 · Cited by 2
Comparison of Quantum and Classical Algorithm in Searching a Number in a Database Case
Wang, Z. (2023) · Highlights in Science Engineering and Technology · doi:10.54097/hset.v38i.5831 · Cited by 2
FPGA Based Emulation Of B92 QKD Protocol
Mujahid, U., Khalid, M., & Najam-ul-Islam, M. (2023) · Conference on Information Sciences and Systems · doi:10.1109/ciss56502.2023.10089628 · Cited by 2
Heuristics for Quantum Computing Dealing with 3-SAT
Paulet, J. J., Llana, L., Calvo, H. I. D. L. C., et al. (2023) · Mathematics · doi:10.3390/math11081888 · Cited by 2
Post-quantum security on the Lai–Massey scheme
Zhang, Z., Wu, W., Sui, H., et al. (2023) · Designs Codes and Cryptography · doi:10.1007/s10623-023-01225-5 · Cited by 2
Quantum Speed-ups for Single-machine Scheduling Problems
Grange, C., Bourreau, E., Poss, M., et al. (2023) · doi:10.1145/3583133.3596415 · Cited by 2
Educational Issues Raised by the Availability of the Quantum Computer
Koczka, F., Prantner, C. K., & Bíró, C. (2023) · Central-European Journal of New Technologies in Research Education and Practice · doi:10.36427/cejntrep.5.1.5051 · Cited by 2
Safina, L. (2023) · Lobachevskii Journal of Mathematics · doi:10.1134/s1995080223020324 · Cited by 2
HBSS: (Simple) Hash-Based Stateless Signatures – Hash All the Way to the Rescue!
Dolev, S., Yagudaev, A., & Yung, M. M. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-34671-2_27 · Cited by 2
Żołnierczyk, O., & Wroński, M. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-36030-5_1 · Cited by 2
An Investigation of Quantum and Parallel Computing Effects on Malware Families Classification
Taha, B. N. (2023) · Journal of Applied Science and Technology Trends · doi:10.38094/jastt42153 · Cited by 3
A Remote Quantum Error-Correcting Code Preparation Protocol on Cluster States
Zhao, Q., Mao, H., Qiao, Y., et al. (2023) · Mathematics · doi:10.3390/math11143035 · Cited by 2
A novel attack on McEliece's cryptosystem
Gray, H., Battarbee, C., Shahandashti, S. F., & Kahrobaei, D. (2023) · International Journal of Computer Mathematics Computer Systems Theory · doi:10.1080/23799927.2023.2229278 · Cited by 2
Implementation of Quantum Image Encryption via Reversible Quantum Logic Gates Computing
Cheng, Y. L., Liao, Y. P., Chen, C. Y., et al. (2023) · SPIN · doi:10.1142/s2010324723400209 · Cited by 2
Experiences in Quantum Software Engineering
Scheerer, M., Klamroth, J., Garhofer, S., et al. (2023) · IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) · doi:10.1109/ipdpsw59300.2023.00095 · Cited by 2
Performance Evaluation of Classic McEliece Post Quantum Cryptography
Lingeshwaran., B., & Singh, A. (2022) · doi:10.1109/acm57404.2022.00022 · Cited by 2
Simulated Multiparty Quantum Digital Signature in Cyberspace Operations
Cid, M. I. G., Aguado, D. G., Martín, L. O., et al. (2023) · International Conference on Military Communications and Information Systems (ICMCIS) · doi:10.1109/icmcis59922.2023.10253563 · Cited by 2
A quantum algorithm for finding collision-inducing disturbance vectors in SHA-1
Duan, J., Li, M., & Ian, H. (2023) · Physica Scripta · doi:10.1088/1402-4896/acfc79 · Cited by 2
Photonic Neural Networks with Spatiotemporal Dynamics
Suzuki, H., Tanida, J., & Hashimoto, M. (2023) · Springer eBooks · doi:10.1007/978-981-99-5072-0 · Cited by 3
Solving 2 by 2 Grid Sudoku Problem using Grover’s Algorithm with Intel Quantum SDK
Shinde, T., Gambo, Y. J., Rasch, K., Liebelt, H., & Li, R. (2023) · International Conference on Advanced Computer Information Technologies (ACIT) · doi:10.1109/acit58437.2023.10275442 · Cited by 2
Nagy, N., Nagy, M., Alazman, G., et al. (2023) · Entropy · doi:10.3390/e25101461 · Cited by 2
VelociTI: An Architecture-level Performance Modeling Framework for Trapped Ion Quantum Computers
Hankin, A., Mahmoud, A., Hempstead, M., Brooks, D. M., & Wei, G.-Y. (2023) · IEEE International Symposium on Workload Characterization · doi:10.1109/iiswc59245.2023.00040 · Cited by 2
Kyber, Saber, and SK‐MLWR Lattice‐Based Key Encapsulation Mechanisms Model Checking with Maude
Tran, D. D., Ogata, K., Escobar, S., et al. (2023) · IET Information Security · doi:10.1049/2023/9399887 · Cited by 2
Application of Quantum-Based K-Nearest Neighbors Algorithm in Optical Fiber Classification
Ramesh, H. B., & Bhowmick, K. (2023) · Lecture notes in electrical engineering · doi:10.1007/978-981-99-4634-1_71 · Cited by 2
Mixed-Dimensional Quantum Circuit Simulation with Decision Diagrams
Mato, K., Hillmich, S., & Wille, R. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00112 · Cited by 2
Bounded Quantum Regular Language Generator
Kwon, Y., & Agha, G. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00072 · Cited by 2
Grover's Implementation of Quantum Binary Neural Networks
Wrighter, B., & Alarcón, S. L. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00043 · Cited by 2
A Quantum Safe Authentication Protocol for Remote Keyless Entry Systems in Cars
Parameswarath, R. P., Abhishek, N. V., & Sikdar, B. (2023) · IEEE Vehicular Technology Conference · doi:10.1109/vtc2023-fall60731.2023.10333825 · Cited by 2
Decomposing (n+1)$(n+1)$‐Qubit Toffoli Gate with Shallow Circuit Depth and No Ancilla
Leng, J., Yang, F., & Wang, X. (2023) · Advanced Quantum Technologies · doi:10.1002/qute.202300370 · Cited by 2
Structure design and logical CNOT implementation of multi-logical-qubits surface code
Quan, D., Lü, X.-J., & Zhang, W.-F. (2023) · Acta Physica Sinica · doi:10.7498/aps.73.20231138 · Cited by 2
Design of Cryptosystem Architecture Based on Quantum Key Distribution
Xue, W., Congli, W., & Wang, J. (2023) · IEEE International Conference on Information Systems and Computer Aided Education (ICISCAE) · doi:10.1109/iciscae59047.2023.10393681 · Cited by 2
A Reduced Complexity Method of Recursive Quantum Approximate Optimization Algorithm
Seo, Y., & Heo, J. (2023) · International Conference on Information and Communication Technology Convergence (ICTC) · doi:10.1109/ictc58733.2023.10392794 · Cited by 2
Advanced Encryption Standard on a Quantum System
Dhanapal, A. D., Ramanujan, S. A., & Jeyalakshmi, V. (2023) · International Conference on Integrated Intelligence and Communication Systems (ICIICS) · doi:10.1109/iciics59993.2023.10421474 · Cited by 2
Quantum Cryptanalysis of OTR and OPP: Attacks on Confidentiality, and Key-Recovery
Jauch, M., & Maram, V. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-53368-6_14 · Cited by 2
A Quantum Machine Learning Approach Using an Optimized Application of Grover's Algorithm
Cherif, M. Y., Chaari, W. L., & Driss, O. B. (2023) · IEEE Afro-Mediterranean Conference on Artificial Intelligence (AMCAI) · doi:10.1109/amcai59331.2023.10431508 · Cited by 3
Wu, H.-Y., Feng, X., & Zhang, J.-L. (2024) · Entropy · doi:10.3390/e26030216 · Cited by 2
Enhancing model‐based acoustic localisation using quantum annealing
Wezeman, R. S., Bontekoe, T., von Benda‐Beckmann, S., & Phillipson, F. (2024) · IET Radar Sonar & Navigation · doi:10.1049/rsn2.12534 · Cited by 2
A new lattice-based partially blind signature with more complete proof
Li, P., Gao, J., & Li, X. (2024) · Journal of Information and Intelligence · doi:10.1016/j.jiixd.2024.03.001 · Cited by 2
Use of hybrid post-quantum key exchange in internet protocols
Smyslov, V. (2024) · Journal of Computer Virology and Hacking Techniques · doi:10.1007/s11416-024-00515-3 · Cited by 2
Optimized quantum circuit implementation of SATURNIN for Grover’s algorithm
Allu, S. N., Naidu, T. A., & Rao, K. G. (2024) · International Journal of Information Technology · doi:10.1007/s41870-024-01792-3 · Cited by 2
Quantum Algorithm for Searching of Two Sets Intersection
Khadiev, K. R., & Krendeleva, E. (2023) · Russian Microelectronics · doi:10.1134/s106373972360084x · Cited by 2
Quantum-inspired Edge Processing for Wireless Network Optimization
Krishnaswamy, D. (2023) · IEEE Virtual Conference on Communications (VCC) · doi:10.1109/vcc60689.2023.10474714 · Cited by 2
Harnessing Quantum Power: Innovations in Optimization Algorithms
Chauhan, A. S., Singh, A., Thakur, R., & Singh, V. K. (2024) · International Journal of Innovative Science and Research Technology (IJISRT) · doi:10.38124/ijisrt/ijisrt24mar1704 · Cited by 2
A Parallel and Distributed Quantum SAT Solver Based on Entanglement and Teleportation
Lin, S., Wang, T., Chen, Y.-R., Hóu, Z., Sanán, D., & Teo, Y. S. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-57249-4_18 · Cited by 2
ChaCha20-AES Combined Algorithm with 512 Bits of Security
ElRashidy, A. M., AlAzeem, M. H. A., Elhafez, A. A., et al. (2024) · International Youth Conference on Radio Electronics, Electrical and Power Engineering (REEPE) · doi:10.1109/reepe60449.2024.10479797 · Cited by 2
Secure Lightweight Data Communication Between the IoT Devices and Cloud Service
Phuong, T. V. X., Le, T. T. N., & Ngoc, H. L. (2024) · Lecture notes on data engineering and communications technologies · doi:10.1007/978-3-031-57853-3_34 · Cited by 2
Quantum (t, n) threshold signature based on logistic chaotic sequences and mutually unbiased bases
Zhang, Y., Fang, H., & Liu, F. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04366-1 · Cited by 2
Quantum walk search for exceptional configurations
Giri, P. R. (2024) · International Journal of Quantum Information · doi:10.1142/s0219749924500321 · Cited by 2
Quantum Computing Odyssey: Teleporting to the Realm of Unparalleled Possibilities
Laad, M. S., Varshney, P., & Agarwal, R. (2024) · International Conference on Advances in Data Engineering and Intelligent Computing Systems (ADICS) · doi:10.1109/adics58448.2024.10533597 · Cited by 2
Quantum Computing Mathematical Foundations and Practical Implications
Padamwar, B. V., & Rao, P. H. (2020) · Türk bilgisayar ve matematik eğitimi dergisi · doi:10.61841/turcomat.v11i3.14659 · Cited by 2
Efficient Quantum Circuit Encoding of Object Information in 2D Ray Casting
Lee, S., Jeong, S., & Seo, J. (2024) · International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC) · doi:10.1109/itc-cscc62988.2024.10628280 · Cited by 2
Leveraging Quantum Technology to Enhance Community Services and Supportive ICT Infrastructure
Phillipson, F. (2024) · Communications in computer and information science · doi:10.1007/978-3-031-60433-1_3 · Cited by 2
Addressing Machine Unavailability in Job Shop Scheduling: A Quantum Computing Approach
Aggoune, R., & Deleplanque, S. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-62912-9_23 · Cited by 2
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
