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,801–5,900 of 8,792
Seismic impedance estimation from poststack seismic data using quantum computing
Vashisth, D., & Lessard, R. (2024) · Second International Meeting for Applied Geoscience & Energy · doi:10.1190/image2024-4093838.1 · Cited by 1
Laule, M. S. C., Olazabal, J., & Hanco, H. N. (2024) · Interfases · doi:10.26439/interfases2024.n020.7383 · Cited by 4
A Quantum Circuit to Execute a Key-Recovery Attack Against the DES and 3DES Block Ciphers
Perriello, S., Barenghi, A., & Pelosi, G. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00011 · Cited by 1
QuaSi: A Scalable and Reliable Quantum Simulation-based Equivalence Checking Framework
Lu, C., Choudhury, N., & Basu, K. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00123 · Cited by 1
Performance Evaluation of the Intel Quantum Simulator on the Lusitania Supercomputer
Talaván-Vega, D., Fernández-Alonso, P., Rodríguez-Oliver, P., et al. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.10343 · Cited by 1
Bridging the Quantum Education Gap: Hands-on Visualization Projects for Quantum Search Algorithm
Chou, Y., Jiang, Y.-C., Kuo, S., & Kung, S. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.20466 · Cited by 2
RISC-V Domain-Specific Processor for Accelerating SPHINCS+ on Multi-Core Architecture
Zhang, S., Zhao, Y., Yu, X., et al. (2024) · doi:10.1109/icsict62049.2024.10830991 · Cited by 1
Graph Coarsening Approach to the Vehicle Routing Problem: An Approximation Strategy
Nałęcz-Charkiewicz, K., Das, A., Chatterjee, T., Keene, J., Góra, P., & Kuhn, C. C. N. (2025) · IEEE Access · doi:10.1109/access.2025.3534677 · Cited by 1
Impact of bivariate gaussian potentials on quantum walks for spatial search
Marquezino, F. D. L., & Santos, R. A. M. (2025) · Physica Scripta · doi:10.1088/1402-4896/adb223 · Cited by 2
Space-Efficient Quantum Error Reduction without log Factors
Belovs, A., & Jeffery, S. (2026) · Quantum · doi:10.22331/q-2026-03-23-2039 · Cited by 1
From Bits to Qubits: Challenges in Classical-Quantum Integration
Kulkarni, S. P., & Bethel, E. W. (2024) · IEEE International Conference on High Performance Computing, Data, and Analytics · doi:10.1109/hipc62374.2024.00025 · Cited by 1
Quantum Algorithm for Density Peak Anomaly Detection Based on KNN
Pan, C., Hou, S., & Cui, C. (2024) · International Conference on Computing, Communication, Perception and Quantum Technology (CCPQT) · doi:10.1109/ccpqt64497.2024.00008 · Cited by 1
Ricchizzi, N., Langner, A., & Pelzl, J. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-84260-3_3 · Cited by 1
Ukai, R., Yoshimura, C., & Mizuno, H. (2025) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.8351 · Cited by 1
Quantum Computing and Password Security: Applying Grover’s Algorithm and QRNG with Qiskit
Belkhir, M., Benkaouha, H., Benkhelifa, E., et al. (2024) · doi:10.1109/gcet64327.2024.10934298 · Cited by 1
Post-Quantum Migration of the Tor Application
Berger, D., Lemoudden, M., & Buchanan, W. J. (2025) · Journal of Cybersecurity and Privacy · doi:10.3390/jcp5020013 · Cited by 1
Quantum Resistance Blockchain Algorithm using QHF and Novel Consensus Mechanism
Paul, S., Mazumdar, M. M., & Chakraborty, S. (2025) · IEEE International Students' Conference on Electrical, Electronics and Computer Science (SCEECS) · doi:10.1109/sceecs64059.2025.10940775 · Cited by 2
A Survey of Quantum Algorithms for Computer Science
Kumar, A. H., Singh, A. J., & Kumar, S. (2025) · Communications in computer and information science · doi:10.1007/978-3-031-86069-0_29 · Cited by 2
Factoring Decision Support System Based on Optimized Quantum Algorithms QMC
Chuvakov, A. V., & Boryaev, R. O. (2025) · Informatics and Automation · doi:10.15622/ia.24.2.11 · Cited by 1
Quantum Program Analysis and Optimization
Huang, P.-H., Wu, Y., Wu, Y.-T., et al. (2025) · IEEE Nanotechnology Magazine · doi:10.1109/mnano.2025.3551388 · Cited by 1
Quantum search in a dictionary using fingerprinting function
Salikhova, N. (2025) · Učenye zapiski Kazanskogo gosudarstvennogo universiteta. Seriâ Fiziko-matematičeskie nauki/Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki · doi:10.26907/2541-7746.2025.1.115-124 · Cited by 1
qSAT: Design of an Efficient Quantum Satisfiability Solver for Hardware Equivalence Checking
Kole, A., Djeridane, M. E., Weingarten, L., Datta, K., & Drechsler, R. (2024) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/3729229 · Cited by 6
An entanglement monotone from the contextual fraction
Chan, T., & Constantin, A. (2025) · New Journal of Physics · doi:10.1088/1367-2630/add047 · Cited by 1
A taxonomy of key management schemes of SCADA systems
Pramod, T. C. (2025) · Computers & Electrical Engineering · doi:10.1016/j.compeleceng.2025.110366 · Cited by 1
Exploring Post-quantum Hash-Based Signature Schemes for IoT Motes
Thanalakshmi, P., & Ashwinkumaar, N. K. J. (2025) · Communications in computer and information science · doi:10.1007/978-3-031-88297-5_7 · Cited by 1
Chakraborty, S., Islam, S. H., & Baksi, A. (2025) · Computers & electrical engineering · doi:10.1016/j.compeleceng.2025.110370 · Cited by 2
Efficient estimation and sequential optimization of cost functions in variational quantum algorithms
Umer, M., Mastorakis, E., & Angelakis, D. G. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/add55e · Cited by 2
Protein Folding and Drug Discovery Using Quantum Computing’s Grover’s Algorithm
Haverly, A., & Rahimi, S. (2025) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc64685.2025.00073 · Cited by 1
Transition of Self-Sovereign Identity to Post-Quantum Cryptography
Solavagione, A., & Vesco, A. (2025) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc64685.2025.00035 · Cited by 3
Seneviratne, A., Walters, P., & Wang, F. (2025) · The Journal of Chemical Physics · doi:10.1063/5.0258227 · Cited by 3
Firsov, G., & Koreneva, A. M. (2025) · Journal of Computer Virology and Hacking Techniques · doi:10.1007/s11416-025-00554-4 · Cited by 1
QWAK: Quantum walk analysis kit
Santos, J., Chagas, B., Chaves, R., & Buffoni, L. (2025) · Computer Physics Communications · doi:10.1016/j.cpc.2025.109676 · Cited by 1
Towards an Automated Debugging Approach for Fault Identification in Quantum Circuits
Maidl, A., Kole, A., Datta, K., Stoppe, J., & Drechsler, R. (2025) · IEEE International Symposium on Design and Diagnostics of Electronic Circuits & Systems (DDECS) · doi:10.1109/ddecs63720.2025.11006682 · Cited by 2
Fractional time dynamics of quantum correlations and coherence in an interacting qubit-qutrit system
Chhieb, A., Oumennana, M., Mansour, M., et al. (2025) · Physica Scripta · doi:10.1088/1402-4896/addc50 · Cited by 1
On (Noisy) Simon’s (Quantum) Algorithm for Multi-shift Boolean Functions
Dutta, S., Jaiswal, A., Maitra, S., et al. (2025) · Communications in computer and information science · doi:10.1007/978-3-031-90587-2_5 · Cited by 1
Quantum Computing in Cybersecurity and LLM
Pour, F. M. A., & Arastoo, M. H. (2025) · International Conference on Web Research (ICWR) · doi:10.1109/icwr65219.2025.11006202 · Cited by 1
THE FUTURE OF FINANCIAL DATA SECURITY: CHALLENGES AND OPPORTUNITIES OF QUANTUM COMPUTING
Dalwadi, P. B. (2025) · International Journal of Management, Economics and Commerce. · doi:10.62737/mxc1t305 · Cited by 1
Yu, X., Zhang, C., Li, X., Zhao, B., Yuan, B., Han, C., Wen, K., & Shan, Z. (2025) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2025.3572021 · Cited by 1
Li, G., Wang, S., Xiumei, Z., Gao, F., Qin, S., Guo, F.-Z., & Jin, Z. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04783-w · Cited by 1
Elsman, M., & Henriksen, T. (2025) · doi:10.1145/3736112.3736143 · Cited by 1
Quantum Communication Advantage for Leader Election and Agreement
Dufoulon, F., Magniez, F., & Pandurangan, G. (2025) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/3732772.3733509 · Cited by 4
Lorenzelli, F., Chen, K., Godfrin, C., et al. (2025) · IEEE Transactions on Electron Devices · doi:10.1109/ted.2025.3578553 · Cited by 1
Modeling and Simulation of Multiple-Valued and Nonlinear Quantum Photonic Components
Ange, J., Tuller, M., Henderson, J. M., Henderson, E. R., Moores, B. A., MacFarlane, D. L., & Thornton, M. A. (2025) · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · doi:10.1109/ismvl64713.2025.00032 · Cited by 1
QR-Map: A Map-Based Approach to Quantum Circuit Abstraction for Qubit Reuse Optimization
Kim, H. J., Jang, E., Choi, S., Kim, Y., & Ro, W. W. (2025) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/3695053.3731020 · Cited by 5
Correlations in a quantum-gravitationally coupled masses
Harrar, M. E., Falaki, M. E., & Laamara, R. A. (2025) · Modern Physics Letters A · doi:10.1142/s021773232550107x · Cited by 1
A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits
Bai, X., & Shang, Y. (2025) · Theoretical Computer Science · doi:10.1016/j.tcs.2025.115423 · Cited by 1
Quantum Computing and Cloud Security: Preparing DevOps for the Next Frontier
Kancherla, V. M. (2023) · International Journal of Emerging Trends in Computer Science and Information Technology · doi:10.63282/3050-9246.ijetcsit-v4i4p109 · Cited by 1
Quantum-Inspired Evolutionary Programming: A Case Study on Optimum Power Generation Scheduling
Ochi, A. R., Mahmud, S. G., & Margala, M. (2025) · IEEE Dallas Circuits and Systems Conference (DCAS) · doi:10.1109/dcas65331.2025.11045496 · Cited by 1
Quantum Apocalypse: Fortifying Critical Infrastructure in the Age of Cyber Warfare
Kumar, S., Klappenecker, A., Brown, G. D., et al. (2025) · European Conference on Cyber Warfare and Security · doi:10.34190/eccws.24.1.3757 · Cited by 1
Securing Mobile Networks in the Quantum Era: Imperative Role of Post-Quantum Cryptography
Sanon, S. P., & Schotten, H. D. (2025) · Joint European Conference on Networks and Communications & 6G Summit (EuCNC/6G Summit) · doi:10.1109/eucnc/6gsummit63408.2025.11037057 · Cited by 1
Quantum Algorithms for Stochastic Differential Equations: A Schrödingerisation Approach
Jin, S., Liu, N., & Wei, W. (2025) · Journal of Scientific Computing · doi:10.1007/s10915-025-02970-6 · Cited by 1
A new quantum computational set-up for algebraic topology via simplicial sets
Zucchini, R. (2025) · Journal of AppliedMath · doi:10.59400/jam3011 · Cited by 1
Quantum error correction with Kolmogorov–Arnold network for rotated surface codes decoding
Fan, Z.-C., Tian, C., Xiao, B., Guo, X., & Ma, H. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04826-2 · Cited by 2
On security notions for encryption in a quantum world
Chevalier, C., Ebrahimi, E., & Vu, Q.-H. (2025) · Designs Codes and Cryptography · doi:10.1007/s10623-025-01664-2 · Cited by 1
Shi, H. J., 韩, C. 成. H., 王, P. 鹏. W., & Zhang, M. (2025) · Chinese Physics B · doi:10.1088/1674-1056/adefd7 · Cited by 1
Gajula, M. K., & Akuthota, A. (2024) · doi:10.1109/sustained63638.2024.11074246 · Cited by 1
Quantum Integer Wavelet Transform over Max-Plus Algebra
Firmansyah, M. I. D., Yunus, M., & Subiono, G. J. O. (2025) · International Journal of Applied and Computational Mathematics · doi:10.1007/s40819-025-01951-5 · Cited by 1
Averaging gate approximation error and performance of Unitary Coupled Cluster ansatz in Pre-FTQC Era
Kuroiwa, K., & Nakagawa, Y. O. (2025) · Quantum · doi:10.22331/q-2025-07-21-1800 · Cited by 4
New quantum attacks on some Feistel variants
Lan, Q., Zou, J. X., & Wei, J. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04852-0 · Cited by 1
Quantum-inspired resource management in wireless networks
Krishnaswamy, D. (2025) · Elsevier eBooks · doi:10.1016/b978-0-443-29096-1.00007-6 · Cited by 1
AQUA: Hardware-Agnostic Qubit Allocation for Quantum Multi-Programming
Piao, X., Shim, J., Kim, J., & Kim, J. (2025) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps64566.2025.00022 · Cited by 2
Quantum machine learning: current trends and applications
Valsalam, S., & Thomas, T. (2025) · Elsevier eBooks · doi:10.1016/b978-0-443-29096-1.00004-0 · Cited by 1
Quantum Computing-The Underlying Principle Behind it
Chawla, A., Mathur, S., Rao, H., Mudgal, N., & Bhardwaj, V. (2025) · Prabha Materials Science Letters · doi:10.33889/pmsl.2025.4.2.020 · Cited by 1
11.3–13.6-GHz Cryo-CMOS 4P4T RF Switch for Superconducting Quantum Computer at mK Temperature
Lee, K., Park, H., & Song, H.-J. (2025) · IEEE Microwave and Wireless Technology Letters · doi:10.1109/lmwt.2025.3584337 · Cited by 1
Quantum Computing for Agricultural Optimization
Sehrawat, H., Kumari, T., Shubhranshu, D., et al. (2025) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-3373-0842-5.ch005 · Cited by 1
Quantum Cryptanalysis of Symmetric-Key Ciphers: Background and Challenges
Pal, D., Baksi, A., & Ganguly, A. (2025) · Springer eBooks · doi:10.1007/978-981-96-4948-8_9 · Cited by 1
Quantum Cryptographic Key Distribution Models and Protocols and Its Progress
Zaid, M. A. O. A., & Selvanambi, R. (2025) · Springer eBooks · doi:10.1007/978-981-96-4948-8_11 · Cited by 1
Quantum Computing and Cybersecurity: Navigating Threats and Opportunities
Malik, A. H., & Islam, S. M. N. (2025) · Springer eBooks · doi:10.1007/978-981-96-4948-8_18 · Cited by 1
Grover Adaptive Search With Spin Variables
Fujiwara, S., & Ishikawa, N. (2025) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2025.3595910 · Cited by 1
Complex-encoded quantum convolutional neural networks
Xiao, Z., Tan, X., Bao, D., & Huang, R. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-025-00310-3 · Cited by 1
Nandini, K., Singh, D. P., Kavitha, V. R., et al. (2025) · doi:10.1109/netcrypt65877.2025.11102526 · Cited by 1
Performance Evaluation of Quantum-Resistant Algorithms on Industrial Embedded Systems
Reichert, L., Coppik, N., & Finster, S. (2025) · Lecture notes in computer science · doi:10.1007/978-3-032-00630-1_8 · Cited by 2
pLazyQML: a parallel package for efficient execution of QML models on classical computers
García-Vega, D., Plou, F., Castaño, A. L., Combarro, E. F., & Ranilla, J. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-025-07714-9 · Cited by 3
A Practical Resonant MEMS Thermometer for Cryogenic Temperature Applications
Li, Y., Huo, B., Wang, Y., et al. (2025) · International Conference on Solid-State Sensors, Actuators and Microsystems · doi:10.1109/transducers61432.2025.11109745 · Cited by 1
On Post-Quantum Attribute-Based Encryption for Automotive Over-the-Air Software Updates
Dini, G., Lombardi, S., & Antonini, T. (2025) · IEEE International On-Line Testing Symposium (IOLTS) · doi:10.1109/iolts65288.2025.11117010 · Cited by 1
Zhu, M., Fu, H., Song, H., Wu, J., Zhang, C., Xie, W., & Li, X. (2025) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/3760783 · Cited by 6
Conserved Quantities in Linear and Nonlinear Quantum Search
MEYER, D. A., & Wong, T. G. (2025) · Quantum Information and Computation · doi:10.2478/qic-2025-0017 · Cited by 1
Guess-and-Determine Rebound: Applications to Key Collisions on AES
Qin, L., Bi, W., & Dong, X. (2025) · Lecture notes in computer science · doi:10.1007/978-3-032-01901-1_5 · Cited by 1
Meng, F., Liu, Y., Wang, L., Zhou, W., & Zhou, X. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04896-2 · Cited by 1
On the Security and Efficiency of Different Secure Hash Algorithms
Soni, A., & Sahay, S. K. (2025) · International Conference on Communication, Computing, Networking, and Control in Cyber-Physical Systems (CCNCPS) · doi:10.1109/ccncps66785.2025.11135672 · Cited by 1
Shuttling for Trapped-Ion Quantum Computers with Embedded Processing Zones
Schoenberger, D., Hilder, J., Schmidt‐Kaler, F., & Wille, R. (2025) · IEEE International Conference on Quantum Software (QSW) · doi:10.1109/qsw67625.2025.00023 · Cited by 2
Quantum Orchestrator Design for Service Management in Edge-Cloud Continuum
Zeydan, E., Mangues‐Bafalluy, J., Türk, Y., Aydeger, A., & Liyanage, M. (2025) · IEEE International Mediterranean Conference on Communications and Networking (MeditCom) · doi:10.1109/meditcom64437.2025.11104335 · Cited by 1
Quantum Partial Sorting for Efficient Signal Decoding in Spatially Modulated Wireless Systems
Alsaui, A. A., Al-Nahhal, I., & Dobre, O. A. (2025) · IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) · doi:10.1109/spawc66079.2025.11143437 · Cited by 1
Wu, Z., Man, Z., Yu, Z., Gao, C., & Meng, X. (2025) · Physica Scripta · doi:10.1088/1402-4896/adf0a0 · Cited by 1
An experience-based classification of quantum bugs in quantum software
Quetschlich, N., & Matteo, O. D. (2025) · Computing · doi:10.1007/s00607-025-01547-3 · Cited by 1
Improved Decryption Bounds and Key Generation for Matrix NTRU over Integral Domain
Sousa, T. D. R., & Neto, T. S. (2025) · doi:10.5753/sbseg.2025.9721 · Cited by 1
Quantum Mechanical Mechanism of DNA Forming and Replicating
Zhao, J. (2025) · Journal of Quantum Information Science · doi:10.4236/jqis.2025.153006 · Cited by 1
Arunkumar, S., Bhushan, S., Kumar, M., Yadav, R. K., & Kumar, P. (2025) · BENTHAM SCIENCE PUBLISHERS eBooks · doi:10.2174/9798898810092125010005 · Cited by 1
Scaling Grover’s Search for Large Solution Spaces
Faro, S., & Marino, F. P. (2025) · ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) · doi:10.1145/3731545.3744149 · Cited by 1
High-level quantum algorithm programming using Silq
Bezganovic, V., Lewis, M., Soudjani, S., et al. (2025) · ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) · doi:10.1145/3731545.3744152 · Cited by 1
Quantum Key Distribution in Multiparty Computation for Data Sorting by Entanglement
Sihare, S. R. (2025) · International Journal of Theoretical Physics · doi:10.1007/s10773-025-05944-4 · Cited by 1
Light as a Quantum Agent: Bridging Path Integrals and Reinforcement Learning
Poojary, B. B. (2025) · American Journal of Modern Physics · doi:10.11648/j.ajmp.20251405.11 · Cited by 1
Early IBM quantum computers: architectural analysis and performance benchmarks
AbuGhanem, M. (2026) · The Journal of Supercomputing · doi:10.1007/s11227-026-08386-9 · Cited by 1
Tiny Quantum, Giant Revolution
Chang, C., & Wang, M. (2025) · IEEE Nanotechnology Magazine · doi:10.1109/mnano.2025.3586000 · Cited by 1
The Quantum Advantage in Future Technologies for Supply Chain Optimization
Muralidhar, L. B., Shilpa, R., Kumar, V., Santhosh, Y., & Vainik, V. S. (2025) · IGI Global eBooks · doi:10.4018/979-8-3373-0649-0.ch012 · Cited by 1
Harnessing Patterns to Support the Development of Hybrid Quantum Applications
Vietz, D., Barzen, J., Beisel, M., Leymann, F., Stiliadou, L., & Weder, B. (2025) · International Conference on Software and Computer Applications (ICSCA) · doi:10.1145/3731806.3731809 · Cited by 1
Quantum annealing for linear spectral unmixing: a proof-of-concept
Riet, M., Wezeman, R. S., Bontekoe, T., Phillipson, F., & Veraverbeke, S. (2025) · International Journal of Remote Sensing · doi:10.1080/01431161.2025.2557584 · Cited by 1
Pioneering quantum authenticated key agreement through Grover’s algorithm
Chen, T., Lee, C.-D., & Chang, Y.-C. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04942-z · Cited by 1
On the quantum circuit implementation of fuzzy reasoning
Dai, S. (2025) · Fuzzy Sets and Systems · doi:10.1016/j.fss.2025.109611 · Cited by 1
A Review of Quantum Scientific Computing Algorithms Relevant to Computational Mechanics
Raisuddin, O. M., & De, S. (2025) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-025-10321-9 · 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
