Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

QSVT inverse-state output and success cost

Statement

Let m be the generated odd polynomial degree and let ζ bound the total operator error of one QSVT success block relative to F=(δ/2)Aˉ+, including scalar approximation, block-encoding, and phase-synthesis errors. If ∥A∥op≤α and the normalized input is supported on singular values at least γ, then ∥F∣b⟩∥2≥δ2/4, where δ=γ/α. If ζ<δ/2, the implemented success weight pimpl satisfies pimpl≥(δ/2−ζ)2. Conditional on success of one unamplified attempt, let w be its phase-fixed success vector. The unit representative w/∥w∥ differs in vector norm from A+∣b⟩/∥A+∣b⟩∥ by at most 2ζ/∥F∣b⟩∥≤4ζ/δ. The amplified returned quantum state has this same ray: for any unit representative ψ of that state there is ω∈C with ∣ω∣=1 such that ∥ωψ−A+∣b⟩/∥A+∣b⟩∥∥≤2ζ/∥F∣b⟩∥≤4ζ/δ. This terminal-state convention leaves the coherent phase and operator-error bound of the actual QSVT success block fixed as stated above. Put pideal=∥F∣b⟩∥2, so pideal≥δ2/4. In particular, ζ≤δ/4 gives pimpl≥δ2/16.

An unamplified attempt of degree m uses exactly m block-encoding signal calls in the QSVT sequence. Applying the supplied unknown-amplitude amplification procedure costs expected O(m/pimpl) signal calls, with state preparation, controlled/inverse calls, reflections, phase gates, synthesis, and classical certificate generation charged separately. When the degree theorem is established, m=O(δ−1ln⁡(1/e)), so this becomes O(δ−1ln⁡(1/e)/pimpl) expected signal calls, and the crude ζ≤δ/4 bound gives O(δ−2ln⁡(1/e)). This is an expected-cost statement; it does not assert a fixed worst-case stopping time.

Facts & Assumptions

Given: The block-encoded QLSP instance, a successful polynomial/phase certificate including the exact returned-phase product check, and ζ<δ/2 for the actual success block. The phase-approximation and circuit-implementation errors in ζ are measured relative to that verified ideal sequence.

[F1]

Gapped pseudoinverse polynomial degree and error: on [δ,1], the generated odd polynomial approximates δ/(2x) and has degree O(δ−1ln⁡(1/e)).

[F2]

Normalization and nonzero success weight of the supported pseudoinverse target: F=(δ/2)Aˉ+ has ∥F∣b⟩∥≥δ/2 and its normalized output is the QLSP target.

[F3]

QSVT action on singular subspaces: the odd sequence on the adjoint PUE acts on each supported singular pair with scalar multiplier p(σ/α), and uniform scalar error gives the corresponding operator error.

[F4]

QSVT signal and reflection query counts: a degree-m QSVT sequence makes exactly m signal calls, and phase/reflection and controlled-call counts remain separate.

[F5]

Expected cost of unknown-amplitude search: for positive success weight a, the unknown-amplitude procedure has expected query cost Θ(a−1/2), with gates and classical costs separate.

[F6]

Amplitude-amplification invariant plane: each standard Grover iterate acts on the span of the normalized good and bad components, and its good component is a scalar multiple of the same normalized good vector.

[F7]

Unknown-amplitude randomized search: each round starts with a fresh preparation and returns only after the good projector accepts.

[F8]

Unknown-amplitude search has no false positives and halts almost surely: on a positive initial good weight, the search returns a good output with probability 1.

[F9]

QSVT regularized pseudoinverse transformation: before execution, the algorithm multiplies the exact returned phase-scalar list and checks its four polynomial entries against the returned completed pair; a mismatch returns PHASE_PRODUCT_ERROR without a QSVT call.

Proof

1.1givenF1F3F9algebra

Write the finite SVD A=∑jσj∣uj⟩⟨vj∣. Since b=∑jβjuj is supported on σj≥γ, applying the odd transform to Aˉ† maps each uj to vj with multiplier given by the verified phase-sequence polynomial. By [F9] this ideal polynomial is exactly the generated completed-pair target before numerical phase approximation; its total difference from the intended p transform, including polynomial shrink and phase/circuit errors, is included in ζ. The target multiplier is δ/(2(σj/α))=γ/(2σj), the coefficient of F=(δ/2)Aˉ+; [F1] and [F3] therefore bound the operator error on the supported subspace by ζ.

1.2givenF2step 1.1algebra

Put v=F∣b⟩ and let w be the implemented success vector. Then ∥w−v∥≤ζ. By [F2], ∥v∥≥δ/2, so reverse triangle inequality gives ∥w∥≥δ/2−ζ>0 and pimpl=∥w∥2≥(δ/2−ζ)2. Moreover, ∥w∥w∥−v∥v∥∥≤∣∥v∥−∥w∥∣+∥w−v∥∥v∥≤2ζ∥v∥≤4ζδ. The conditional state is defined because ∥w∥>0.

2.1givenF2F4step 1.2algebra

By [F2], pideal=∥v∥2≥δ2/4. In the implemented case, if ζ≤δ/4, step 1.2 gives pimpl≥δ2/16. By [F4], one attempt uses m block-encoding signal calls, and phase/reflection and controlled-call resources remain separate.

3.1givenF1F4F5F6F7F8step 1.2step 2.1algebra∎

Put ∣G⟩=w/∥w∥ for the one-attempt good vector. By [F6], after any integer number j of amplitude-amplification iterates the unnormalized good component is sj∣G⟩ for a scalar sj. On a positive-probability good branch sj≠0, and the normalized ket is (sj/∣sj∣)∣G⟩; its phase can differ from that of ∣G⟩. Each such branch has exactly the density operator ∣G⟩⟨G∣, including after the stopping history is forgotten. Thus any returned unit representative is ψ=c∣G⟩ with ∣c∣=1, and choosing ω=c‾ gives ωψ=∣G⟩ and the error bound of step 1.2. This identifies the terminal state ray without rephasing any coherent circuit or controlled call. Fresh rounds use the same preparation circuit, and [F7] returns only on that good measurement; [F8] supplies eventual success for pimpl>0. Applying [F5] to the actual success weight pimpl gives expected O(pimpl−1/2) attempts, hence expected O(m/pimpl) signal calls. If [F1] is established, substitute m=O(δ−1ln⁡(1/e)); if ζ≤δ/4, step 2.1 gives pimpl−1/2≤4/δ. All other resource coordinates remain separate by [F4]–[F5].

Depends on

Used by

Dependency tree · two levels

83 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources