Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

HHL cost under direct controlled-simulation access

Statement

Let L=log⁡2T, tj=2jt0/T, K=⌈4κ⌉, and R=⌈16ln⁡(1/ρ)⌉+16. The capped HHL circuit uses at most RK calls to each of V and V†, at most RK calls to each supplied preparation form (the tagged BA in dilation mode) and its inverse, and one table construction GΨ(T,ϵΨ). Each V or V† contains two sine-table preparation/unpreparation circuits, one forward and one inverse QFT, the flag circuit, and 2L controlled simulation calls at signed times ±tj; its absolute evolution times sum to less than 2t0. Therefore the total absolute simulation time is less than 4RKt0=O(κ2ϵ−1(1+log⁡(1/ρ))). More precisely, the simulation charge is the actual sum over all V,V† calls of ∑j<L(Csim(tj,ηj)+Csim(−tj,ηj)). The remaining charge is GΨ(T,ϵΨ)+nVCB+nV†CB†+2(nV+nV†)CΨ(T,ϵΨ)+(nV+nV†)(CQFT+(T)+CQFT−(T)+Cflag(κ,ηR)+Carith(T,κ,ϵ))+NrefCref+NverCver, where nV,nV†≤RK and Nref,Nver are the actual reflection and verification counts. The table itself has O(Tlog⁡(T/ϵΨ)) data bits and T−1 controlled rotations; no polylogarithmic table-generation or finite-rotation synthesis bound is asserted.

Facts & Assumptions

Given: The finite OP5 circuit and its declared simulator resource function.

[F1]

HHL finite sine-window phase-estimation algorithm: the attempt uses the signed times tj=2jt0/T, reverses each phase and prepares/unprepares the sine table.

[F2]

Finite capped amplification succeeds with a supplied lower bound: at most RK calls are made in each direction.

[F3]

Hamiltonian simulation error and resources, Circuit-family and computation cost model, and HHL state-preparation and simulation access model: simulator, the actual supplied preparation form (including BA in dilation mode), QFT, table, reflection, verifier, and gate resources are separate additive cost coordinates.

Proof

1.1F1F2algebra

The geometric sum of forward times is ∑j=0L−12jt0/T=(T−1)t0/T<t0. The reverse list has the same absolute times, so one V or V† call uses less than 2t0. By [F2], there are at most RK calls in each direction, giving total absolute time below 4RKt0. Since K≤5κ, R≤16ln⁡(1/ρ)+17, and t0=2048κ/ϵ, the stated order follows.

2.1F1F3step 1.1algebra∎

Each V or V† circuit contains one forward and one inverse QFT, two sine-table circuits, one flag circuit, and one forward/reverse simulation list by [F1]. Multiplying their actual counts by the separate cost functions in [F3] gives the displayed additive charge; the fixed table GΨ is generated once, and every B, inverse B, reflection, and verifier use is counted in its own coordinate.

Depends on

Used by

Dependency tree · two levels

42 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