Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-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.

Correctness of the small-time-aware simulator

Statement

For every promised input of Small-time-aware qubitized simulator, a successful output satisfies the clean-input isometry error bound ∥VimplJclean−Joute−itH∥op≤ϵ. It also satisfies the corresponding reference-system trace-distance bound after tracing the work registers.

Facts & Assumptions

Given: The exact normalized block encoding, a rational t, and 0<ϵ<1.

[F1]

Small-time-aware qubitized simulator: the small branch returns identity when α∣t∣≤ϵ; otherwise it invokes OP4.

[F2]

Qubitized simulation correctness: on a successful OP4 output, the clean-input isometry error is at most ϵ, and the traced output has the same trace-distance bound.

[F3]

Finite Hermitian matrix dynamics: UH(t)=e−itH is defined by the finite spectral functional calculus.

[F4]

Unitary and differential identities for finite matrix dynamics: UH′(s)=−iHUH(s) and UH(s) is unitary.

[F5]

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

[F6]

Clean-input isometry error bounds output trace distance: clean-input isometry error δ bounds the reference-system trace distance after tracing work by δ.

[F7]

Qubitization access model: the block-encoding normalization satisfies ∥H∥op≤α.

Proof

Given: As in Facts & Assumptions.

1.1F1F2cases

If α∣t∣>ϵ, the algorithm invokes OP4, and [F2] gives the clean-input isometry bound.

1.2F3F4F5F7givenalgebra

Suppose α∣t∣≤ϵ. For a unit vector ψ, the differential identity [F4] and the fundamental theorem of calculus give UH(t)ψ−ψ=∫0t−iHUH(s)ψ ds. Each integrand has norm at most ∥H∥op, because UH(s) preserves norm. The triangle inequality for Riemann sums and continuity yield ∥(UH(t)−I)ψ∥≤∣t∣∥H∥op≤α∣t∣≤ϵ, using [F7]. Taking the maximum over unit ψ proves the clean-input operator bound for the identity circuit. The work registers are exactly zero, so the same isometry bound holds.

2.1F1F2F6F7step 1.1step 1.2algebra∎

In either branch, the implementation on clean inputs and the target Joute−itH are isometries whose operator-norm difference is at most ϵ, by steps 1.1 and 1.2. Apply [F6] with δ=ϵ to obtain the reference-system trace-distance conclusion after tracing work.

Depends on

Used by

Dependency tree · two levels

41 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