Quantum Algorithm for Linear Systems of Equations
Physical Review Letters, 2009 · paper · Computer science
Presents a quantum algorithm that estimates properties of the solution to a sparse linear system Ax=b, running in time polynomial in log N and the condition number. The authors state this is an exponential improvement over the best classical algorithm.
Checked: PDF from arxiv.org, fetched 4 Oct 2026. Page numbers are those of that PDF.
15 findings
Substance Discussion display "Σ_{j,λj<1/κ} λ_j^{-1} β_j |u_j⟩|well⟩ + Σ_{j,λj≥1/κ} β_j |u_j⟩|ill⟩" has the eigenvalue conditions swapped: the inverted |well⟩ part should be λ_j ≥ 1/κ and the |ill⟩ part λ_j < 1/κ.
- p. 4 Section IV, displayed state after 'we transform it to a state which is close to'
j,λj<1/κ
- p. 5 Appendix A, third paragraph
eigenvalues ≥ 1/κ and the ill-conditioned part to be the rest
- p. 5 Appendix A, third paragraph
to eigenvalues ≥ 1/κ and the ill-conditioned part to be the rest
- p. 4 Discussion, displayed state for ill-conditioned matrices
j,λj<1/κ λ_j^{-1} β_j |u_j⟩|well⟩ + Σ_{j,λj≥1/κ} β_j |u_j⟩|ill⟩
Judge's note: Page 4 image shows the conditions as quoted. Appendix A (p5) defines the well-conditioned part as "eigenvalues ≥ 1/κ and the ill-conditioned part to be the rest", and filter functions (A3a)/(A3b) on p6 give f = 1/(2κλ) for λ ≥ 1/κ (well) and g = 1/2 for small λ (ill). The sentence before the display says only the well-conditioned part is inverted. No alternative convention is stated anywhere.
Second check: another model agreed
Report a problem with this finding
Substance Eq. (4) prints the third-block term as |t+2T+1 mod 3T⟩⟨t+2T| ⊗ U†_{3T+1−t} with t = 1..T, so the subscript runs over 2T+1..3T, but only gates U_1..U_T are defined. For U^{3T} = I the subscript should be T+1−t.
- p. 4 Eq. (4)
U†3T+1−t
- p. 4 Sec. III, Eq. (4)
|t+2T+1 mod 3T⟩⟨t+2T| ⊗ U†_{3T+1−t}
- p. 4 Eq. (4)
|t+2T+1 mod 3T⟩⟨t+2T| ⊗ U†3T+1−t
Only the authors can say what is right here.
Judge's note: Page 4 image checked: the sum is Σ_{t=1}^{T} and the subscript is 3T+1−t. The circuit is defined as U_1,…,U_T. With t=1 the printed index is 3T and with t=T it is 2T+1, so no defined gate is named. To uncompute U_T⋯U_1 (the text uses U^{3T}=I just below), the t-th factor must be U†_{T+1−t}, which gives the cycle product (U_1†⋯U_T†)(U_T⋯U_1)=I. The same t is the relative index in the ket/bra of this term, so reading it as an absolute clock value does not work. The formula is wrong as printed, but the construction holds once the index is corrected.
Second check: another model agreed
Report a problem with this finding
Substance Preconditioned system printed as "(AB)c⃗ = Bb⃗", which is not equivalent to Ax⃗ = b⃗; it mixes left preconditioning ((BA)x = Bb) with right preconditioning ((AB)c = b, x = Bc).
- p. 4 Section IV, preconditioner paragraph
(AB)⃗c = B⃗b
Only the authors can say what is right here.
Judge's note: Page 4 image shows "(AB)c⃗ = Bb⃗" and κ(AB). Reworked: (AB)c = Bb gives c = B^{-1}A^{-1}Bb and Bc = A^{-1}Bb, which equals A^{-1}b only if A and B commute. Scalar-free counterexample: A = diag(1,2), B = [[0,1],[1,0]], b = (1,0): x = A^{-1}b = (1,0), but A^{-1}Bb = (0,1/2). No commutation assumption or relation between c and x is given. The next sentence (preparing B|b⟩) fits the left-preconditioned form with BA.
Second check: another model agreed
Report a problem with this finding
Substance "the number of repetitions is a constant fraction of π/4p̃" omits the square root; the preceding sentence gives "π/4√p̃".
- p. 6 Section A1, amplitude amplification paragraph
is a constant fraction of π/4p̃
- p. 6 same paragraph, one sentence earlier
would ideally be π/4√p̃
- p. 6 Appendix A.1, amplitude amplification paragraph
is a constant fraction of π/4˜p
- p. 6 Appendix A.1, same paragraph
would ideally be π/4√˜p
Judge's note: Page 6 image shows π/4√p̃ with a radical in one sentence and π/4p̃ without one in the next. The paragraph states O(1/√p̃) repetitions and O(κ) overall with p̃ = Ω(1/κ²); π/4p̃ would be O(κ²). It is not an extraction artefact.
Second check: another model agreed
Report a problem with this finding
Substance Lemma 3 (p.9) states |f−f̃|²+|g−g̃|² ≤ c(κ²/t0²)δ²|f²+g²| "where c = π²/2". This is false for λ in (1/κ', 1/κ). With (A3), f²+g² = 1/4 and (f,g) moves at speed πκ/2, so for small δ the left side is about (π²/4)κ²δ²/t0² while the right side is (π²/8)κ²δ²/t0².
- p. 9 Statement of Lemma 3
where c = π2/2.
- p. 10 Proof of Lemma 3, case λ < 1/κ
max |f ′|2 = π2/4 δ2/t2 0 κ2
Only the authors can say what is right here.
Judge's note: Pages 9–10 images checked. I reworked the counterexample with κ=1, κ'=2, λ=0.75, λ̃=0.74, so κ²δ²/t0² = 1e-4. θ=π/4 gives f=g=0.353553. θ̃=0.24π gives f̃=0.5·sin(43.2°)=0.342276 and g̃=0.5·cos(43.2°)=0.364487. The left side is 2.467e-4 and the right side is (π²/2)·1e-4·0.25 = 1.234e-4, so the inequality fails. The proof bounds the left side by (π²/2)κ²δ²/t0² and then needs f²+g²; even with the paper's 1/2 that gives c=π², and with the true 1/4 it gives c=2π². The lemma as stated is false. A larger O(1) constant repairs it, so the O(κ/t0) conclusions of (A20)–(A22) keep their form.
Second check: another model agreed
Report a problem with this finding
Substance For the case λ ≥ 1/κ, the proof of Lemma 3 says "In this case g = 0, and we need to show that" only a bound on |f−f̃|. But g̃ = g(λ̃) ≠ 0 whenever λ̃ < 1/κ, and the |g−g̃|² = g̃² term is never bounded. The lemma with c=π²/2 fails in this regime.
- p. 9 Proof of Lemma 3, case λ ≥ 1/κ, (A18)
In this case g = 0, and we need to show that
Only the authors can say what is right here.
Judge's note: Pages 9–10 images checked. The sub-cases (λ̃≥1/κ; λ=1/κ with λ̃<1/κ; λ̃<1/κ<λ with either order of f, f̃) bound only |f−f̃|. Counterexample: κ=1, κ'=2, λ=1 (f=1/2, g=0), λ̃=0.49 < 1/κ' (f̃=0, g̃=1/2). The left side is 1/4+1/4 = 0.5. The right side is (π²/2)(0.51)²(1/4) ≈ 0.321. This is a different gap from C022, which concerns the constant in the λ<1/κ case. A larger O(1) constant repairs the bound, so Theorem 1's O(κ/t0) form survives, but the stated lemma does not follow as written.
Second check: another model agreed
Report a problem with this finding
Reference or label Proof of Theorem 1 claim 3 reads "To prove (A5 assuming (A4)" and "By (A4), the first post-selection leaves us with error O(κ/t0)"; the equation pointers should be (A6) assuming (A5), and "By (A5)"; the first parenthesis is also unclosed.
- p. 7 Paragraph after Theorem 1
To prove (A5 assuming (A4)
- p. 7 same paragraph
By (A4), the first post-selection leaves us with error O(κ/t0)
- p. 7 Appendix A.2, paragraph after Theorem 1
To prove (A5 assuming (A4), observe
- p. 7 Appendix A.2, same paragraph
By (A4), the first post-selection leaves us with error O(κ/t0).
Judge's note: Viewed page 7. The preceding sentence says the third claim is a corollary of the second, and the paragraph ends "as claimed in (A6)". (A4) is the no-post-selection bound, while the sentence concerns post-selection onto span{|well>,|ill>}, which is (A5). Both pointers are off by one and "(A5" lacks its closing parenthesis.
Second check: another model agreed
Report a problem with this finding
Wording In the proof of Lemma 2 (p.7), the |nothing⟩ component of d/dλ|h(λ)⟩ for λ>1/κ is printed as 1/(2κ²λ³√(1−1/2κ²λ²)). For f=1/(2κλ) from (A3a) it should be 1/(4κ²λ³√(1−1/4κ²λ²)). The |well⟩ component −1/(2κλ²) does use f=1/(2κλ), so the two components of the display use different f.
- p. 7 Proof of Lemma 2, first display
2κ2λ3√1 − 1/2κ2λ2
- p. 6 Eq. (A3a)
1 2κλ when λ ≥ 1/κ
- p. 7 Appendix A.2, proof of Lemma 2, displayed derivative
2κ2λ3p 1 −1/2κ2λ2
- p. 7 Proof of Lemma 2, derivative for λ>1/κ
1/(2κ²λ³√(1−1/2κ²λ²)) |nothing⟩ − 1/(2κλ²) |well⟩
Only the authors can say what is right here.
Judge's note: Pages 6–7 images checked. For λ≥1/κ, (A3) gives f=1/(2κλ) and g=0, so the |nothing⟩ amplitude is √(1−1/(4κ²λ²)). Reworking: the derivative of −1/(4κ²λ²) is 1/(2κ²λ³). Multiplying by 1/(2√(1−1/(4κ²λ²))) gives 1/(4κ²λ³√(1−1/(4κ²λ²))). The printed expression is the derivative for f=1/(√2κλ). The printed squared norm 1/(2κ²λ⁴(2κ²λ²−1)) carries the same error. The correct squared norm is 1/(4κ²λ⁴(4κ²λ²−1))+1/(4κ²λ⁴). At λ=1/κ this is κ²/12+κ²/4 = κ²/3, and it decreases in λ, so the bound ≤κ² and Lemma 2 still hold.
Second check: another model agreed
Report a problem with this finding
Wording The end of the proof of Lemma 3 (p.10) says "Finally f(λ)² + g(λ)² = 1/2 for any λ ≤1/κ", but with (A3) f²+g² = 1/4 throughout λ ≤ 1/κ. Even with the stated 1/2, the two bounds give c = π², not the stated π²/2.
- p. 10 End of proof of Lemma 3
Finally f(λ)2 + g(λ)2 = 1/2 for any λ ≤ 1/κ
- p. 6 Eqs. (A3a), (A3b)
1 2 sin
- p. 10 Appendix A.2, end of proof of Lemma 3
Finally f(λ)2 + g(λ)2 = 1/2 for any λ ≤1/κ, implying the result.
- p. 9 Lemma 3
where c = π2/2.
Only the authors can say what is right here.
Judge's note: Pages 6, 9 and 10 images checked. (A3a)/(A3b) use the prefactor 1/2: for 1/κ'≤λ<1/κ, f²+g² = (1/4)(sin²+cos²) = 1/4. For λ<1/κ', f=0 and g=1/2, giving 1/4. At λ=1/κ, f=1/2 and g=0, giving 1/4. The two displayed bounds sum to (π²/2)κ²δ²/t0², which divided by 1/2 gives π² and divided by 1/4 gives 2π². This false step is the one that produces the wrong constant reported in C022, where the counterexample to the lemma statement is given.
Second check: another model agreed
Report a problem with this finding
Wording After (A32), p.11 says "Thus |αk|j|² ≤ 64π²/δ² whenever |k − λjt0/2π| ≥ 1", but squaring (A32) |α| ≤ 8π/δ² gives 64π²/δ⁴. That is the form p.8 quotes as "proved in Section A 3" and uses in its convergent sum.
- p. 11 Sentence after (A32)
Thus |αk|j|2 ≤ 64π2/δ2 whenever
- p. 8 Proof of (A4)
|αk|j|2 ≤ 64π2/(λjt0 − 2πk)4 (proved in Section A 3)
- p. 11 Line after (A32)
Thus |αk|j|2 ≤ 64π2/δ2 whenever |k − λjt0/2π| ≥ 1.
- p. 8 Proof of (A4)
|αk|j|2 ≤ 64π2/(λjt0 − 2πk)4
Judge's note: Pages 8 and 11 images checked. Page 11 prints the exponent δ², and page 8 prints 64π²/(λjt0 − 2πk)⁴ and sums 64π²/δ⁴ · δ². Since δ ≥ 2π, the printed δ² bound is true but weaker, and it is not the δ⁴ bound that p.8 relies on, so the cross-reference is inconsistent. The evident fix is δ⁴.
Second check: another model agreed
Report a problem with this finding
Wording In (A19), the middle expression "= 1/2 − κ(λ̃ − 1/2)" should read 1/2 − κ(λ̃ − 1/(2κ)). As printed it does not equal the expression before it or the final κ(1/κ − λ̃).
- p. 9 Eq. (A19)
= 1/2 − κ(λ̃ − 1/2) = κ(1/κ − λ̃)
- p. 9 (A19)
= 1/2 − κ(˜λ − 1/2) = κ(1/κ − ˜λ)
- p. 9 (A19)
= 1 2 −κ( ˜λ −1 2) = κ( 1 κ −˜λ)
Only the authors can say what is right here.
Judge's note: Page 9 image checked: the bracket shows 1/2, not 1/(2κ). With κ'=2κ, 1/κ−1/κ' = 1/(2κ), so (1/2)(λ̃−1/κ')/(1/κ−1/κ') = κλ̃−1/2. The expression is then 1/2−κλ̃+1/2 = 1−κλ̃ = κ(1/κ−λ̃). The printed middle term equals 1/2+κ/2−κλ̃, which matches only when κ=1. Numeric check with κ=2, λ̃=0.4: printed middle 0.7, right side 0.2. The final expression is correct.
Second check: another model agreed
Report a problem with this finding
Wording Abbreviations on page 9 read "f̃ := f̃(λ), g := g(λ) and g̃ = g̃(λ)"; the tilde belongs on the argument, i.e. f̃ := f(λ̃), g̃ := g(λ̃).
- p. 9 Paragraph before (A12)
f̃ := f̃(λ), g := g(λ) and g̃ = g̃(λ)
- p. 9 Proof of Lemma 3
Remember that f̃ = f(λ − δ/t0)
Judge's note: Viewed page 9. The tilde is on the function, with plain λ as argument, so the definition is circular. (A10)–(A11) use f(λ̃_k), g(λ̃_k), and the Lemma 3 proof says "f̃ = f(λ − δ/t0)", which is f(λ̃). No separate function f̃ is defined anywhere.
Second check: another model agreed
Report a problem with this finding
Wording Going from (A28) to (A29), the prefactor becomes "−e^{iδ/2(1−1/T)} √2 cos(δ/2)/T", but (A28) gives +e^{iδ/2(1−1/T)} cos(δ/2)/(√2 T). The printed prefactor is −2 times this, and the factor 2 carries into (A30)–(A32).
- p. 11 Eqs. (A28)–(A29)
= −e i δ 2 (1− 1 T ) √2 cos( δ 2 ) T
- p. 11 (A29)–(A32)
−e^{iδ/2(1−1/T)} √2 cos(δ/2) / T
Only the authors can say what is right here.
Judge's note: Page 11 image checked. Reworking: 1+e^{iδ} = 2cos(δ/2)e^{iδ/2}, and 1/(i√2T)·1/(−2i) = 1/(2√2T), since i·(−2i)=2. The prefactor is therefore cos(δ/2)e^{iδ(1−1/T)/2}/(√2T). Sanity check at δ=0: (A28) gives 2√2/π ≈ 0.90, matching the direct sum (√2/T)Σsin(π(τ+½)/T). The printed (A29) gives ≈ 4√2/π ≈ 1.80, which exceeds 1 for an amplitude. The sign is a global phase. The factor 2 only loosens the upper bound, so |α| ≤ 8π/δ² in (A32) still holds.
Second check: another model agreed
Report a problem with this finding
Wording In the proof of Theorem 4 (p.13), the choice m = (2/δ)·log(2n)/log(log(n)) does not support "Ti ≤ T^{(1−δ/2)^i} ≤ 2^{(1−δ/2)^i 2n0}, implying that Tm ≤ n0". The conclusion needs (1−δ/2)^m·2n0 ≤ log n0, i.e. m of order (2/δ)log n0.
- p. 13 Proof of Theorem 4
let m = 2/δ log(2n)/log(log(n)) and ǫ = 1/100m
- p. 13 Proof of Theorem 4
≤ 2(1−δ/2)i2n0, implying that Tm ≤ n0.
Only the authors can say what is right here.
Judge's note: Page 13 image checked: m is printed as (2/δ)·log(2n)/log(log(n)). Reworking: (1−δ/2)^m ≥ exp(−(δ/2)m/(1−δ/2)) = (2n)^{−O(1/loglog n)}, so (1−δ/2)^m·2n0 = (2n0)^{1−o(1)}, which is far larger than log n0. Example with δ=1, n0=2^16 and base-2 logs: m=8.5 and 2^{−8.5}·2^{17} ≈ 362, against log2 n0 = 16. A repair with m = Θ((1/δ)log n) keeps 1/ε = O(log n), so the polynomial bound and Theorem 4 survive. As written, though, the 'implying' step does not follow, and the claim ε ≥ 1/log(n) would also need revisiting.
Second check: another model agreed
Report a problem with this finding
Wording Page 14 says "Since the variance of this bit is ≤ 1/4, taking 1/3ǫ² samples gives us a ≥ 2/3 probability of obtaining an estimate within ǫ/2 of µ". Chebyshev needs n ≥ 3/ǫ²; with 1/(3ǫ²) samples the bound is vacuous and the standard error (≈0.87ǫ) exceeds ǫ/2.
- p. 14 Paragraph before Theorem 6
taking 1/3ǫ2 samples gives us a ≥ 2/3 probability of obtaining an estimate within ǫ/2 of µ
- p. 14 matrix inversion estimation paragraph
taking 1/3ǫ2 samples gives us a
- p. 14 paragraph before Theorem 6
taking 1/3ǫ2 samples gives us a ≥2/3 probability
Only the authors can say what is right here.
Judge's note: Page 14 image checked: the text reads 1/3ǫ². Reworking: the variance of the mean is ≤ 1/(4n), so Pr(|mean−µ| ≥ ǫ/2) ≤ (1/(4n))/(ǫ²/4) = 1/(nǫ²). This is 3 at n = 1/(3ǫ²) and 1/3 at n = 3/ǫ². At µ=1/2 the standard deviation is √3ǫ/2, so ǫ/2 is about 0.58 SD, and the normal approximation gives a success probability of about 0.44 < 2/3. The stated count does not give the stated probability. The Õ(log(N)κ²s²/ǫ³) scaling is unaffected.
Second check: another model agreed
Report a problem with this finding
24 minor (typos and the like; most checked by the judge only)
Reference or label "Now we use Lemma 3 to bound the two error contributions in (A13)"; the two terms bounded in (A20) and (A21) are those of (A17), since the first, E[(f̃−f)²+(g̃−g)²]/2p, does not appear in (A13).
- p. 10 after proof of Lemma 3
bound the two error contributions in (A13)
Judge's note: Viewed pages 9 and 10. (A13) contains E[(f̃−f)f+(g̃−g)g]/p and (p̃−p)/p. The quadratic term bounded in (A20) first appears in (A16)/(A17), and the text later says "Substituting (A20), (A21) and (A22) into (A17)". The pointer is loose rather than plainly wrong, because (A17) is derived from (A13).
Second check: another model agreed
Report a problem with this finding
Wording Abstract says for sparse A with condition number κ "classical algorithms can find x⃗ and estimate x⃗†Mx⃗ in Õ(N√κ) time" with no positive-definite restriction, while Sec. III gives √κ only "when A is positive definite" and "O(Nsκ log(1/ǫ))" otherwise; the appendix also uses "O(Nκ poly(log(1/ǫ)))".
- p. 1 Abstract
⃗x†M⃗x
- p. 2 First paragraph
⟨x| M |x⟩ = ⃗xT M⃗x
- p. 1 Abstract
can find ⃗x and estimate ⃗x†M⃗x in ˜O(N√κ) time
- p. 3 Sec. III, Classical matrix inversion algorithms
(If A is not positive definite, O(κ log(1/ǫ)) multiplications are required, for a total time of O(Nsκ log(1/ǫ)).)
Only the authors can say what is right here.
Judge's note: Read p1 and p3 page images and the p14 text. The abstract's Õ(N√κ) is the positive-definite conjugate-gradient cost, stated without that qualifier; Sec. III and Appendix A.5 give κ for the general case. Õ does not hide a √κ factor. The transpose/dagger part of this cluster is the same defect as C002 and is judged there.
Second check: another model agreed
Report a problem with this finding
Wording Introduction writes the expectation value with a plain transpose, "⟨x| M |x⟩ = x⃗^T M x⃗" (and "some expectation value x⃗^T M x⃗"), whereas the abstract and Sec. III write "x⃗†Mx⃗".
- p. 2 Introduction, first paragraph of page 2
⟨x| M |x⟩= ⃗xT M⃗x
- p. 1 Abstract
⃗x†M⃗x
Judge's note: Page 2 image shows x^T M x twice; the p1 abstract and p3 Sec. III show x†Mx. For complex amplitudes ⟨x|M|x⟩ = x†Mx, so the transpose is a notational slip. The two forms coincide only for real x.
Second check: another model agreed
Report a problem with this finding
Wording "a quantum circuit acting on n = log N qubits" uses N = 2^n, while the same page gives the matrix dimension as "N = O(2^n κ)" and Appendix A.5 gives "dimension N = 6T 2^n".
- p. 4 Sec. III, 'The reduction'
a quantum circuit acting on n = log N qubits
- p. 4 Sec. III, 'The complexity of matrix inversion'
N = O(2nκ)
- p. 12 Appendix A.5, after (A34)
dimension N = 6T 2n
Judge's note: Page 4 image shows both statements a few lines apart; the p12 text shows N = 6T·2^n. N is the matrix dimension everywhere else, so n = log N is loose: log N = n + log(6T). It could be meant as an approximate scaling, hence an observation.
Second check: another model agreed
Report a problem with this finding
Wording The run-time summary on p.6 says Õ suppresses "exp(O(1/√log(t0/ǫH)))", but (A2) contains the factor 9^{√log(s²t0/ǫH)} = exp(O(√log(s²t0/ǫH))), which grows. The printed factor tends to 1 instead.
- p. 6 Eq. (A2)
s2t09√log(s2t0/ǫH)
- p. 6 Last paragraph of Section A1
exp(O(1/√log(t0/ǫH)))
- p. 6 Appendix A.1, last paragraph
exp(O(1/ p log(t0/ǫH)))
- p. 6 Eq. (A2)
TH = O(log(N)(log∗(N))2s2t09 √ log(s2t0/ǫH))
Only the authors can say what is right here.
Judge's note: Page 6 image checked. (A2) has the factor 9^{√log(s²t0/ǫH)}, and the last paragraph lists exp(O(1/√log(t0/ǫH))) as a suppressed term. Since 9^{√L} = exp(ln9·√L), the square root sits in the numerator in one place and the denominator in the other. The suppressed factor is still (t0/ǫH)^{o(1)}, so the Õ claim stands; only the description of the suppressed term disagrees with (A2).
Second check: another model agreed
Report a problem with this finding
Wording Overconstrained case: "In this case, applying H to |0⟩|b⟩ will return a valid solution"; the solution comes from applying H⁻¹ (the inversion algorithm), as in the display "H⁻¹|0⟩|b⟩ = …" at the top of the same page.
- p. 12 Section A4, overconstrained paragraph
applying H to |0⟩ |b⟩ will return a valid solution
Only the authors can say what is right here.
Judge's note: Viewed page 12. Applying H itself to |0>|b> gives |1>A†|b>, which is not a solution of A|x>=|b>; the display above uses H^{-1}. It could be shorthand for running the algorithm with H, but as written the operator is wrong. Rated minor because the intent is clear from context.
Second check: another model agreed
Report a problem with this finding
Wording After (A34), p.12 says A "has condition number κ ≤ 2T". The singular values of I − Ue^{−1/T} span [1−e^{−1/T}, 1+e^{−1/T}], and with U as intended (U^{3T}=I, so −1 is an eigenvalue when T is even) κ = coth(1/(2T)) > 2T. For example, T=2 gives κ ≈ 4.08.
- p. 12 Text after (A34)
has condition number κ ≤ 2T
Only the authors can say what is right here.
Judge's note: Page 12 image checked. U is unitary, so I−Ue^{−1/T} is normal with eigenvalues 1−e^{iφ−1/T}, and its smallest and largest singular values are 1−e^{−1/T} and 1+e^{−1/T} when 1 and −1 are eigenvalues. With the corrected Eq. (4) (see C005), U is a cyclic weighted shift with product I, so its eigenvalues are the 3T-th roots of unity, and −1 is one of them when T is even. Then κ = (1+e^{−1/T})/(1−e^{−1/T}) = coth(1/2T) > 2T. The excess is only O(1/T), and p.4 says κ = O(T), so later asymptotics are unaffected. The exact inequality as printed is too tight.
Second check: another model agreed
Report a problem with this finding
Wording The bound is derived with constant c2 ("where c2 = 2^{1−δ}3^{c1} is another constant"), but the next sentence restates it as "T_{i+1} = T_i^{1−δ} c3 (n_i log(n_i))^{c1} gates", using c3 before c3 is introduced ("Defining yet another constant").
- p. 13 Proof of Theorem 4, recipe paragraph
c3(ni log(ni))c1 gates and error ǫ
- p. 13 line above
where c2 = 21−δ3c1 is another constant
- p. 13 Appendix A.5, recipe paragraph
T 1−δ i c3(ni log(ni))c1 gates
- p. 13 recipe for simulating n_i-qubit computation
c3(ni log(ni))c1 gates
Judge's note: Read the full page 13 image. The display ends in T^{1−δ} c2 (n log(n))^{c1} and c2 is defined on the next line. The recipe paragraph that follows uses c3 for the same prefactor, and c2 is never used again. c3 is only introduced later for the bound in terms of n0. The first c3 should read c2. This is a notation slip; the argument is unaffected.
Second check: another model agreed
Report a problem with this finding
Wording The sum runs over j but the summand is indexed by i: "n_i = n0 + Σ_{j=0}^{i−1} log(18T_i)"; it should be log(18T_j).
- p. 13 Proof of Theorem 4, bound on n_i
∑i−1 j=0 log(18Ti)
- p. 13 Appendix A.5, bound on n_i
ni = n0 + Pi−1 j=0 log(18Ti)
Judge's note: Read the full page 13 image; the summand is printed as log(18T_i) under a sum over j = 0..i−1. From n_{j+1} = n_j + log(18T_j) the summand must be T_j. The next expression, n0 + 2n0 Σ_j (1−δ/2)^j + i log(18), only follows with T_j, using T_j ≤ 2^{(1−δ/2)^j 2n0}. Index typo; the result is unaffected.
Second check: another model agreed
Report a problem with this finding
Typo Upper summation limit is lower-case n instead of N in "which corresponds to |x⟩ = Σ_{j=1}^{n} β_j λ_j^{-1} |u_j⟩" (p3) and in "P̃ = Σ_{j=1}^{n} |u_j⟩⟨u_j| ⊗ …" (p8).
- p. 3 Section II, sentence after the post-measurement state
which corresponds to |x⟩ = ∑n j=1 βjλ−1 j |uj⟩
- p. 3 Sec. II, sentence after the post-measurement state
which corresponds to |x⟩= Pn j=1 βjλ−1 j |uj⟩
- p. 8 Appendix A.2, definition of P̃
˜P = n X j=1 |uj⟩⟨uj|
- p. 3 after the rotation/measurement step
|x⟩= Pn
Judge's note: Page 3 image shows 'n' as the upper limit while every other eigenvector sum on the page runs to N. Page 8 image shows the same 'n' in the P̃ definition, with the following sums running to N. Elsewhere n denotes the number of qubits.
Second check: none (judge only)
Report a problem with this finding
Typo Garbled sentence: "enables the user to estimate what the size of the ill-conditioned part, or to handle it in any other way she wants" (a stray 'what' or a missing 'is').
- p. 4 Section IV, after the well/ill display
to estimate what the size of the ill-conditioned part
- p. 4 Sec. IV Discussion, after displayed state
enables the user to estimate what the size of the ill-conditioned part, or
- p. 4 Discussion, ill-conditioned matrices
estimate what the size of the ill-conditioned part
Judge's note: Read on the page 4 image; the wording is as quoted.
Second check: none (judge only)
Report a problem with this finding
Typo Acknowledgements print "P. Parillo"; the intended name is probably Parrilo.
- p. 5 Acknowledgements
P. Parillo
Only the authors can say what is right here.
Judge's note: Rests on outside knowledge: that the person thanked is Pablo Parrilo (MIT), whose surname is spelled 'Parrilo'. The page 5 image prints 'P. Parillo' as quoted; the correct spelling cannot be verified from the files.
Second check: none (judge only)
Report a problem with this finding
Typo Acknowledgements print "S. Gharabian"; the intended name is probably Gharibian.
- p. 5 Acknowledgements
S. Gharabian
Only the authors can say what is right here.
Judge's note: Rests on outside knowledge: that the person thanked is Sevag Gharibian, whose surname is spelled 'Gharibian'. The page 5 image prints 'S. Gharabian' as quoted; the correct spelling cannot be verified from the files.
Second check: none (judge only)
Report a problem with this finding
Typo Misspelling: "To simuluate e^{iAt} for some t ≥ 0" (should be 'simulate').
- p. 6 First paragraph
To simuluate eiAt
- p. 6 Appendix A.1, paragraph after (A2)
the additional error introduced by this step introduces is negligible
- p. 6 Appendix A.1, first paragraph of page 6
To simuluate
- p. 6 first line, Hamiltonian simulation paragraph
To simuluate eiAt for some t ≥0
Judge's note: Visible on the page 6 image. The duplicated-verb remark in one reviewer note is the same defect as C014 and is judged there.
Second check: none (judge only)
Report a problem with this finding
Typo Duplicated verb: "the additional error introduced by this step introduces is negligible compared with the rest of the algorithm".
- p. 6 Paragraph after (A2)
the additional error introduced by this step introduces is negligible
- p. 6 same paragraph
introduces is negligible
- p. 6
introduced by this step introduces is negligible
Judge's note: Visible on the page 6 image, in the paragraph after (A2).
Second check: none (judge only)
Report a problem with this finding
Typo Unbalanced parentheses in "Õ(κ(T_B+t0 s² log(N)),": three opening and two closing.
- p. 6 Last paragraph of Section A1
Õ(κ(TB+t0s2 log(N))
Judge's note: Page 6 image, last paragraph of A.1: the expression reads Õ(κ(T_B + t0 s² log(N)), with the outer closing parenthesis missing.
Second check: none (judge only)
Report a problem with this finding
Typo Definition of P̃ on page 8 has the sum over j running to lowercase "n" ("P̃ = Σ_{j=1}^{n} |uj⟩⟨uj| ⊗ …"), whereas the eigenvector sums immediately below run to N.
- p. 8 Definition of P̃, first display
P̃ = ∑ n j=1 |uj⟩⟨uj|
Judge's note: Viewed page 8. The upper limit of the first display is a lowercase n; the next three displays on the same page sum j=1..N over the same eigenvectors.
Second check: none (judge only)
Report a problem with this finding
Typo After (A21): "where the first inequality is Cauchy-Schwartz"; the name is spelt Schwarz.
- p. 10 Text after (A21)
Cauchy-Schwartz
- p. 10 after (A21)
the first inequality is Cauchy-Schwartz
Only the authors can say what is right here.
Judge's note: Rests on outside knowledge: the inequality is named after H. A. Schwarz, spelt without a 't'. The page 10 image does print "Cauchy-Schwartz". Cosmetic.
Second check: none (judge only)
Report a problem with this finding
Typo "Dropping the inital |1⟩, this defines our solution |x⟩"; "inital" should be "initial".
- p. 12 First paragraph after the top display
Dropping the inital |1⟩
- p. 12
Dropping the inital |1⟩, this defines our solution
Judge's note: Viewed page 12; the misspelling is present in the image.
Second check: none (judge only)
Report a problem with this finding
Typo Reference [9] gives the article number as a degenerate page range: "Phys. Rev. Lett., 87(16):167902–167902, 2001."
- p. 14 reference [9]
167902–167902
Judge's note: Read the full page 14 image; the reference prints 167902–167902. This is a bibliography-style artefact where the article number is repeated as a range. It is cosmetic and the reference remains identifiable.
Second check: none (judge only)
Report a problem with this finding
Typo Ungrammatical sentence: "This poly(log(1/ε)) dependence is because when writing the vectors |b⟩ and |x⟩ as bit strings means that adding an additional bit will double the accuracy."
- p. 14 Section A 5, accuracy paragraph
This poly(log(1/ǫ)) dependence is because when writing the vectors |b⟩and |x⟩as bit strings means that adding
Judge's note: Read the full page 14 image; the sentence is printed as quoted. "is because when writing ... means that" merges two constructions. The intended meaning is still clear, so this is cosmetic.
Second check: none (judge only)
Report a problem with this finding
Typo Reference [11] title contains stray listing text: "A. Klappenecker and M. Rotteler. Quantum Physics Title: Engineering Functional Quantum Algorithms. Phys. Rev. A, 67:010302(R), 2003."
- p. 15 Reference [11]
Quantum Physics Title: Engineering Functional Quantum Algorithms
Judge's note: Read the full page 15 image; the entry prints "Quantum Physics Title: Engineering Functional Quantum Algorithms". The words "Quantum Physics Title:" are evidently pasted metadata (a subject-class label followed by the field label "Title:"), not part of the title.
Second check: none (judge only)
Report a problem with this finding
Typo Reference [22] misspells the title: "Rank-deficient and discrete ill-posted problems: Numerical aspects of linear inversion"; "ill-posted" should be "ill-posed".
- p. 15 Reference [22]
Rank-deficient and discrete ill-posted problems
- p. 15 reference [22]
discrete ill-posted problems
Judge's note: Read the full page 15 image; the entry prints "ill-posted". The standard mathematical term is "ill-posed problems", so this is a spelling error in the reference title.
Second check: none (judge only)
Report a problem with this finding
Typo Reference [15] misspells "Millennium": "Contemporary Mathematics Series Millenium Volume".
- p. 15 reference [15]
Contemporary Mathematics Series Millenium Volume
Judge's note: Read the full page 15 image; the entry prints "Millenium" with a single n. Cosmetic misspelling.
Second check: none (judge only)