Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

SDP matrix-expectation estimation error and cost

Statement

Let M=M∗ with ∥M∥≤1, and let the coherent signed sampler from Coherent SDP matrix-expectation oracle be supplied. For additive tolerance 0<τ≤2 and failure 0<δ<1, supply rational τ/2<t≤τ and δ/2<β≤δ, and run that procedure at inputs (t,β). The QA29 estimator returns an estimate of tr⁡(Mρ) within τ with probability at least 1−δ in either declared QA13 access mode. In repeated controlled-Q access it uses O(τ−1(1+ln⁡(1/δ))) coherent sampler/reflection rounds; in supplied controlled-power access sum the separately declared power-query costs. When the supplied purification is itself an approximate Gibbs purification at vector error ξ≤τ/4, the expectation bias is at most 2ξ; use its rational sampling tolerance t/2≤τ/2 to keep total error at most τ. In an SDP iteration, use a union bound across all m observables and charge each Gibbs preparation/inverse, observable access, controlled call, and state/phase implementation.

Facts & Assumptions

Given: The signed variable lies in [−1,1], QA29's expectation guarantee, and the purification error bound. The sampler/reflection-round bound uses repeated controlled-Q access; the accuracy and bias assertions permit either declared access mode.

[F1]

Coherent SDP matrix-expectation oracle: the encoded variable has mean tr⁡(Mρ) and range [−1,1].

[F2]

Quantum bounded-expectation guarantee and query cost: for an encoded variable in [a,b], error ϵ and failure δ, the median estimator has error ϵ with probability 1−δ in either mode and query order (b−a)ϵ−1(1+ln⁡(1/δ)) in repeated controlled-Q access. Supplied controlled-power access instead charges its actual power queries separately.

[F3]

Gibbs purification error and resource bound: vector error ξ≤τ/4 bounds the conditional purification deviation.

[F4]

Cauchy–Schwarz: ∣⟨u,v⟩∣≤∥u∥∥v∥, with equality exactly for linearly dependent vectors: ∣⟨u,v⟩∣≤∥u∥ ∥v∥ in finite-dimensional complex inner-product spaces.

[F5]

Dirac Notation Conversion identifies Dirac pairings with the root inner product; The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv|| gives ∥Mu∥≤∥M∥ ∥u∥.

Proof

technique · direct
1.1givenF1F2algebra

Apply [F2] to the interval [−1,1] with rational tolerance t/2 and rational failure budget β; its interval width is 2, so it returns the approximate-purification mean estimate within t/2≤τ/2 with probability at least 1−β≥1−δ and, in repeated controlled-Q access, uses O(τ−1(1+ln⁡(1/δ))) coherent rounds, since t>τ/2 and β>δ/2. In supplied-power access the same accuracy holds with the separately priced power-query implementation in [F2].

2.1givenF3F4F5algebra∎

For unit vectors ∣u⟩,∣v⟩ and a contraction M, expand ⟨u∣M∣u⟩D−⟨v∣M∣v⟩D=⟨u−v∣M∣u⟩D+⟨v∣M∣u−v⟩D. Cauchy–Schwarz [F4], the Dirac conversion and operator norm [F5], and unit norms bound its absolute value by 2∥u−v∥∥M∥≤2ξ. Thus the chosen rational tolerance gives total error at most t/2+2ξ≤τ when the target is the ideal Gibbs mean; a union bound makes m simultaneous estimates fail with probability at most the sum of their declared failure budgets.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

51 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