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 1,301–1,400 of 8,792
On Non-binary Quantum BCH Codes
Ma, Z., Lü, X., Feng, K., et al. (2006) · Lecture notes in computer science · doi:10.1007/11750321_63 · Cited by 30
Localization of a multi-dimensional quantum walk with one defect
Fuda, T., Funakawa, D., & Suzuki, A. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1653-4 · Cited by 28
Optimizing a polynomial function on a quantum processor
Li, K., Wei, S., Gao, P., Zhang, F., Zhou, Z., Xin, T., Wang, X., Rebentrost, P., & Long, G. (2021) · npj Quantum Information · doi:10.1038/s41534-020-00351-5 · Cited by 30
A quantum computing primer for operator theorists
Kribs, D. W. (2004) · Linear Algebra and its Applications · doi:10.1016/j.laa.2004.11.010 · Cited by 35
Decoherence, Control, and Symmetry in Quantum ComputersPreprint
Bacon, D. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0305025 · Cited by 55
A nearly optimal discrete query quantum algorithm for evaluating NAND formulasPreprint
Ambainis, A. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0704.3628 · Cited by 30
A fast quantum mechanical algorithm for estimating the medianPreprint
Grover, L. K. (1996) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9607024 · Cited by 30
Self-citationQuantum Error Correcting Subsystem Codes From Two Classical Linear CodesPreprint
Bacon, D., & Casaccino, A. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0610088 · Cited by 55
Algebraic and Logical Methods in Quantum ComputationPreprint
Ross, N. J. (2015) · arXiv (Cornell University) · doi:10.4230/lipics.fscd.2018.3 · Cited by 40
Small quantum computers and large classical data setsPreprint
Harrow, A. W. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2004.00026 · Cited by 52
Exploration of Power Side-Channel Vulnerabilities in Quantum Computer Controllers
Xu, C., Erata, F., & Szefer, J. M. (2023) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3576915.3623118 · Cited by 29
Improved Quantum Circuits for AES: Reducing the Depth and the Number of Qubits
Liu, Q., Preneel, B., Zhao, Z., & Wang, M.-Q. (2023) · IACR Cryptology ePrint Archive · doi:10.1007/978-981-99-8727-6_3 · Cited by 30
Revisiting the Mapping of Quantum Circuits: Entering the Multi-core Era
Escofet, P., Ovide, A., Bandić, M., Prielinger, L., van Someren, H., Feld, S., Alarcón, E., Abadal, S., & Almudéver, C. G. (2024) · ACM Transactions on Quantum Computing · doi:10.1145/3655029 · Cited by 43
A Comprehensive Survey on Post-Quantum TLS
Alnahawi, N., Müller, J., Oupický, J., & Wiesmaier, A. (2024) · IACR Communications in Cryptology · doi:10.62056/ahee0iuc · Cited by 38
Shuttling for Scalable Trapped-Ion Quantum Computers
Schoenberger, D., Hillmich, S., Brandl, M., & Wille, R. (2024) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2024.3513262 · Cited by 39
Bera, B., Das, A. K., & Sikdar, B. (2025) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2025.3553044 · Cited by 33
The potential of multidimensional photonic computing
Bente, I., Taheriniya, S., Lenzini, F., Brückerhoff‐Plückelmann, F., Kues, M., Bhaskaran, H., Wright, C. D., & Pernice, W. H. P. (2025) · Nature Reviews Physics · doi:10.1038/s42254-025-00843-3 · Cited by 36
Salas, M., Singh, A., Pignataro, C., & Pal, L. (2026) · Communications Materials · doi:10.1038/s43246-026-01105-0 · Cited by 34
Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games
Ambainis, A., & Kokainis, M. (2017) · ACM SIGACT Symposium on Theory of Computing (STOC) · doi:10.1145/3055399.3055444 · Cited by 29
Exact gate decompositions for photonic quantum computing
Kalajdzievski, T. Z., & Arrazola, J. M. (2019) · Physical Review A · doi:10.1103/physreva.99.022341 · Cited by 34
Formal constraint-based compilation for noisy intermediate-scale quantum systems
Murali, P., Javadi-Abhari, A., Chong, F. T., & Martonosi, M. (2019) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2019.02.005 · Cited by 29
Artificial Life in Quantum Technologies
Alvarez-Rodriguez, U., Sanz, M., Lamata, L., & Solano, E. (2016) · Scientific Reports · doi:10.1038/srep20956 · Cited by 29
Ablayev, F. M., Bulychkov, D. A., Sapaev, D. A., Vasiliev, A., & Ziatdinov, M. (2018) · Lobachevskii Journal of Mathematics · doi:10.1134/s1995080218070028 · Cited by 29
The Role of Multiplicative Complexity in Compiling Low $T$-count Oracle Circuits
Meuli, G., Soeken, M., Campbell, E. T., Roetteler, M., & Micheli, G. D. (2019) · 2019 IEEE/ACM International Conference on Computer-Aided Design (ICCAD) · doi:10.1109/iccad45719.2019.8942093 · Cited by 31
Securing Communications in the Quantum Computing Age: Managing the Risks to Encryption
Vermeer, M., & Peet, E. (2020) · RAND Corporation eBooks · doi:10.7249/rr3102 · Cited by 30
Just Like the Real Thing: Fast Weak Simulation of Quantum Computation
Hillmich, S., Markov, I. L., & Wille, R. (2020) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac18072.2020.9218555 · Cited by 30
Number Partitioning With Grover’s Algorithm in Central Spin Systems
Anikeeva, G., Marković, O., Borish, V., Hines, J., Rajagopal, S., Cooper, E. S., Periwal, A., Safavi‐Naeini, A. H., Davis, E. J., & Schleier-Smith, M. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.020319 · Cited by 30
Patterns for Hybrid Quantum Algorithms
Weigold, M., Barzen, J., Leymann, F., & Vietz, D. (2021) · Communications in computer and information science · doi:10.1007/978-3-030-87568-8_2 · Cited by 30
Approximate Equivalence Checking of Noisy Quantum Circuits
Hong, X., Ying, M., Feng, Y., Zhou, X., & Li, S. (2021) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac18074.2021.9586214 · Cited by 34
A Novel Post-Quantum Blind Signature for Log System in Blockchain
Xu, G., Cao, Y., Xu, S., et al. (2021) · Computer Systems Science and Engineering · doi:10.32604/csse.2022.022100 · Cited by 29
Piloting a full-year, optics-based high school course on quantum computing
Walsh, J. A., Fenech, M., Tucker, D. L., Riegle‐Crumb, C., & Cour, B. R. L. (2021) · Physics Education · doi:10.1088/1361-6552/ac3dc2 · Cited by 29
A Post-Quantum Secure Subscription Concealed Identifier for 6G
Ulitzsch, V. Q., Park, S., Marzougui, S., & Seifert, J. (2022) · ACM Conference on Security and Privacy in Wireless and Mobile Networks (WiSec) · doi:10.1145/3507657.3528540 · Cited by 31
Reordering and Partitioning of Distributed Quantum Circuits
Dadkhah, D., Moghadam, M. Z., Hosseini, S. E., Pławiak, P., & Zhou, X. (2022) · IEEE Access · doi:10.1109/access.2022.3186485 · Cited by 29
Own the Unknown: An Anticipatory Approach to Prepare Society for the Quantum Age
de Jong, E. J. (2022) · Digital Society · doi:10.1007/s44206-022-00020-4 · Cited by 32
Quantum Image Encryption Using a Self-Adaptive Hash Function-Controlled Chaotic Map (SAHF-CCM)
Abdelfatah, R. I. (2022) · IEEE Access · doi:10.1109/access.2022.3212899 · Cited by 30
Quantum-Inspired Spectral-Spatial Pyramid Network for Hyperspectral Image Classification
Zhang, J., Zhang, Y., & Zhou, Y. (2023) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr52729.2023.00957 · Cited by 32
Cutting multi-control quantum gates with ZX calculus
Ufrecht, C., Periyasamy, M., Rietsch, S., Scherer, D. D., Plinge, A., & Mutschler, C. (2023) · Quantum · doi:10.22331/q-2023-10-23-1147 · Cited by 30
Jozsa, R. (1999) · Lecture notes in computer science · doi:10.1007/3-540-49208-9_7 · Cited by 30
Lower bounds for predecessor searching in the cell probe model
Sen, P. (2004) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.2003.1214411 · Cited by 29
Decoherence in Discrete Quantum Walks
Kendon, V. M., & Tregenna, B. (2003) · Lecture notes in physics · doi:10.1007/978-3-540-40968-7_18 · Cited by 31
SyReC: A hardware description language for the specification and synthesis of reversible circuits
Wille, R., Schönborn, E., Soeken, M., et al. (2015) · Integration · doi:10.1016/j.vlsi.2015.10.001 · Cited by 29
Efficient classical simulation of the Deutsch–Jozsa and Simon’s algorithms
Johansson, N., & Larsson, J.-Å. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1679-7 · Cited by 29
Low-Communication Parallel Quantum Multi-Target Preimage Search
Banegas, G., & Bernstein, D. J. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-72565-9_16 · Cited by 35
A System F accounting for scalars
Arrighi, P. J., & Díaz-Caro, A. (2009) · Cited by 29
Enhanced quantum searching via entanglement and partial diffusion
Younes, A., Rowe, J. E., & Miller, J. F. (2008) · Physica D Nonlinear Phenomena · doi:10.1016/j.physd.2007.12.005 · Cited by 29
Synthesis of quaternary reversible/quantum comparators
Khan, M. H. A. (2008) · Journal of Systems Architecture · doi:10.1016/j.sysarc.2008.04.006 · Cited by 29
Quantum Search Algorithm with more Reliable Behaviour using Partial Diffusion
Younes, A. (2004) · AIP conference proceedings · doi:10.1063/1.1834408 · Cited by 29
All Quantum Adversary Methods Are Equivalent
Špalek, R., & Szegedy, M. (2005) · Lecture notes in computer science · doi:10.1007/11523468_105 · Cited by 57
Cleve, R., EKERT, A. K., Henderson, L., Macchiavello, C., & Mosca, M. (1998) · Complexity · doi:10.1002/(sici)1099-0526(199809/10)4:1 · Cited by 28
Combinatorial Optimization on Gate Model Quantum Computers: A Survey
Zahedinejad, E., & Zaribafiyan, A. (2017) · arXiv · doi:10.48550/arxiv.1708.05294 · Cited by 29
Quantum Lower Bounds for Collision and Element Distinctness with Small RangePreprint
Ambainis, A. (2003) · arXiv (Cornell University) · Cited by 29
A Scalable Decoder Micro-architecture for Fault-Tolerant Quantum ComputingPreprint
Das, P., Pattison, C. A., Manne, S., Carmean, D. M., Svore, K. M., Qureshi, M. K., & Delfosse, N. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2001.06598 · Cited by 50
Integrated photonic quantum walks
Gräfe, M., & Szameit, A. (2020) · Journal of Physics B: Atomic, Molecular and Optical Physics · doi:10.1088/1361-6455/ab6cfc · Cited by 28
“Since then, QWs have found applications as the fundamental concept behind Groverʼs search algorithm [9] or universal quantum computing [10, 11].”
BackgroundJoint Quantum-Assisted Channel Estimation and Data Detection
Botsinis, P., Alanis, D., Babar, Z., Ng, S. X., & Hanzo, L. (2016) · IEEE Access · doi:10.1109/access.2016.2591903 · Cited by 29
AutoQ: An Automata-Based Quantum Circuit Verifier
Chen, Y., Chung, K.-M., Lengál, O., Lin, J.-A., & Tsai, W.-L. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-37709-9_7 · Cited by 28
Decoy-state quantum private query protocol with two-way communication
Qin, L., Liu, B., Gao, F., et al. (2023) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2023.129427 · Cited by 28
Towards quantum computational mechanics
Liu, B., Ortíz, M., & Cirak, F. (2024) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2024.117403 · Cited by 34
QTRL: Toward Practical Quantum Reinforcement Learning via Quantum-Train
Liu, C.-Y., Lin, C.-H. A., Yang, C.-H. H., Chen, K.-C., & Hsieh, M.-H. (2024) · 2024 IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.10299 · Cited by 28
Evolutionary Algorithms and Quantum Computing: Recent Advances, Opportunities, and Challenges
Rehman, J. U., Ulum, M. S., Shaffar, A. W., Hakim, A. A., Mujirin, Abdullah, Z., Al-Hraishawi, H., Chatzinotas, S., & Shin, H. (2025) · IEEE Access · doi:10.1109/access.2025.3530952 · Cited by 35
Pineda, V. G., Valencia-Arías, A., Giraldo, F. E. L., & Ochoa, E. A. Z. (2025) · International Journal of Cognitive Computing in Engineering · doi:10.1016/j.ijcce.2025.08.002 · Cited by 42
Dynamic Grover search: applications in recommendation systems and optimization problems
Chakrabarty, I., Khan, S., & Singh, V. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1600-4 · Cited by 28
How to Construct Quantum Random Functions
Zhandry, M. (2021) · Journal of the ACM · doi:10.1145/3450745 · Cited by 30
Quantum circuit physical design flow for 2D nearest‐neighbor architectures
Farghadan, A., & Mohammadzadeh, N. (2017) · International Journal of Circuit Theory and Applications · doi:10.1002/cta.2335 · Cited by 28
A Quantum-Inspired Similarity Measure for the Analysis of Complete Weighted Graphs
Bai, L., Rossi, L., Cui, L., Cheng, J., & Hancock, E. R. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2913038 · Cited by 30
A Review of Post-quantum Cryptography and Crypto-agility Strategies
Grote, O., Ahrens, A., & Benavente-Peces, C. (2019) · International Interdisciplinary PhD Workshop (IIPhDW) · doi:10.1109/iiphdw.2019.8755433 · Cited by 28
Design of Threshold Segmentation Method for Quantum Image
Li, P., Shi, T., Zhao, Y., & Lu, A. (2019) · International Journal of Theoretical Physics · doi:10.1007/s10773-019-04346-7 · Cited by 28
Ding, Y., & Chong, F. T. (2020) · Synthesis lectures on computer architecture · doi:10.2200/s01014ed1v01y202005cac051 · Cited by 63
Adiabatic Quantum Graph Matching with Permutation Matrix Constraints
Benkner, M. S., Golyanik, V., Theobalt, C., & Moeller, M. (2020) · International Conference on 3D Vision (3DV) · doi:10.1109/3dv50981.2020.00068 · Cited by 28
Quantum k-means algorithm based on trusted server in quantum cloud computing
Gong, C., Dong, Z., Gani, A., & Qi, H. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03071-7 · Cited by 32
Quantum computers: Definition and implementations
Pérez-Delgado, C. A., & Kok, P. (2011) · Physical Review A · doi:10.1103/physreva.83.012303 · Cited by 32
Quantum Sealed-Bid Auction Without a Trusted Third Party
Shi, R. (2021) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2021.3103857 · Cited by 28
Groppe, S., & Groppe, J. (2021) · International Database Engineering and Applications Symposium (IDEAS) · doi:10.1145/3472163.3472164 · Cited by 30
A Survey on Quantum Computational Finance for Derivatives Pricing and VaR
Gómez, A., Leitao, Á., Manzano, A., Musso, D., Nogueiras, M. R., Ordóñez, G., & Vázquez, C. (2022) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-022-09732-9 · Cited by 34
Saha, A., Majumdar, R., Saha, D., Chakrabarti, A., & Sur‐Kolay, S. (2022) · Physical Review A · doi:10.1103/physreva.105.062453 · Cited by 28
Çalıkyılmaz, U., Groppe, S., Groppe, J., Winker, T., Prestel, S., Shagieva, F., Arya, D., Preis, F., & Gruenwald, L. (2023) · Proceedings of the VLDB Endowment · doi:10.14778/3598581.3598603 · Cited by 29
Quantum Natural Language Processing
Widdows, D., Aboumrad, W., Kim, D., Ray, S., & Mei, J. (2024) · Künstliche Intell. · doi:10.1007/s13218-024-00861-w · Cited by 38
Testing Multi-Subroutine Quantum Programs: From Unit Testing to Integration Testing
Long, P., & Zhao, J. (2024) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3656339 · Cited by 30
Quantum walks and quantum search on graphene lattices
Foulger, I., Gnutzmann∥, S., & Tanner, G. (2015) · Physical Review A · doi:10.1103/physreva.91.062323 · Cited by 31
Computation in finitary stochastic and quantum processes
Wiesner, K., & Crutchfield, J. P. (2008) · Physica D Nonlinear Phenomena · doi:10.1016/j.physd.2008.01.021 · Cited by 36
Separations in Query Complexity Based on Pointer Functions
Ambainis, A., Balodis, K., Belovs, A., Lee, T., Sántha, M., & Smotrovs, J. (2017) · Journal of the ACM · doi:10.1145/3106234 · Cited by 56
Quantum Enhanced Inference in Markov Logic Networks
Wittek, P., & Gogolin, C. (2017) · Scientific Reports · doi:10.1038/srep45672 · Cited by 27
Equivalence of Szegedy’s and coined quantum walks
Wong, T. G. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1667-y · Cited by 30
G-Merkle: A Hash-Based Group Signature Scheme from Standard Assumptions
Bansarkhani, R. E., & Misoczki, R. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-79063-3_21 · Cited by 28
Xia, B.-Y., Cao, C., Han, Y., & Zhang, R. (2018) · Laser Physics · doi:10.1088/1555-6611/aac904 · Cited by 28
Game semantics for quantum programming
Clairambault, P., de Visme, M., & Winskel, G. (2019) · Proceedings of the ACM on Programming Languages · doi:10.1145/3290345 · Cited by 28
Degree vs. approximate degree and Quantum implications of Huang’s sensitivity theorem
Aaronson, S., Ben-David, S., Kothari, R., Rao, S., & Tal, A. (2021) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3406325.3451047 · Cited by 65
Nested Quantum Walks with Quantum Data Structures
Jeffery, S., Kothari, R., & Magniez, F. (2013) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611973105.106 · Cited by 43
A Faster Lattice Reduction Method Using Quantum Search
Ludwig, C. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-24587-2_22 · Cited by 27
Classical and Quantum Algorithms for Exponential Congruences
van Dam, W., & Shparlinski, I. E. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-89304-2_1 · Cited by 28
Can quantum mechanics help distributed computing?
Broadbent, A., & Tapp, A. (2008) · ACM SIGACT News · doi:10.1145/1412700.1412717 · Cited by 29
Image Representation and Processing Using Ternary Quantum Computing
Caraiman, S., & Manta, V. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-37213-1_38 · Cited by 28
On the Power of Ambainis’s Lower Bounds
Zhang, S. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27836-8_102 · Cited by 49
Quantum time-space tradeoffs for sorting
Klauck, H. (2003) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/780542.780553 · Cited by 27
Quantum evolutionary programming
Rylander, B., Soule, T., Foster, J. A., et al. (2001) · Cited by 28
Quantum Search on Structured Problems
Grover, L. K. (1999) · Chaos Solitons & Fractals · doi:10.1016/s0960-0779(98)00217-3 · Cited by 28
Self-citationUsing Grover’s quantum algorithm for searching actual databases
Zalka, C. (2000) · Physical Review A · doi:10.1103/physreva.62.052305 · Cited by 28
Reversible circuit compilation with space constraintsPreprint
Parent, A., Roetteler, M., & Svore, K. M. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1510.00377 · Cited by 39
Patel, T., Potharaju, A., Li, B., Roy, R. B., & Tiwari, D. (2020) · SC20: International Conference for High Performance Computing, Networking, Storage and Analysis · doi:10.1109/sc41405.2020.00050 · Cited by 37
Equivalence Checking of Parameterized Quantum Circuits
Peham, T., Burgholzer, L., & Wille, R. (2023) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1145/3566097.3567932 · Cited by 33
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
