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 4,601–4,700 of 8,792
Quantum Circuits for Functionally Controlled NOT Gates
Soeken, M., & Roetteler, M. (2020) · 2020 IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00052 · Cited by 4
Geometry of distributive multiparty entanglement in 4 − qubit hypergraph states
Sarkar, R., Banerjee, S., Bag, S., et al. (2021) · IET Quantum Communication · doi:10.1049/qtc2.12027 · Cited by 3
Dedicated Quantum Attacks on XOR-Type Function With Applications to Beyond-Birthday- Bound MACs
Shi, T., Wu, W., Hu, B., Guan, J., Sui, H., Wang, S., & Zhang, M. (2024) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2024.3402970 · Cited by 3
Benchmarking variational quantum algorithms for combinatorial optimization in practice
Schwägerl, T., Chai, Y., Hartung, T., Jansen, K., & Kühn, S. (2026) · Quantum Machine Intelligence · doi:10.1007/s42484-026-00355-y · Cited by 3
Tian, J., & Yang, W. (2024) · Entropy · doi:10.3390/e26110902 · Cited by 6
Cryptographic Primitives in Script-based and Scriptless Payment Channel Networks: A Survey
Chen, X., Lai, J., Lin, C., Huang, X., & He, D. (2025) · ACM Computing Surveys · doi:10.1145/3725846 · Cited by 6
Interleaved Logical Qubits in Atom Arrays
Viszlai, J., Lin, S. F., Dangwal, S., Bradley, C. E., Ramesh, V., Baker, J. M., Bernien, H., & Chong, F. T. (2025) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca61900.2025.00030 · Cited by 4
Hybrid Quantum-Classical Algorithms for Neural Network-Based Binary Disease Classification
Arquam, M., Pathak, V., Tripathi, V., et al. (2025) · Communications in computer and information science · doi:10.1007/978-981-96-5887-9_25 · Cited by 3
SliQSim: A Quantum Circuit Simulator and Solver for Probability and Statistics Queries
Chen, T.-F., & Jiang, J.-H. R. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-90660-2_7 · Cited by 3
Li, B., & Liu, Q. (2025) · Lecture notes in computer science · doi:10.1007/978-981-96-4734-7_20 · Cited by 3
Privacy-preserving computation meets quantum computing: A scoping review
Gómez-Goiri, A., Seco-Aguirre, I., Lage, Ó., & Ruíz, A. (2025) · Digital Communications and Networks · doi:10.1016/j.dcan.2025.05.010 · Cited by 4
Accelerating SPHINCS+ Using RISC-V Domain-Specific Processor on Multi-Core Systems
Zhang, S., Zhao, Y., Yu, X., et al. (2025) · Integrated Circuits and Systems · doi:10.23919/ics.2025.3579338 · Cited by 3
Multi-server Password authenticated Key Exchange Protocol Based on MLWE
Yang, Y., Song, S., & Guo, S. (2025) · International Conference on Computer Network Security and Software Engineering (CNSSE) · doi:10.1145/3732365.3732394 · Cited by 3
Physics-inspired Generative AI models via real hardware-based noisy quantum diffusion
Parigi, M., Martina, S., Venturelli, F. A., & Caruso, F. (2026) · Quantum Machine Intelligence · doi:10.1007/s42484-026-00459-5 · Cited by 6
Analyzing Classical Cryptosystem Vulnerabilities Using Quantum Cryptanalysis Techniques
Sharma, V., & Soni, K. K. (2025) · International Conference on Recent Advances in Information Technology · doi:10.1109/rait65068.2025.11088960 · Cited by 3
Man, Z., & Li, S. (2025) · Expert Systems with Applications · doi:10.1016/j.eswa.2025.129040 · Cited by 3
Chiu, S.-W., Yang, C.-M., Hou, S.-J., Huang, P.-H., Wang, C.-C., Tu, C.-H., & Hung, S. (2025) · Practice and Experience in Advanced Research Computing · doi:10.1145/3708035.3736006 · Cited by 3
Quantum-safe Signatureless DNSSEC
Rawat, A. S., & Jhanwar, M. P. (2025) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/3708821.3710837 · Cited by 3
Lightweight Quantum Neural Networks Intelligent Generation
Wang, W., Xu, J., Liu, F., Zhou, B., Wang, W., Wang, H., Du, Q., Yuan, B., Huang, Y., Hou, Y., et al. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202500302 · Cited by 3
Dicke State Quantum Search for Solving the Vertex Cover Problem
Jiang, J. (2025) · Mathematics · doi:10.3390/math13183005 · Cited by 4
Integrating and Benchmarking KpqC in TLS/X.509
Sim, M., Song, G., Eum, S., Lee, M., Yoon, S., Baksi, A., & Seo, H. (2025) · Electronics · doi:10.3390/electronics14183717 · Cited by 6
A Benchmarking Framework for Hybrid Quantum–Classical Edge-Cloud Computing Systems
Yao, G., & Gupta, L. (2025) · Applied Sciences · doi:10.3390/app151810245 · Cited by 3
Refinement Calculus of Quantum Programs with Projective Assertions
Feng, Y., Zhou, L., Xu, Y., & Xu, X. (2025) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3770083 · Cited by 3
Eavesdropper Detection in Six-State Protocol Against Partial Intercept–Resend Attack
Fiorini, F., Garroppo, R. G., Pagano, M., & Yadzhak, R. S. (2025) · Future Internet · doi:10.3390/fi17110500 · Cited by 3
Universal Graph Representation of Stabilizer Codes
Khesin, A. B., Lu, J. Z., & Shor, P. W. (2025) · PRX Quantum · doi:10.1103/1gjs-2rhx · Cited by 16
An entanglement-free authenticated quantum key distribution protocol
Li, X., Li, S., Li, J., et al. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04969-2 · Cited by 3
Implementation of a Quantum Addressable Router Using Superconducting Qubits
Miao, C., Leger, S., Li, Z., Lee, G., Jiang, L., & Schuster, D. (2025) · PRX Quantum · doi:10.1103/pq3x-cmw9 · Cited by 6
Alwan, N. A., Obaiys, S. J., Al-Saidi, N. M. G., Noor, N. F. B. M., & Karaca, Y. (2025) · Scientific Reports · doi:10.1038/s41598-025-24168-4 · Cited by 3
Decoherence and quantum threats in voice biometric authentication with post-quantum countermeasures
Sihare, S. R. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04980-7 · Cited by 3
Evaluating Post-Quantum Cryptographic Algorithms on Resource-Constrained Devices
Lopez, J., Cadena, V., & Rahman, M. S. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00103 · Cited by 3
Solving Large-Scale Vehicle Routing Problems with Hybrid Quantum-Classical Decomposition
Maciejunes, A., Stenger, J., Gunlycke, D., et al. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00234 · Cited by 3
Mitigating Tails Switching in Multibranch Proof-of-Stake Systems: A Quantum-Inspired Approach
Badami, S. (2025) · International Conference on Business Analytics for Technology and Security (ICBATS) · doi:10.1109/icbats66542.2025.11258220 · Cited by 3
Distribution-adaptive dynamic shot optimization for variational quantum algorithms
Kim, Y., Jang, E., Kim, H. J., Choi, S., Lee, C., Kim, D., Kyoung, W., Shin, K., & Ro, W. W. (2025) · Physical Review Research · doi:10.1103/vwhk-22b8 · Cited by 5
Zamil, A. K., & Jasim, A. D. (2025) · Mesopotamian Journal of CyberSecurity · doi:10.58496/mjcs/2025/066 · Cited by 4
Post-quantum Security of Key-Alternating Feistel Ciphers
Basak, J., Bhaumik, R., Chauhan, A. K., Jejurikar, R., Jha, A., Roy, A., Schrottenloher, A., & Talnikar, S. (2025) · Lecture notes in computer science · doi:10.1007/978-981-95-5018-0_15 · Cited by 4
Halab, K., Marzoug, N., Meslouhi, O. E., Elassad, Z. E. A., & Akhloufi, M. A. (2025) · Big Data and Cognitive Computing · doi:10.3390/bdcc10010012 · Cited by 3
Automated Periodic Distinguisher Search for AND-RX Ciphers
Lu, H., Liu, Q., Li, B., et al. (2026) · Lecture notes in computer science · doi:10.1007/978-981-95-6206-0_17 · Cited by 3
Parameterized Verification of Quantum Circuits
Abdulla, P. A., Chen, Y.-F., Hečko, M., Holík, L., Lengál, O., Lin, J.-A., & Thinniyam, R. S. (2026) · Proceedings of the ACM on Programming Languages · doi:10.1145/3776712 · Cited by 3
QUAV: Quantum-Assisted Path Planning and Optimization for UAV Navigation with Obstacle Avoidance
Innan, N., Kashif, M., Marchisio, A., et al. (2025) · doi:10.1109/qai63978.2025.00040 · Cited by 3
Quantum circuit for implementing AES S-box with low costs
Chen, H.-N., Cai, B., Gao, F., & Lin, S. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05083-7 · Cited by 5
Jebur, M. H., & Khaleel, S. M. (2025) · CyberSystem journal. · doi:10.57238/csj.2025.1012 · Cited by 3
A bucket-brigade quantum random access memory
Shen, F., Ji, Y., Xiang, D., Wang, Y., Wang, K., Zhang, C., Zhang, A., Zou, Y., Gao, Y., Cui, Z., et al. (2026) · Nature Physics · doi:10.1038/s41567-026-03218-2 · Cited by 7
Mechanical resonator–based quantum computing
Yang, Y., Kladarić, I., Skrabulis, M., Eichenberger, M., Marti, S., Storz, S., Esche, J., Garcia-Belles, R., Kern, M.-E., Omahen, A., et al. (2026) · Science · doi:10.1126/science.aef4139 · Cited by 4
Fault-tolerant quantum error correction code preparation in UBQC
Zhao, Q., Li, Q., Mao, H., Wen, X., Qi, H., & Ming-hui, L. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02735-0 · Cited by 4
Localization of two dimensional quantum walks defined by generalized Grover coins
Mandal, A., Sarkar, R. S., & Adhikari, B. (2023) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/acb304 · Cited by 3
The Philosophy of Quantum Computing
Cuffaro, M. E. (2022) · Springer eBooks · doi:10.1007/978-3-030-95538-0_3 · Cited by 5
A multi-commodity network model for optimal quantum reversible circuit synthesis
Jung, J., & Choi, I.-C. (2021) · PLoS ONE · doi:10.1371/journal.pone.0253140 · Cited by 4
A Bridge-Based Compression Algorithm for Topological Quantum Circuits
Tseng, W.-H., Hsu, C.-H., Lin, W.-H., & Chang, Y.-W. (2022) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2022.3161597 · Cited by 3
Quantum Resilience Estimation Method Blockchain
Petrenko, A., & Petrenko, S. (2022) · Voprosy kiberbezopasnosti · doi:10.21681/2311-3456-2022-3-2-22 · Cited by 3
Mode-Manipulated Multimode Cavity for Quantum Memory
Jang, T. H., Lee, J., Shin, J., Kang, J., Han, S., Jeon, I., Chakram, S., Schuster, D., & Kwon, H. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2022.3207901 · Cited by 3
Quantum median filter for total variation image denoising
Santis, S. D., Lazzaro, D., Mengoni, R., & Morigi, S. (2022) · ANNALI DELL UNIVERSITA DI FERRARA · doi:10.1007/s11565-022-00445-2 · Cited by 3
Identifying quantum correlations using explicit SO(3) to SU(2) maps
Dilley, D., Gonzales, A., & Byrd, M. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03679-3 · Cited by 3
A Quantum Algorithm to Locate Unknown Hashgrams
Allgood, N. R., & Nicholas, C. (2022) · Lecture notes in networks and systems · doi:10.1007/978-3-031-18344-7_18 · Cited by 3
Design and Analysis of a Scalable and Efficient Quantum Circuit for LWE Matrix Arithmetic
Lu, C., Banerjee, U., & Basu, K. (2022) · IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD) · doi:10.1109/iccd56317.2022.00026 · Cited by 3
Computational Time Complexity for k-Sum Problem Amalgamated with Quantum Search
Dutta, A., Harshith, J., Lakshmanan, K., et al. (2023) · doi:10.1109/icaia57370.2023.10169278 · Cited by 3
A Superconducting Quantum Chip Architecture Design Method for Quantum Programs
Chen, L., Li, Z., Zhang, M., et al. (2023) · International Symposium on Computer Technology and Information Science (ISCTIS) · doi:10.1109/isctis58954.2023.10213168 · Cited by 3
Implementing CRYSTALS Kyber and Dilithium in Intel SGX Secure Enclaves
Pratiwi, N., Firmansyah, M., & Ezerman, M. F. (2023) · IEEE International Conference on Cryptography, Informatics, and Cybersecurity (ICoCICs) · doi:10.1109/icocics58778.2023.10277539 · Cited by 3
Practical Applications of Quantum Computing
El‐Araby, E., Chaudhary, M., Islam, I., Levy, D., Kneidel, D., Jeng, M., Nobel, A., & Jha, V. (2023) · IntechOpen eBooks · doi:10.5772/intechopen.1003033 · Cited by 3
Variational Quantum Computation Integer Factorization Algorithm
Zhang, X., & Zhang, F. (2023) · International Journal of Theoretical Physics · doi:10.1007/s10773-023-05473-y · Cited by 3
Song, Y., Sha, E. H. ‐., Zhuge, Q., et al. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04160-5 · Cited by 3
Efficient Parameterised Compilation for Hybrid Quantum Programming
Krol, A. M., Mesman, K. J., Sarkar, A., & Al-Ars, Z. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.10192 · Cited by 3
QNet: A Quantum-Native Sequence Encoder Architecture
Day, W., Chen, H., & Sun, M.-T. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00035 · Cited by 3
Research on Qubit Mapping Technique Based on Batch SWAP Optimization
Li, H., Lü, K., Han, Z., Qin, H., Ju, M., & Liu, S. (2023) · International Journal of Advanced Computer Science and Applications · doi:10.14569/ijacsa.2023.0141217 · Cited by 5
Post-Quantum Security Overview of the Public Key Infrastructure
Bene, F., & Kiss, A. (2023) · SYSTEM THEORY CONTROL AND COMPUTING JOURNAL · doi:10.52846/stccj.2023.3.2.55 · Cited by 5
Optimal Clifford Initial States for Ising Hamiltonians
Bhattacharyya, B., & Ravi, G. S. (2023) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc60800.2023.10386971 · Cited by 7
Intermediate qutrit-assisted Toffoli gate decomposition with quantum error correction
Majumdar, R., Saha, A., Chakrabarti, A., & Sur‐Kolay, S. (2024) · Quantum Information Processing · doi:10.1007/s11128-023-04251-3 · Cited by 3
Dynamic Transitive Closure-based Static Analysis through the Lens of Quantum Search
Ren, J., Sui, Y., Cheng, X. Y., Feng, Y., & Zhao, J. (2024) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3644389 · Cited by 3
An improved quantum payment protocol based on group signature without entanglement
Jiang, W., & Zhuang, J. (2024) · Modern Physics Letters A · doi:10.1142/s0217732323501997 · Cited by 3
A Theory of Bio-Quantum Genetics
Zhao, J. (2024) · Journal of Quantum Information Science · doi:10.4236/jqis.2024.141002 · Cited by 3
A novel quantum protocol for secure hamming distance computation
Peng, Z., Shi, R., Ding, R., et al. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04357-2 · Cited by 3
Quantum Circuits for Fixed Matching Substring Problems
Cantone, D. A., Faro, S., Pavone, A., & Viola, C. (2024) · Lecture notes in networks and systems · doi:10.1007/978-3-031-62269-4_43 · Cited by 3
A Timing Attack Resistant Lightweight Post-Quantum Crypto-Processor for SPHINCS+
Huang, T., Lu, J., Liu, D., et al. (2024) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas58744.2024.10558654 · Cited by 3
Automatic Quantum Multi-collision Distinguishers and Rebound Attacks with Triangulation Algorithm
Bao, Z., Guo, J., Li, S., & Pham, P. (2024) · Lecture notes in computer science · doi:10.1007/978-981-97-5028-3_2 · Cited by 3
Kuo, S., Hua, C.-Y., Hsu, E.-T., et al. (2024) · Proceedings of ... IEEE International Conference on Fuzzy Systems · doi:10.1109/fuzz-ieee60900.2024.10612170 · Cited by 3
Improved Algorithms for Finding Fixed-Degree Isogenies Between Supersingular Elliptic Curves
Benčina, B., Kutas, P., Merz, S.-P., Petit, C., Stopar, M., & Weitkämper, C. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-68388-6_8 · Cited by 3
Safety with Non-Deterministic Control Action Selection Using Quantum Devices
Nieman, K., & Durand, H. (2024) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2024.08.413 · Cited by 3
Superposition Attacks on Pseudorandom Schemes Based on Two or Less Permutations
Zhang, S., Guo, C. F., & Wang, Q. (2024) · IET Information Security · doi:10.1049/2024/9991841 · Cited by 4
QuaCiDe: A General Purpose Quantum Circuit Design and Simulation Interface
Kydros, A., Prousalis, K. P., & Konofaos, N. (2024) · doi:10.1145/3665870.3665874 · Cited by 3
A Survey of Side-Channel Attacks in Superconducting Quantum Computers
Choudhury, N., & Basu, K. (2024) · IEEE Computer Society Annual Symposium on VLSI · doi:10.1109/isvlsi61997.2024.00074 · Cited by 3
Statistical Testing of Quantum Programs via Fixed-Point Amplitude Amplification
Kang, C. G., Lee, J., & Oh, H. (2024) · Proceedings of the ACM on Programming Languages · doi:10.1145/3689716 · Cited by 3
Hybrid classical-quantum image processing via polar Walsh basis functions
Rohida, M., Shukla, A., & Vedula, P. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00205-9 · Cited by 3
Resilience of lattice-based Cryptosystems to Quantum Attacks
Köppl, T., Zander, R., & Tcholtchev, N. (2024) · IEEE Symposium on Computers and Communications (ISCC) · doi:10.1109/iscc61673.2024.10733570 · Cited by 3
Discrete-time quantum walks in qudit systems
Saha, A., Saha, D., & Chakrabarti, A. (2024) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-024-05751-6 · Cited by 3
Giorgetti, A., Andriolli, N., Ferrari, M., et al. (2024) · Journal of Optical Communications and Networking · doi:10.1364/jocn.534089 · Cited by 3
Designing quantum circuits for decoding binary linear codes
Yoo, H., Choi, W.-H., & Lee, Y. (2024) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8121/ad955d · Cited by 2
A Distributed and Parallel (k, n) QSS Scheme with Verification Capability
Andronikos, T. (2024) · Mathematics · doi:10.3390/math12233782 · Cited by 3
Quantum Algorithms for Fast Correlation Attacks on LFSR-Based Stream Ciphers
Hosoyamada, A. (2024) · Lecture notes in computer science · doi:10.1007/978-981-96-0944-4_13 · Cited by 3
Quantum Cryptanalysis of ZUC and Related Resource Estimation
Dutta, S., Ghatak, A., Chattopadhyay, A., & Maitra, S. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-80308-6_15 · Cited by 3
A Matrix Multiplication Approach to Quantum-Safe Cryptographic Systems
Lizama-Pérez, L. A. (2024) · Cryptography · doi:10.3390/cryptography8040056 · Cited by 3
A 40 nm Cryo-CMOS Homodyne-Demodulation Readout SoC for Superconducting Qubits
Minn, D., Kang, K., Lee, J., Bae, S., Kim, B., Lee, J., & Sim, J. (2024) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2024.3518472 · Cited by 3
Flexible Type-Based Resource Estimation in Quantum Circuit Description Languages
Colledan, A., & Lago, U. D. (2025) · Proceedings of the ACM on Programming Languages · doi:10.1145/3704883 · Cited by 3
Approximate Quantum Array Multiplier
Crimmins, A., & Alarcón, S. L. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00017 · Cited by 3
Entangled Meanings: Classification and Ambiguity Resolution in QNLP
Zhang, C., Kumari, A., & Ćavar, D. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.10260 · Cited by 4
Decision Diagram vs. State Vector: A Comparative Study on Quantum Computing Simulation Efficiency
Kimura, Y., Li, S., Sato, H., & Fujita, M. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00095 · Cited by 3
Deterministic quantum partial search for target states with proportion 1/16
Ye, S.-M., & Wang, Y.-L. (2025) · Physics Letters A · doi:10.1016/j.physleta.2025.130325 · Cited by 3
Quantum Algorithm for the Multiple String Matching Problem
Khadiev, K. R., & Serov, D. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-82697-9_5 · Cited by 3
Classical and quantum algorithms for many-body problems
Ayral, T. (2025) · Comptes Rendus Physique · doi:10.5802/crphys.229 · Cited by 4
Quantum algorithm for finding the optimal variable ordering for binary decision diagrams
Tani, S. (2025) · Theoretical Computer Science · doi:10.1016/j.tcs.2025.115230 · Cited by 2
Compiler Optimizations for QAOA
Zhu, Y., Zhou, Y., Cheng, J., Jin, Y., Li, B., Niu, S., & Liang, Z. (2024) · doi:10.1145/3676536.3697127 · Cited by 8
Two-server Password authenticated Key Exchange Protocol Based on MLWE
Yang, Y., Song, S., & Guo, S. (2025) · International Conference on Cryptography, Network Security and Communication Technology (CNSCT) · doi:10.1145/3723890.3723901 · Cited by 3
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
