Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Eigenvalue-estimation access and aliasing convention

Definition

An eigenvalue-estimation access instance consists of a finite-dimensional system space; a costed state-preparation circuit Aψ with Aψ∣0⟩=∣ψ⟩; a costed unitary U and each controlled, inverse, or controlled-inverse version actually used; an injective known phase encoding λ↦θ(λ)∈R/Z on the promised spectrum; and a specified decoder with its branch cut and output units. Exact controlled powers U2j may instead be supplied individually, with their costs. If powers are synthesized from controlled-U, charge the exact number of calls and all control/wiring costs; no power or control is free.

For Hamiltonian access, the instance additionally specifies a Hermitian H, an interval containing σ(H), a simulation rule for each requested signed time and its operator-error/cost bound, and how errors are allocated across the circuit. In the convention of Hamiltonian simulation error and resources, a simulator for e−itH implements the positive-sign phase unitary eiH at t=−1, using inverse access when that is what the supplied interface permits. Every preparation, inverse, controlled call, simulation, phase-register gate, decoder arithmetic operation, measurement, and written output is included in its declared cost coordinates. Aliasing is excluded by the injectivity promise and the chosen decoder; absent that promise, the output is only an estimate of the encoded phase modulo one, not of a uniquely identified eigenvalue.

Depends on

Used by

Dependency tree · two levels

35 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