A Fast Quantum Mechanical Algorithm for Database Search
Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96, 1996 · paper · Computer science
Presents a quantum algorithm for finding one item in an unsorted database of N items in about the square root of N steps, versus roughly N/2 for classical algorithms. It is within a small constant factor of the fastest possible quantum approach.
Checked: PDF from arxiv.org, fetched 4 Oct 2026. Page numbers are those of that PDF.
7 findings
Substance Corollary 2.1 states that "after applying the diffusion transform both k1 and l1 are positive numbers" under only k<0<l and |k/l|<√N, but its proof needs N>2 and "N ≥ 9", and the statement is false for small N.
- p. 6 Corollary 2.1 statement and proof
then for N ≥ 9 the condition
- p. 6 Statement of Corollary 2.1 (left column)
Then after applying the diffusion transform both k1 and l1 are positive numbers.
Only the authors can say what is right here.
Judge's note: Page 6. Theorem 2 gives l1 = (2/N)k + ((N−2)/N)l. Counterexample, which I checked: N = 4 (= 2², allowed by Section 2), k = −1.5, l = 1, so |k/l| = 1.5 < 2 = √N and the hypotheses hold. Then l1 = 0.5·(−1.5) + 0.5·1 = −0.25 < 0, which contradicts the stated conclusion. The proof itself adds the restriction "for N ≥ 9", which the statement leaves out. Theorem 3 uses the corollary only for "non-trivial N", so adding N ≥ 9 to the hypotheses repairs it.
Second check: another model agreed
Report a problem with this finding
Reference or label Section 4 says D is "equivalent to the diffusion transform D as used in step (ii)(a) of the algorithm", but in Section 3 D is applied in step (ii)(b); step (ii)(a) is the phase rotation.
- p. 4 Section 4, first paragraph
sion transform D as used in step (ii)(a) of the algorithm..
- p. 3 Section 3, step (ii)(b)
(b) Apply the diffusion transform D which
- p. 4 Section 4, paragraph before Figure 1
equivalent to the diffu-sion transform D as used in step (ii)(a) of the algorithm
- p. 4 Section 4, first paragraph
diffusion transform D as used in step (ii)(a) of the algorithm
Judge's note: Page 3, Section 3: (ii)(a) is "In case C(S)=1, rotate the phase by π radians" and (ii)(b) is "Apply the diffusion transform D". Page 3 also says "step (ii) (a) is a phase rotation transformation". So the pointer on page 4 names the wrong sub-step. The doubled full stop is handled separately in C003.
Second check: another model agreed
Report a problem with this finding
Reference or label "R as defined in theorem 2 is a phase rotation matrix": R is defined in Theorem 1 (and in Section 3), not in Theorem 2.
- p. 5 Section 5, paragraph before Theorem 1
R as defined in theorem 2 is a phase rotation matrix
- p. 5 Section 5, paragraph before Theorem 1
as defined in theorem 2 is a phase rotation matrix
Judge's note: Page 5: the statement of Theorem 1 defines R_ij = 0 for i≠j, R_ii = 1 for i = 0 and R_ii = -1 for i≠0. Theorem 2 (page 6) concerns the amplitudes after D is applied and does not mention R.
Second check: another model agreed
Report a problem with this finding
Reference or label [DH96] (Durr & Hoyer, minimum finding) and [BCDP96] (Beckman et al., factoring networks) both give the e-print number "quant-ph/9602016".
- p. 8 References, [DH96]
lanl preprint, quant-ph/9602016.
- p. 8 References, [BCDP96]
quant-ph/9602016).
- p. 8 References, [BCDP96]
quant-ph/9602016
- p. 8 References, [DH96]
lanl preprint, quant-ph/9602016
Only the authors can say what is right here.
Judge's note: Rests on outside knowledge: which of the two entries is wrong (reviewers say Durr–Hoyer is quant-ph/9607014). The page 8 image confirms that both entries print the same identifier for two different papers, so at least one is wrong within the reference list itself.
Second check: another model agreed
Report a problem with this finding
Reference or label [DJ92] gives "Proceedings Royal Society of London, A400, 1992, pp. 73-90" while [Deutsch85] gives the same journal volume 400 for 1985.
- p. 8 References, [DJ92]
Proceedings Royal Society of London, A400, 1992, pp. 73-90.
- p. 8 References, [Deutsch85]
Society London Ser. A, 400, 1985,
- p. 8 Reference [DJ92]
A400, 1992, pp. 73-90.
Only the authors can say what is right here.
Judge's note: Rests on outside knowledge: the correct citation of Deutsch–Jozsa 1992 (reviewers give Proc. R. Soc. Lond. A 439, 553–558). Within the page 8 reference list, one volume number assigned to two years seven years apart is inconsistent, so the [DJ92] volume and pages are queried.
Second check: another model agreed
Report a problem with this finding
Wording The definition of inversion about average reads "amplitude in each state increases (decreases) so that after this operation it is as much below (above) α as it was above (below) α"; an amplitude that increases ends above α, so the below/above pairing is reversed.
- p. 4 Section 4, definition of inversion about average
amplitude in each state increases (decreases) so that after this operation it is as much below (above) α as it was above (below) α before the operation.
Judge's note: Page 4, left column. Under v -> 2α - v (the paper's own form, A + (A - v_i), right column), the amplitude increases exactly when v < α, and it then ends α - v above α. As printed, the main clause says an increasing amplitude ends below α after having been above it, which cannot happen. Figure 1 shows the correct behaviour. The fix is to read "as much above (below) α as it was below (above) α".
Second check: another model agreed
Report a problem with this finding
Wording Proof of Corollary 2.2: in the line "(N−1)l1² = 4(N−1)²/N² k² + ..." the k² coefficient should be 4(N−1)/N², not 4(N−1)²/N².
- p. 6 Corollary 2.2, proof, second displayed equation
(N − 1)l1² = 4(N − 1)²/N² k²
- p. 6 Corollary 2.2, proof, 'Similarly' equation
(N − 1)l_1^2 = 4(N − 1)^2/N^2 k^2
- p. 6 Proof of Corollary 2.2, second displayed equation (right column)
(N−1)l1^2 = 4(N−1)^2/N^2 k^2
Only the authors can say what is right here.
Judge's note: Checked on the page 6 image: the k² term carries (N−1)². My own working: l1 = (2/N)k + ((N−2)/N)l, so (N−1)l1² has k² coefficient (N−1)·4/N², l² coefficient (N−1)(N−2)²/N², and kl coefficient 4(N−1)(N−2)/N². The printed l² and kl terms match this; the k² term has an extra factor (N−1). With the corrected coefficient, the k² coefficients add to [(N−2)² + 4(N−1)]/N² = 1 and the kl terms cancel, so the corollary holds. With the printed coefficient the sum is not 1 (for N = 4 it is 40/16). This is a faulty intermediate step; the stated corollary stands.
Second check: another model agreed · checked by hand
Report a problem with this finding
3 minor (typos and the like; most checked by the judge only)
Reference or label [MVV87] gives "Combinatorica, 7, 1987, pp. 105-131"; the page range appears to be wrong.
- p. 8 References, [MVV87]
Combinatorica, 7, 1987, pp. 105-131.
Only the authors can say what is right here.
Judge's note: Rests on outside knowledge: the true page range of Mulmuley–Vazirani–Vazirani, Combinatorica 7 (1987), which reviewers give as 105–113. The page 8 image confirms the printed range 105-131. This cannot be checked against anything in the files.
Second check: another model agreed
Report a problem with this finding
Typo Doubled full stop: "as used in step (ii)(a) of the algorithm.."
- p. 4 Section 4, first paragraph
of the algorithm..
Judge's note: The page 4 image shows two periods at the end of the sentence, so this is not an extraction artefact.
Second check: none (judge only)
Report a problem with this finding
Typo Typo in Section 7 (iii): "than retrieved form memory" should read "retrieved from memory".
- p. 7 Section 7, item (iii)
than retrieved form memory
- p. 7 Section 7 (iii)
retrieved form memory
- p. 7
than retrieved form memory.
Judge's note: The crop of page 7 shows "form", so this is not an extraction artefact.
Second check: none (judge only)