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,901–6,000 of 8,792
Dynamical Localization and Transport properties of Quantum Walks on the hexagonal lattice
Schaëfer, A. (2025) · Mathematical Physics Analysis and Geometry · doi:10.1007/s11040-025-09531-1 · Cited by 2
qblaze: An Efficient and Scalable Sparse Quantum Simulator
Venev, H., Udomsrirungruang, T., Dimitrov, D., Gehr, T., & Vechev, M. (2025) · Proceedings of the ACM on Programming Languages · doi:10.1145/3763066 · Cited by 1
Liu, S., & Xie, G. (2025) · Journal of Forecasting · doi:10.1002/for.70047 · Cited by 1
Švarcmajer, M., Krčmar, T., Šabanović, D., & Lukić, I. (2025) · International Symposium ELMAR (ELMAR) · doi:10.1109/elmar66948.2025.11193746 · Cited by 2
End-to-end quantum algorithm for topology optimization in structural mechanics
Hölscher, L., Ahrend, O., Karch, L., L'Estocq, C., Marfany, M. A., Stollenwerk, T., Wilhelm, F. K., & Kowalski, J. (2026) · Quantum Science and Technology · doi:10.1088/2058-9565/ae4cfe · Cited by 2
Asymptotic Improvements to Provable Algorithms for the Code Equivalence Problem
Bennett, H., Bhatia, D., Biasse, J., et al. (2025) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit63088.2025.11195271 · Cited by 1
Quantum Automating TC0-Frege Is LWE-Hard
Arteche, N., Carenini, G., & Gray, M. (2025) · Computational Complexity · doi:10.1007/s00037-025-00271-w · Cited by 1
Manzanaro, M. A., & Mora, H. (2025) · Lecture notes in networks and systems · doi:10.1007/978-3-032-07992-3_20 · Cited by 1
A dynamic quantum-resistant code-based public key encryption scheme
Raju, P., Chithralekha, T., Singh, K., Ganesan, G., & Rajarajan, M. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04976-3 · Cited by 1
Quantum cryptanalysis on Feistel variants in related-key settings
Wang, X., Chen, S., Xiang, Z., et al. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04975-4 · Cited by 1
Quantum walk with coherent multiple translations induces fast quantum gate operations
Zhang, Y., Qiao, X., Wang, L., He, Y., Dong, Z., Chen, X., & Yuan, L. (2026) · Light Science & Applications · doi:10.1038/s41377-025-02106-3 · Cited by 1
Quantum Computing in Healthcare: Exploring Mathematical Aspects, Algorithms and Applications
Singh, R., Nishad, D. K., Chaudhary, A., & Kumar, V. (2025) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-025-10461-y · Cited by 1
Palanisamy, Y., Kathirvelu, M., Muthusamy, S., & Azhaganantham, A. (2025) · Analog Integrated Circuits and Signal Processing · doi:10.1007/s10470-025-02522-w · Cited by 1
Mitarai, H., Tadokoro, Y., & Tanaka, H. (2026) · Physical Review Applied · doi:10.1103/fmqf-w6ht · Cited by 1
A new and efficient fair quantum secret sharing scheme
Gu, J., Li, F., & Zhu, S. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-05006-y · Cited by 1
Quantum Security of Nonce-Based Encryption
Mao, S., Wang, P., Jia, Y., Liu, G., & Liu, B. (2025) · Entropy · doi:10.3390/e27121194 · Cited by 1
Quantum sequel of neural network training
Zhang, H., & Kamenev, A. (2025) · Communications Physics · doi:10.1038/s42005-025-02384-8 · Cited by 3
Orchestrating Multi-Zone Shuttling in Trapped-Ion Quantum Computers
Schoenberger, D., & Wille, R. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00119 · Cited by 1
Quantum Circuit Design for Decoded Quantum Interferometry
Patamawisut, N., Benchasattabuse, N., Hajdušek, M., & Meter, R. V. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00041 · Cited by 1
On the Potential of Quantum Computing in Classical Program Analysis
Guang, Y., Zanotta, P., Zhou, K., Chen, Y., & Ayanzadeh, R. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00257 · Cited by 2
Online Job Scheduler for Fault-Tolerant Quantum Multiprogramming
Wakizaka, R., Nishio, S., Sakuma, D., Ueno, Y., & Suzuki, Y. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00090 · Cited by 1
An Adaptive Weighted Qite-Vqe Algorithm for Combinatorial Optimization Problems
Xie, N., Lee, X., Chen, T., Saito, Y., Asai, N., & Cail, D. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00032 · Cited by 1
Efficient QAOA Architecture for Solving Multi-Constrained Optimization Problems
Bucher, D., Porawski, D., Janetschek, M., Stein, J., O’Meara, C., Cortiana, G., & Linnhoff–Popien, C. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00048 · Cited by 1
Application-Driven Benchmarking of the Traveling Salesperson Problem: a Quantum Hardware Deep-Dive
Bentellis, A., Poggel, B., & Lorenz, J. M. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00207 · Cited by 1
An Implementation of Quantum Oracles for the Finite Element Method
Danz, S., Stollenwerk, T., & Ciani, A. (2026) · SIAM Journal on Scientific Computing · doi:10.1137/25m1761513 · Cited by 2
Belani, G., Kasina, P. K., Baig, M. Z., Vaddeboina, A. T., Nainwal, V., & Kumar, A. (2025) · IEEE India Council International Subsections Conference (INDISCON) · doi:10.1109/indiscon66021.2025.11252257 · Cited by 1
Jang, S., Lee, H. S., Agrawal, R., Maji, S., Gierlach, A., Byrne, C., Flaumenhaft, B., Schmidt, K., Li, J., Traverso, G., et al. (2025) · Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC) · doi:10.1109/embc58623.2025.11254204 · Cited by 1
A Hybrid ASCON–Kyber Lightweight Framework Using MQTT Protocol for Constrained Devices
Suleiman, F., & Javeed, K. (2025) · doi:10.1109/iceee67194.2025.11262027 · Cited by 1
The Order of Hashing in Fiat-Shamir Schemes
Benedikt, B. J., & Fischlin, M. (2025) · Lecture notes in computer science · doi:10.1007/978-981-95-5113-2_4 · Cited by 1
Quantum Computing Today: A Status Overview
Liu, Y. (2025) · Computer · doi:10.1109/mc.2025.3617743 · Cited by 1
Characterizing quantum internet using complex network models
Silveira, O. J. R., da Silva, N. B., da Silva, S. L. L., & da Mata, A. S. (2025) · The European Physical Journal Special Topics · doi:10.1140/epjs/s11734-025-02093-x · Cited by 1
Supervised Quantum Machine Learning
Monroy-Azpeitia, A., Montiel-Pérez, J. Y., Maldonado-Romo, A., Arvizu-Velazquez, A. A., López-Bonilla, J. L., & Vidal-Beltrán, S. (2025) · Studies in computational intelligence · doi:10.1007/978-3-031-85614-3_10 · Cited by 1
A Performance Evaluation of Post Quantum Digital Signatures for Proof of Stake Consensus
Judd, T. E., & Uludag, S. (2025) · doi:10.1109/satc65530.2025.11136860 · Cited by 1
A secure communication in distributed system using quantum key distribution
Parihar, A. S. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-025-07964-7 · Cited by 1
Quantum inspired image encryption using dual chaotic maps
Musanna, F. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04999-w · Cited by 2
Cyberbezpieczeństwo systemu finansowego
Wawrzyniak, D. (2025) · Wroclaw University of Economics and Business eBooks · doi:10.15611/2025.97.9 · Cited by 1
Blind Quantum Computation With Certified Deletion for Quantum Inputs
Quan, J., Wang, Y., Li, Q., & Li, L. (2025) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2025.3645605 · Cited by 1
Wang, T., Dai, M., Guo, H., et al. (2025) · IEEE Network · doi:10.1109/mnet.2025.3637846 · Cited by 1
Quantum Machine Learning for Drug Discovery: Taxonomy, Research Challenges, and the Road Ahead
Duong, Y. H. P., Rizvi, S. M. A., McNiven, B. D. E., Nguyen, T. T., Shin, H., Dobre, O. A., & Duong, T. Q. (2025) · ACM Computing Surveys · doi:10.1145/3785660 · Cited by 3
Quantum Opacity, Classical Clarity: A Hybrid Approach to Quantum Circuit Obfuscation
Raj, A., & Balachandran, V. (2025) · doi:10.1145/3733817.3762698 · Cited by 1
Optimal compilation strategies for QFT circuits in neutral-atom quantum computing
Gao, D., Li, Y., Ying, S., & Li, S. (2025) · Scientific Reports · doi:10.1038/s41598-025-32572-z · Cited by 1
ECGText: Maximizing GPT Capabilities for Enhanced Text Generation and Emotional Insight
Roy, B. N., Maity, S., Singh, K. R., Chowdhury, P., Das, A., & Saha, D. (2025) · SN Computer Science · doi:10.1007/s42979-025-04564-3 · Cited by 1
Enhancing the yield of bucket brigade quantum random access memory using redundancy repair
Kim, D., Heng, S., Lee, S., & Han, Y. (2025) · Scientific Reports · doi:10.1038/s41598-025-32955-2 · Cited by 4
Understanding qubit trajectories in parametrized quantum circuits
Oh, S., Im, C., Park, S., & Kim, J. (2025) · Physical Review A · doi:10.1103/1x3t-9kzq · Cited by 2
QMin: Quantum Circuit Minimization via Gate Fusions for Efficient State Vector Simulation
Xu, L., Sha, E. H. ‐., Song, Y., & Zhuge, Q. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-05028-6 · Cited by 1
Senapati, P., Zhu, S., Peng, B., Fang, B., & Guan, Q. (2025) · IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD) · doi:10.1109/iccd65941.2025.00058 · Cited by 1
Quantum Meta-Learning for Adaptive Task Offloading in Dynamic Edge Computing Networks
Tran-Dang, H., & Kim, D.-S. (2025) · International Conferences on Smart Internet of Things · doi:10.1109/smartiot66867.2025.00072 · Cited by 2
An Efficient Quantum Classifier Based on Hamiltonian Representations
Tiblias, F., Schroeder, A. K., Zhang, Y., Gachechiladze, M., & Gurevych, I. (2026) · Communications in computer and information science · doi:10.1007/978-3-032-13883-5_5 · Cited by 1
Quantum Computing and Blockchain: Advanced Security in Metaverse
Dhar, P., Panwar, R., & Kumar, A. (2026) · Information systems engineering and management · doi:10.1007/978-3-032-07305-1_3 · Cited by 1
Quantum Computing in Security and Cryptography: Challenges and Future Directions
Thawani, P. V., Ajmre, P. E., & Chaurasia, S. A. (2026) · Studies in big data · doi:10.1007/978-3-032-00586-1_10 · Cited by 1
Enhancing Blockchain with Quantum-Safe Verification: A Quantum Fingerprinting Framework
Hernández-Bueno, J., Lage, Ó., Higuero, M., Seco-Aguirre, I., & Bernabé-Rodríguez, J. (2026) · Lecture notes in networks and systems · doi:10.1007/978-3-032-05877-5_3 · Cited by 1
Quantum Algorithms for Hopcroft's problem
Andrejevs, V., Belovs, A., & Vihrovs, J. (2026) · ACM Transactions on Quantum Computing · doi:10.1145/3787461 · Cited by 1
Quantum-Assisted Maximum Likelihood Detection of Generalized Spatial Modulation
Mikuriya, T., Rou, H. S., de Abreu, G. T. F., Ishibashi, K., & Ishikawa, N. (2025) · IEEE Vehicular Technology Conference · doi:10.1109/vtc2025-fall65116.2025.11310105 · Cited by 1
Generating Compilers for Qubit Mapping and Routing
Molavi, A., Xu, A., Cecchetti, E., Tannu, S., & Albarghouthi, A. (2026) · Proceedings of the ACM on Programming Languages · doi:10.1145/3776720 · Cited by 5
Minimizing Communications of Quantum Circuit Simulations on Distributed Systems
Xu, L., Sha, E. H. ‐., Song, Y., Chi, Y., & Zhuge, Q. (2026) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2026.3652733 · Cited by 1
D’Onghia, G., & Lioy, A. (2025) · IEEE Symposium on Computers and Communications (ISCC) · doi:10.1109/iscc65549.2025.11326490 · Cited by 2
Mapping the quantum computing landscape: growth, collaboration, and thematic convergence
Conde-Torres, D., Seco-González, A., Piñeiro, Á., & Fandino, R. G. (2026) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-026-00464-4 · Cited by 1
Hybrid Encryption with Certified Deletion in Preprocessing Model
Dey, K., & Safavi–Naini, R. (2026) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit62367.2026.11653785 · Cited by 1
Quantum Computing for Cyber Threat Detection
Begum, S. H., Mohammed, I., Rahman, S., & Khan, M. O. W. (2025) · International Conference on Applied Artificial Intelligence and Computing (ICAAIC) · doi:10.1109/icaaic64647.2025.11330692 · Cited by 1
Quantum fractional revival on unitary Cayley graphs over finite commutative rings
Jitngam, S., Kumam, P., & Sriwongsa, S. (2026) · Linear and Multilinear Algebra · doi:10.1080/03081087.2026.2619930 · Cited by 1
A Comprehensive Approach to Optimizing Complex Systems
Zabinsky, Z. B., & Maneekul, P. (2025) · Winter Simulation Conference · doi:10.1109/wsc68292.2025.11338921 · Cited by 1
Triple equivalence in modelling insight and creativity: Classical and quantum perspectives
Isomura, T. (2026) · Neuroscience Research · doi:10.1016/j.neures.2026.105025 · Cited by 1
A hybrid quantum authentication model (HQAM) with QRNG enhanced protection
Belkhir, M., Benkaouha, H., & Benkhelifa, E. (2026) · International Journal of Information Security · doi:10.1007/s10207-026-01210-8 · Cited by 1
On the construction of quantum circuits for S-boxes with different criteria based on the SAT solver
Lin, D., Yang, C., Xu, S., Tian, S., & Sun, B. (2026) · Quantum Information Processing · doi:10.1007/s11128-025-05049-1 · Cited by 1
Enterprise-Ready Post-Quantum Zero Trust Storage: The QSS4 Architecture
Dutthan, K. S. P., Kavikkannan, K., Divyashree, S., et al. (2026) · SN Computer Science · doi:10.1007/s42979-025-04705-8 · Cited by 1
Bertini, B. (2026) · Nature Physics · doi:10.1038/s41567-026-03173-y · Cited by 1
Leveraging quantum computing business applications: a B-SLR approach and future research directions
Sarin, G., Reddy, Y. S., & Sarin, M. (2026) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-026-00475-1 · Cited by 1
Quantum artificial intelligence and cryptographic security from a quantum cryptography perspective
Gençoğlu, M. T. (2026) · Discover Quantum Science · doi:10.1007/s44464-026-00008-w · Cited by 2
Quantum advantage for multi-option portfolio pricing and valuation adjustments
Han, J. Y., Cheng, B., Vu, D.-L., et al. (2026) · Quantitative Finance · doi:10.1080/14697688.2026.2614573 · Cited by 1
Quantum-Secure Privacy-Preserving Profile Matching for Proximity-Based Mobile Social Networks
Huang, X., Zhang, W., Zhang, S., & Khan, M. K. (2026) · IEEE Transactions on Consumer Electronics · doi:10.1109/tce.2026.3666093 · Cited by 2
Elumalai, D. K., & Palavali, D. R. (2026) · IEEE Annual Computing and Communication Workshop and Conference (CCWC) · doi:10.1109/ccwc67433.2026.11393755 · Cited by 1
Vukšić, M., Ćelić, J., & Cuculić, A. (2026) · IEEE Access · doi:10.1109/access.2026.3670749 · Cited by 1
Dalporto, B. A. L., Mary, S., & Gallur, S. (2026) · Revista Multidisciplinar Epistemología de las Ciencias · doi:10.71112/05g0gd73 · Cited by 1
A hybrid lightweight and post-quantum communication framework for NB-IoT networks
Thi, B. D., & Tran, Q.-H. (2026) · Microsystem Technologies · doi:10.1007/s00542-026-06031-2 · Cited by 1
Quantum computing in transport science: a review
Niu, C., Irannezhad, E., Myers, C. R., & Dixit, V. (2026) · Transportation Letters · doi:10.1080/19427867.2026.2640414 · Cited by 1
Quantum Oracle Synthesis from HDL Designs via Multi Level Intermediate Representation
Lancellotti, G., Buda, F., Carugati, G., Gazzola, D., Barenghi, A., Agosta, G., & Pelosi, G. (2026) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1109/asp-dac66049.2026.11420750 · Cited by 1
A Resource Efficient Ising Model‐Based Quantum Sudoku Solver
Wang, W.-L., Tang, M.-H., Wang, K., Basit, M. A., Tian, Y., & Haque, M. S. (2026) · Software Practice and Experience · doi:10.1002/spe.70063 · Cited by 2
Manjunath, V., Sathyanarayanan, S., Purushothaman, R., Elengovan, A. K., Shanbhag, J., & Keshava, R. (2025) · International Conference on Computer and Applications (ICCA) · doi:10.1109/icca66035.2025.11430991 · Cited by 1
Graph-encoded strategic interactions in multiplayer quantum games
Tsakiroglou, M., Liliopoulos, I., Varsamis, G. D., Milchanowski, K. L., & Karafyllidis, I. G. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05127-y · Cited by 1
A Kyber-Based Lightweight Cloud-Assisted Authentication Scheme for Medical IoT
He, Y., Wang, Z., Lin, L., Sun, J., & Liu, S. (2026) · Sensors · doi:10.3390/s26072021 · Cited by 4
Wang, Y.-J., Sun, T., Zhuang, X., Xu, X., Liu, H., Xue, C., Wu, Y.-C., Chen, Z., & Guo, G. (2026) · Physical Review Applied · doi:10.1103/r2pt-dzn8 · Cited by 2
BB84 a new hope enhanced QKD for secure email communication with additional quantum gates
S, S. R., Senthilkumar, Y., & Karthick, V. (2026) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-026-00493-z · Cited by 2
C2|Q>: A Robust Framework for Bridging Classical and Quantum Software Development
Ye, B., Khan, A. A., Pihkakoski, T., Liang, P., Akbar, M. A., Silveri, M., & Malmi, L. (2026) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3803018 · Cited by 1
QW-HHL: A Quantum Computer Amenable General Matrix Equation Solver
Phillips, C. D., Akbari, H., & Okhmatovski, V. (2026) · IEEE journal on multiscale and multiphysics computational techniques · doi:10.1109/jmmct.2026.3678506 · Cited by 1
Generation of Optimised Quantum Oracles Using Grammar-Based Genetic Programming
Zayas-Gallardo, J., Chicano, F., Canal, C., et al. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-36226-1_19 · Cited by 1
Quantum-Enhanced Blockchain Framework for Secure and Resilient Healthcare Data Management
Nidhipa, M. M., Priya, L. K., Prarthana, M., Jayapriya, R., & Rajagopalan, N. (2026) · IGI Global eBooks · doi:10.4018/979-8-3373-7189-4.ch007 · Cited by 1
Al-Bayaty, A., Al-Shuwaili, A., Alzubaidi, A. H., & Perkowski, M. A. (2026) · International Conference on Computing and Emerging Sciences · doi:10.1145/3797491.3797543 · Cited by 1
Training Students for Research with Quantum AI Simulation Tools
Patel, T. K., Babar, N. A., Pujara, D., Uehara, G. S., Larson, J. S., & Spanias, A. (2026) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp55912.2026.11464300 · Cited by 1
Iterative Matrix Product State Simulation for Scalable Grover’s Algorithm
Sam, M. I., Kuo, T.-L., & Li, T.-Y. (2026) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp55912.2026.11461240 · Cited by 1
Moghaddam, B. P., Zaky, M. A., Dabiri, A., et al. (2026) · International Journal of Modern Physics C · doi:10.1142/s0129183126430047 · Cited by 1
ccPASTpqc: Post Quantum Cryptography Migration of Programs Using Code Language Models
Wahlang, R., & Vidhani, K. (2025) · Joint International Conference on Data Science & Management of Data (CODS-COMAD) · doi:10.1145/3799830.3799836 · Cited by 1
A review of quantum machine learning algorithms, applications, and emerging advantages
Gokhale, S. S., Dhote, R. R., & Delhibabu, R. (2026) · Discover Computing · doi:10.1007/s10791-026-10085-1 · Cited by 7
Allam, H., & Trivedi, S. (2026) · Journal of Smart Algorithms and Applications (JSAA) · doi:10.66279/jaksw134 · Cited by 1
On the convergence of Markov chain distribution within quantum walk circuit subspace
Ramos, A., Pascual, J. A., Navaridas, J., & Coluzza, I. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05158-5 · Cited by 1
Hybrid algorithm of quantum gate/annealing and classical computer for truss topology optimization
Wang, Z., & Wang, X. (2026) · Acta Mechanica Sinica · doi:10.1007/s10409-025-25521-x · Cited by 1
Co-designed counterdiabatic quantum optimization on a photonic quantum processor
Shang, X.-W., Chen, X., Hegade, N. N., Lan, Z.-F., Tang, H., Dou, J.-P., Li, X.-K., Peng, Y.-Q., Solano, E., & Jin, X. (2026) · Physical Review Applied · doi:10.1103/7gl4-zrh6 · Cited by 3
QERA: A QUANTUM ECONOMIC RISK ASSESSMENT FRAMEWORK FOR BLOCKCHAIN CRYPTOGRAPHIC INFRASTRUCTURE
Pillai, B., Rao, A. S., Madineni, N., Karaca, Y., & Chang, E. J. (2026) · Fractals · doi:10.1142/s0218348x26400645 · Cited by 1
Quantum annealing heuristics for the job shop scheduling problem with availability constraints
Deleplanque, S., Armas, L. F. P., & Aggoune, R. (2026) · Journal of Heuristics · doi:10.1007/s10732-026-09594-5 · Cited by 1
Post-Quantum DAG-Based Blockchain for Securing Vehicular Sensor Networks
Ahmed, S., Tariq, N., Khan, F. A., & Chauhdary, S. H. (2026) · IEEE Transactions on Consumer Electronics · doi:10.1109/tce.2026.3688933 · Cited by 3
Entropic optimal transport with quantum amplitude estimation
Orts, F. J. (2026) · Future Generation Computer Systems · doi:10.1016/j.future.2026.108570 · Cited by 1
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
