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.

Qubitized simulation correctness

Statement

For the exact access model of Qubitization access model, or its bounded-block-error variant satisfying the post-degree budget in Qubitized Hamiltonian simulator, rational t, and 0<ϵ≤1, a successful execution of Qubitized Hamiltonian simulator returns a unitary dilation Vimpl satisfying ∥VimplJclean−Joute−itH∥op≤ϵ on the clean-input isometry Jclean, where Jout appends every work register in zero. Output work registers are approximate; no full-space error on arbitrary dirty work inputs or exact cleanup is asserted. For t=0, the declared identity branch is exact. For every reference system, tracing out work gives the corresponding system-output trace-distance bound at most ϵ.

Facts & Assumptions

Given: A finite Hermitian H with ∥H∥op≤α, either the exact or budgeted bounded-error normalized block encoding, and a successful certified OP4 execution.

[F1]

Qubitized Hamiltonian simulator: OP4 gives combined scalar error at most ρ=ϵ2/10000, sets each real phase-synthesis tolerance to δqsp=ρ/64, requires the bounded-block mode to satisfy ηOAA=3ρ+2δqsp+8dϵBE≤(3ϵ/128)2, and allocates the remaining post-amplification primitive-implementation error at most ϵ/64.

[F2]

Jacobi–Anger Chebyshev truncation: the factorial-tail polynomial and its certified coefficient rounding give the stated scalar error on [−1,1].

[F3]

Correctness of QSP phase synthesis: on a successful numerical phase-synthesis call, the exact phase-list polynomial error plus the sum of its implemented phase-slot errors is at most δqsp.

[F4]

QSVT action on singular subspaces: the alternating QSVT sequence has the stated polynomial compressed block on each singular space, including endpoints and null spaces.

[F6]

The operator norm is submultiplicative and satisfies ||T^*T|| = ||T||^2: ∥ST∥op≤∥S∥op∥T∥op.

[F7]

Clean-input isometry error bounds output trace distance: clean-input isometry error bounds the reference-system trace distance after work is traced out.

[F9]

Qubitization access model and Qubitized Hamiltonian simulator: the exact and bounded-error modes both satisfy ∥H∥op≤α.

[F10]

Robust one-step OAA including ancilla leakage: if W has clean block M/2 and ∥M−V∥op≤η≤1/100 for a unitary V, the phase-corrected OAA circuit has clean-input isometry error at most 10η, including workspace leakage.

[F11]

The inner-product norm is definite, homogeneous, and satisfies the triangle inequality: the vector triangle inequality induces the operator-norm triangle inequality used in spectral and circuit-product error sums.

[F12]

Operator perturbation bound for QSVT: for any fixed exact degree-d QSVT phase sequence, changing the encoded contraction by ϵBE changes its singular-value-transform block by at most 4dϵBE.

Proof

Given: A successful output of the simulator in Facts & Assumptions; when t≠0, all OP4 certificates succeed. Put V=e−itH and ρ=ϵ2/10000.

1.1F1F8algebra

If t=0, [F1] returns the identity circuit with no signal query, and e−itH=I; hence its clean-input isometry error is zero. If t≠0, continue with the certified OP4 output.

1.2F1F2F3F4F8F9F12algebra

On an eigenvector of H with eigenvalue λ, H/α has eigenvalue x=λ/α∈[−1,1], by [F8] and [F9]. Put Q=E−iO and B=1+2ρ. The OP4 certificate gives ∥Q−fτ∥[−1,1]≤ρ by [F1]–[F2], and ∣fτ(x)∣=1. Since M=Q/B, ∣M(x)−fτ(x)∣≤∣Q(x)−fτ(x)∣/B+(B−1)∣fτ(x)∣/B≤3ρ/(1+2ρ)<3ρ. In the orthonormal eigenbasis, this error is diagonal; for any vector with coordinates cj, its squared output norm is the sum of ∣cj∣2 times the squared scalar errors. Thus the uniform scalar bound gives ∥M(H/α)−e−itH∥op<3ρ. For each real QSVT extraction, [F3] bounds the exact phase-list polynomial mismatch plus the implemented phase-slot errors by δqsp=ρ/64 uniformly on [−1,1]. For the bounded mode, apply [F12] to the exact Φ and −Φ phase sequences on the supplied block and on the target block; each branch changes by at most 4dϵBE, so their average has the same block-perturbation bound. The coefficient-qubit average therefore gives a complete block Mph/2 with ∥Mph−M(H/α)∥op≤2δqsp+8dϵBE. For even pE, pE(σ)=pE(−σ); for odd pO, the singular vector of a negative eigenvalue has left vector u=−v, so pO(σ)∣u⟩⟨v∣=−pO(σ)∣v⟩⟨v∣=pO(−σ)∣v⟩⟨v∣, and pO(0)=0. Thus these transforms are the ordinary polynomial blocks on H/α. The certified error is consequently ∥Mph−e−itH∥op<3ρ+2δqsp+8dϵBE≤ηOAA≤(3ϵ128)2.

2.1F1F10step 1.2algebra

Since 0<ϵ≤1, ηOAA≤9/16384<1/100. Apply [F10] to the unitary W whose clean block is Mph/2, with target unitary V=e−itH. The phase-corrected OAA circuit therefore has clean-input isometry error at most 10ηOAA≤30ϵ/128=15ϵ/64, including its retained-work leakage.

3.1F1F6F11step 2.1algebra

The per-occurrence certificates in [F1] cover every remaining unitary primitive in the fully unrolled post-amplification circuit, counting repeated, inverse and controlled calls separately. If there are N>0 such occurrences, each contributes at most ϵ/(64N) in full operator norm. The telescoping product identity, [F11], and unitary norm one bound the difference between the actual and phase-certified OAA unitaries by ∑j=1Nϵ/(64N)=ϵ/64; for N=0 the difference is zero. Thus the actual clean-input isometry error is at most 15ϵ/64+ϵ/64=ϵ/4<ϵ.

4.1F1F7step 1.1step 3.1algebra∎

If t=0, [F1] returns the exact identity and the conclusion holds with zero error. If t≠0, step 3.1 gives the clean-input isometry bound. Apply [F7] in either case; it includes arbitrary reference systems and discarding the work registers, so the trace distance is at most ϵ.

Depends on

Used by

Dependency tree · two levels

85 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