Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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.

Median-amplified spectral estimate

Definition

Inputs. An eigenvalue-estimation access instance, positive rational binary inputs ϵ>0 and 0<δ<1, and certified rational upper enclosures π+>π and L+≥ln⁡(1/δ) as produced by the finite interval procedures in OP0 of research/quantum-algorithms-planning/operational-contracts.md.

Instructions. Choose the least dyadic Q=2m, m≥1, satisfying Qϵ≥6π+. Choose the least positive odd integer r satisfying r≥8L+. On each of r fresh trials, invoke the access instance's declared state-preparation circuit on fresh standard-input registers to prepare its normalized state ψ, then run Quantum phase-estimation spectral sampler with phase-register size m. Decode every result using the same branch convention, then return the median of the r real eigenvalue estimates. Do not reuse the postmeasurement system from one trial as the input to another; each trial begins with a fresh state preparation. A fixed-eigenvalue accuracy guarantee requires the eigenstate promise stated by the corresponding theorem.

The certified enclosures, doubling comparisons, state preparation, each QPE circuit, each controlled-power or controlled-U call, projective readout, decoding, and median computation are charged. If only controlled-U access is supplied, the ideal controlled-call count is r(Q−1); exact supplied powers use their separately declared per-trial costs. No inverse call is used by this procedure. Its accuracy theorem is separate.

Depends on

Used by

Dependency tree · two levels

12 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