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 8,101–8,200 of 8,792
Quantum Technology and its Applications
(NNSA), U. N. N. S. A., Boshier, M. G., Berkeland, D. J., Govindan, T., & Abo-Shaeer, J. R. (2010) · doi:10.2172/1044148
Coupling Down Converted Light Into Single Mode Fibers
Niemi, D. A. (2007) · ScholarsArchive (Brigham Young University)
Quantum vs Classical Ranking in Segment Grouping
Escolano, F., Bonev, B., & Hancock, E. R. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44415-3_21
Quantum algorithms for searching, resampling, and hidden shift problems
Ozols, M. (2012) · UWSpace (University of Waterloo)
Towards Secure Quantum Cloud Computing through NV-center enabled MDI-QKD
Hordijk, W. (2014) · Research Repository (Delft University of Technology)
SYMULACJA OBLICZEŃ KWANTOWYCH - SYSTEM QCS W ZASTOSOWANIACH DLA EDUKACJI
Sawerwain, M., & Zielonogórski, U. (2006)
FUANGARWORN, M. (2011) · INFM-OAR (INFN Catania) · doi:10.5281/zenodo.200730
SISE: Supersingular Isogeny-Based Symmetric Encryption
Min, M., & Alshamdayn, A. D. (2025) · IEEE Annual Computing and Communication Workshop and Conference (CCWC) · doi:10.1109/ccwc62904.2025.10903894
Neural Network Enhanced Robustness for Noisy Quantum Applications
Breslawski, D., Crimmins, A., & Alarcón, S. L. (2024) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc64395.2024.10937016
Inexpensive Linear-Optical Implementations of Deutsch's Algorithm
Stay, M. (2004) · ResearchSpace (University of Auckland)
On the Exploration of Post-Quantum Algorithms on COTS-Based Avionic Architectures
Hamel, J., de Magalhães, F. G., & Nicolescu, G. (2025) · IEEE Interregional NEWCAS Conference (NEWCAS) · doi:10.1109/newcas64648.2025.11107112
LABRIKI, F. E., Elassad, Z. E. A., Meslouhi, O. E., et al. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5525974
From Classical Challenges to Quantum Solutions: Grover’s Algorithm for the N-Queens Problem
Montiel, O., Orozco-Rosas, U., López, D., et al. (2025) · Studies in computational intelligence · doi:10.1007/978-3-031-85614-3_15
McGarraghy, S., & Venkova, M. (2025) · Springer eBooks · doi:10.1007/978-3-319-07153-4_68-1
Biometric Template Protection in Practice: An Attack-Driven FrameworkPreprint
Mahmood, S., Atmaca, U. I., Hooper, M., et al. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5599445
Quantum error mitigation via structural encoding with classical error correction codes
Sohn, I., Lee, C., Song, W., Bae, K., & Lee, W. (2026) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-026-00474-2
A Framework for Dynamic Quantum Circuit Execution: Balancing Effectiveness and Efficiency
Chen, F., Fu, H., Zhu, M., Zhang, C., Xie, W., & Li, X.-Y. (2025) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2025.3626447 · Cited by 1
Proposal for Quantum GRS Algorithm and Cryptanalysis for ROLLO and RQC
Wakasugi, A., & Tada, M. (2025) · Mathematics for industry · doi:10.1007/978-981-96-1218-5_8
Improving Hash-Based Signature Schemes: From Theory to Practice
Yuan, Q. (2025) · Mathematics for industry · doi:10.1007/978-981-96-1218-5_21
Quantum ( t, n ) Threshold Multisecret Sharing Based on Cluster States
Ma, R.-H., Chen, H.-N., Cai, B.-B., et al. (2025) · IEEE Internet of Things Journal · doi:10.1109/jiot.2025.3630672
Post-Quantum Blockchain-Based Secure Framework for Trustworthy Consumer Internet of Things
Ali, W., Din, I. U., Almogren, A., et al. (2025) · IEEE Transactions on Consumer Electronics · doi:10.1109/tce.2025.3632106
Optimal number of queries for phase-matching quantum search
Guţoiu, R. A., Tănăsescu, A., & Popescu, P. G. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04993-2
Egger, D. J., Riel, H., Woerner, S., & Zoufal, C. (2025) · Springer eBooks · doi:10.1007/978-3-031-90727-2_6
Post-Quantum Security of Keyed Sponge-Based Constructions Through a Modular Approach
Hosoyamada, A. (2025) · Lecture notes in computer science · doi:10.1007/978-981-95-5018-0_14
A Framework for Quantum Circuit Optimization: Comparators as a Case Study
Orts, F. J., & Gil-Merino, R. (2025) · IEEE Transactions on Computers · doi:10.1109/tc.2025.3642981
Counting Qubits and Gates: Resource Analysis in Quantum Programming Languages
Lago, U. D. (2025) · International Symposium on Principles and Practice of Declarative Programming (PPDP) · doi:10.1145/3756907.3756908
Cycle-Aware Parallel Optimization for Mitigating ZZ Crosstalk on Quantum Hardware
Zhong, J., & Deng, Y. (2025) · Proceedings of the International Conference on Parallel Processing · doi:10.1145/3754598.3754622 · Cited by 1
Q-GEAR: Improving quantum simulation framework
Guo, Z., Balewski, J. T., & Pan, Z. (2025) · Proceedings of the International Conference on Parallel Processing · doi:10.1145/3754598.3754608 · Cited by 2
Q-GEAR: Improving quantum simulation framework
Guo, Z., Balewski, J. T., & Pan, Z. (2025) · International Conference on Parallel Processing Workshops (ICPPW) · doi:10.1145/3750720.3757302
Resource Allocation for Satellite QKD Networks with Atmospheric Forecast
Park, S. G., Zhang, Q., Júnior, R. C. D. A. A., et al. (2025) · International Conference on Network and Service Management (CNSM) · doi:10.23919/cnsm67658.2025.11297452
Hermitian hulls of rational algebraic geometry codes and applications in quantum codes
Sok, L., Ezerman, M. F., & San, L. (2026) · Designs Codes and Cryptography · doi:10.1007/s10623-026-01939-2
Quantum collision attacks on reduced SHA-256.
Zhou, B.-M., Sun, H.-W., Zhang, X., et al. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-05024-w
QADL: Prototype of Quantum Architecture Description Language
Waseem, M., Ahmad, A., Mikkonen, T., Khan, M. T., Haghparast, M., Stirbu, V., & Liang, P. (2025) · International Conference on Evaluation and Assessment in Software Engineering (EASE) · doi:10.1145/3756681.3757034
Ospina, A., Riofrío, D., Grijalva, F., et al. (2025) · IEEE Ecuador Technical Chapters Meeting (ETCM) · doi:10.1109/etcm67548.2025.11304418
An Ameliorated Evaluation Framework for Standardizing Quantum Encryption Algorithms
Soumya, S., & Chithralekha, T. (2025) · Lecture notes in networks and systems · doi:10.1007/978-981-95-0684-2_26
Multi-Party Semi-Quantum Simultaneous Ascending Auction Protocol Based on Single-Particle States
Wu, X., Yang, Y., Wang, B. C., et al. (2025) · Entropy · doi:10.3390/e28010039
Adaptive ML-KEM: A Configurable HW-SW Architecture for Post-Quantum Cryptography
Wang, W., Liu, C., Sun, Z., et al. (2025) · Proceedings, IEEE International Conference on Computer Design/Proceedings - IEEE International Conference on Computer Design · doi:10.1109/iccd65941.2025.00113
Security Evaluation of Quantum Circuit Split Compilation Under an Oracle-Guided Attack
Zhang, H., & Liu, Y. (2025) · IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD) · doi:10.1109/iccd65941.2025.00053
Empirical Study of Quantum Algorithms
Mathur, H., Sandilya, R., Singh, B., et al. (2025) · doi:10.1109/ic366947.2025.11290218
Formal Analysis of Quantum Key Service Protocol
Song, H., Gu, L., Qi, W., et al. (2025) · International Conference on Computer Engineering and Intelligent Control (ICCEIC) · doi:10.1109/icceic67916.2025.11308953
Latency-Optimal Quantum Circuits for IoT Networks
Glisic, S., & Lorenzo, B. (2025) · IEEE Access · doi:10.1109/access.2025.3649805
Simulating Quantum Threats to Web3 Cryptographic Primitives using Qiskit
Kumar, V., Sharma, R., Aggarwal, I., & Ghosh, D. (2025) · International Conference on Contemporary Computing · doi:10.1109/ic366947.2025.11290415 · Cited by 1
Quantum-Enhanced Hardware Platforms for 6G Mobile Edge Computing
Ghaderi, S., Bassoli, R., & Fitzek, F. H. P. (2025) · IEEE Future Networks World Forum (FNWF) · doi:10.1109/fnwf66845.2025.11317287
Quantum Machine Learning Empowerment for Cloud Security: A Comprehensive Literature Review
Chandrasekhar, T., Lanka, D. R., Venkatesh, M., & Sankar, G. S. (2026) · Studies in big data · doi:10.1007/978-3-032-00586-1_21
Quantum Computing-Based Hyperparameter Optimization of Neural Networks
Chowdhury, P., & Sharma, K. (2026) · Studies in autonomic, data-driven and industrial computing · doi:10.1007/978-981-96-9083-1_24
Liu, K. J. R., Gu, X., Ren, P., et al. (2026) · Lecture notes in computer science · doi:10.1007/978-981-95-6206-0_9
Fang, S., Bi, J., Gao, Y., et al. (2026) · Lecture notes in computer science · doi:10.1007/978-981-95-3551-4_14
Qubits, Quantum Gates, and Quantum Circuits
Mishra, S. P., & Katakam, R. (2026) · Springer eBooks · doi:10.1007/978-3-032-10775-6_2
Efficient Implementation of Post-quantum Signature Algorithms for Next Generation of Blockchains
Bella, S. N., Abdulsalam, Y. S., & Hedabou, M. (2026) · Lecture notes in computer science · doi:10.1007/978-981-95-6206-0_2
Distributed Quantum Key Recovery Attack on Pseudorandom Functions
Zhang, K., Shang, T., Zhang, Y., et al. (2026) · Lecture notes in computer science · doi:10.1007/978-981-95-6206-0_24
Quantum Computing: Grover’s Algorithm for String Search and Its Practical Limits
Dagli, N., Salgado, J., Usman, Y., & Koçak, T. (2026) · Communications in computer and information science · doi:10.1007/978-3-032-08977-9_40
Quantum Enhanced Machine Learning: A Comprehensive Review
Nivedha, K. S., & Vijayalakshmi, M. (2026) · Springer eBooks · doi:10.1007/978-3-031-97385-7_37
New Key Encapsulation Method for Authentication in 5G Network in the Post-quantum Era
Khalimov, G., Sun, X., Kotukh, Y. V., et al. (2026) · Lecture notes in electrical engineering · doi:10.1007/978-981-95-0433-6_4
Quantum Generic Attacks on Feistel Schemes
Patarin, J., Volte, E., & Cogliati, B. (2026) · Information security and cryptography · doi:10.1007/978-3-031-99850-8_11
Impact of Quantum Computing on Cryptography
Lucas, J. M. M., Marques, M. M., & Lobo, V. (2026) · Smart innovation, systems and technologies · doi:10.1007/978-3-032-10947-7_25
Tighter Security Proof of Falcon $$^{+}$$ in the Quantum Random Oracle Model
Li, J., Jiang, H., Wang, H., et al. (2026) · Lecture notes in computer science · doi:10.1007/978-981-95-6206-0_8
QURE:Quantum-Resistant Encryption Strategies For Confidential Computing
Deepanshu, Majid, K., Valcarenghi, L., et al. (2025) · IEEE Future Networks World Forum (FNWF) · doi:10.1109/fnwf66845.2025.11317392
Logarithmic-Size Lattice-Based Linkable Ring Signature for Cloud Data Management
Chen, X., Xu, S., Guo, F., et al. (2026) · Lecture notes in computer science · doi:10.1007/978-981-95-4155-3_32
Quantum Algorithm for Reducing Amplitudes in Order to Search and Filter Data
Zakharova, K., Chernikov, A., & Sysoev, S. S. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-13127-0_23
Quantum Computing Fundamentals: Beyond Classical Bits
Karni, S., & Rajamandrapu, A. K. (2026) · Springer eBooks · doi:10.1007/978-3-032-10775-6_1
Lee, D., & Lee, S. (2026) · Scientific Reports · doi:10.1038/s41598-025-30625-x
Explicabilidad en algoritmos de búsqueda cuántica en hipercubo con valores de Shapley
Pezzini, M. C., Pons, C., & Bibbó, L. M. (2025) · Revista Abierta de Informática Aplicada · doi:10.59471/raia2025224
Iizumi, H., Ishikawa, N., Uehashi, S., Nakamura, K., Kurita, A., & Oga, M. (2025) · IEEE Vehicular Technology Conference · doi:10.1109/vtc2025-fall65116.2025.11310783
Xia, Q., Zhu, Q., Xie, H., & Yang, L. (2025) · Quantum Information and Computation · doi:10.2478/qic-2025-0024
Deterministic Quantum Search for Index Retrieval: Algorithm Design and Implementation
Mishra, H., Balasubramanyam, A., & Raghava, G. N. (2026) · doi:10.1145/3773656.3773688
Deep Learning-Integrated Pairwise-Qubit Subsystems for Highly Efficient Quantum Circuit Simulation
Pradata, S. Y., Amrizal, M. A., Suryanto, W., Nugraha, A. R. T., & Takizawa, H. (2026) · International Conference on High Performance Computing in Asia-Pacific Region (HPC Asia) · doi:10.1145/3773656.3773693
Quantum Circuits Are Just a Phase
Heunen, C., Lemonnier, L., McNally, C. M., et al. (2026) · Proceedings of the ACM on Programming Languages · doi:10.1145/3776731
Quantum data structure for range minimum query
Wang, Q., Xu, Z., & Zhang, Z. (2026) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2026.103756
Enhancing Neural Network with Quantum Computing
D’Souza, S. M., Prasad, R. R., Reddy, C. S., Reddy, P. U. M., Chethan, S. P., & Sushruth, M. S. (2026) · Lecture notes in networks and systems · doi:10.1007/978-981-96-8350-5_11
A finite state automaton for quantum computing
Kwon, Y., & Agha, G. (2026) · Quantum Information Processing · doi:10.1007/s11128-025-05047-3
Machine Learning with Quantum Computers
Nikoloska, I. (2026) · Machine intelligence for materials science · doi:10.1007/978-3-032-04129-6_20
Rieger, C., & Werner, M. (2025) · doi:10.1145/3764923.3777405
A Method for Validating a Boson Sampler Based on a Radial Function in the Space of Observable States
Rozhkov, N. A., & Rubtsov, A. N. (2025) · Bulletin of the Lebedev Physics Institute · doi:10.3103/s1068335625603954
Quantum3Enabled Cybercrime: A Portfolio Analysis of Cryptocurrency Theft and Double-Spending
Li, Z., & Liao, Q. (2025) · APWG Symposium on Electronic Crime Research (eCrime) · doi:10.1109/ecrime66972.2025.11327811
A parameter study for LLL and BKZ with application to shortest vector problems
Köppl, T., Zander, R., Henkel, L., & Tcholtchev, N. (2025) · IEEE Symposium on Computers and Communications (ISCC) · doi:10.1109/iscc65549.2025.11326330 · Cited by 2
Assessing Quantum Annealing to solve the Minimum vertex multicut
Abbassi, A., Dujardin, Y., Gourdin, É., Lacomme, P., & Prodhon, C. (2025) · International Conference on Control, Decision and Information Technologies (CoDIT) · doi:10.1109/codit66093.2025.11321767
Tyunina, A., & Shpineva, A. (2026) · All-Russian Scientific and Practical Conference «Challenging Issues in Systems Modeling and Processes» · doi:10.58168/ppspm2025_217-232
Quantum Computing and Generative AI
Kaswan, K. S., Dhatterwal, J. S., Malik, K., & Kantha, P. (2026) · Wiley eBooks · doi:10.1002/9781394305698.ch7
The quantum Rock-Paper-Scissors-Lizard-Spock Show
Manchikodi, B., Hosea, N. M., & Deshmukh, P. C. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05052-0
Thapa, S., Behuria, S., Das, A., Chakraborty, P., & Bandyopadhyay, A. (2026) · Elsevier eBooks · doi:10.1016/b978-0-443-33136-7.00011-6 · Cited by 1
FPGA Bitstream Modification Attacks on CRYSTALS Kyber
Chen, L., Lu, J., Huang, T., et al. (2025) · IEEE International Conference on ASIC (ASICON) · doi:10.1109/asicon66040.2025.11325860
Logarithmic-depth MCT gate implementation method on a given arbitrary number of clean ancillae
Lee, J., & Kang, Y. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05056-w
SaiPrasath, B., SasiKumar, R., & Dineshkumar, A. (2025) · International Conference on Applied Artificial Intelligence and Computing (ICAAIC) · doi:10.1109/icaaic64647.2025.11330392
Mishra, A. (2026) · SAE technical papers on CD-ROM/SAE technical paper series · doi:10.4271/2026-26-0622
Organizational Adoption of Post-Quantum Cryptography: Drivers, Barriers, and Strategic Implications
Zimmermann, D., Rajsingh, P. V., Cruz, E. D. L., Queiroz, H. J. D. S. D., Rana, S., & Nadella, G. S. (2025) · Cyber Awareness and Research Symposium (CARS) · doi:10.1109/cars67163.2025.11337269 · Cited by 1
Optimization of Approximate Quantum Random Access Memory for NISQ Devices
Sajadimanesh, S., Faye, J. P. L., & Atoofian, E. (2025) · IEEE International Conference on Quantum Artificial Intelligence (QAI) · doi:10.1109/qai63978.2025.00062
A Quantum Circuit Optimization Framework for Distributed Quantum Computing
Liu, F., Liu, F., Fei, Y., et al. (2026) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2026.3656760
Grover algorithm and absolute zeta functions
Akahori, J., Horita, K., Konno, N., et al. (2026) · International Journal of Quantum Information · doi:10.1142/s0219749926500061
Quadratic Continuous Quantum Optimization
Mücke, S., Gerlach, T., & Piatkowski, N. (2025) · doi:10.1109/qai63978.2025.00041
Hernandez-Martinez, J. I., Juárez-Osorio, S. L., Méndez-Vázquez, A., Rodriguez‐Hernandez, G., & Rodríguez-Tello, E. (2025) · IEEE International Conference on Quantum Artificial Intelligence (QAI) · doi:10.1109/qai63978.2025.00020
Validation Framework for Module Lattice-Based Post-Quantum Digital Signature Scheme
Havanur, S. G., Kumar, R., & Jacob, A. (2025) · IEEE International Conference on Public Key Infrastructure and its Applications (PKIA) · doi:10.1109/pkia67529.2025.11347178
Connecting Quantum Computing with Classical Stochastic Simulation
Blanchet, J., Squillante, M. S., Szegedy, M., & Wang, G. (2025) · Winter Simulation Conference · doi:10.1109/wsc68292.2025.11339097
Design and Implementation of a Post-Quantum Double Ratchet Using ML-KEM
Angom, A., Kar, N., Debbarma, T., et al. (2025) · doi:10.1109/pkia67529.2025.11347146
An Effective QUBO Formulation for Knapsack Problems
Samanta, S., Wang, D.-G., Hodges, T. M. W., & Ferenczi, A. (2025) · 2025 IEEE International Conference on Quantum Artificial Intelligence (QAI) · doi:10.1109/qai63978.2025.00039 · Cited by 1
Quantifying the quantised – the interface of quantum technology and safety
Cruise, J., Appanah, D., Oates, R., et al. (2025) · doi:10.65391/r3337
Quantum Meet-in-the-Middle Attacks on Two-Key 3DES
Gao, R., Wu, J., & Liang, M. (2026) · Communications in computer and information science · doi:10.1007/978-981-95-4791-3_10
Amplitude-Ensemble Quantum-Inspired Tabu Search Algorithm for Quantum Boolean Circuit Synthesis
Tseng, K.-C., Sun, Z., Ho, P.-L., et al. (2025) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/smc58881.2025.11343273
A Semi-Quantum Protocol for Multi-Party Simultaneous Ascending Auctions
Wu, X., Yang, Y., Wang, B. C., et al. (2025) · doi:10.1109/isaics66888.2025.11350211
Lee, Y.-S., Lee, J., & Kang, Y. (2026) · ETRI Journal · doi:10.4218/etrij.2025-0299
Machine Learning by Adiabatic Evolutionary Quantum Systems
Yamakami, T. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-15641-9_16
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
