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

A pure witness suffices for a QMA completeness threshold

Statement

For a finite QMA verifier with witness acceptance effect Ex, if a witness density operator ρ satisfies Tr⁡(Exρ)≥c, then some pure-state density operator ∣u⟩⟨u∣ satisfies Tr⁡(Ex∣u⟩⟨u∣)≥c. Thus allowing mixed witnesses does not increase the completeness threshold.

Facts & Assumptions

Given: A nonzero finite-dimensional witness space, a density operator ρ, and its positive contraction Ex from the verifier.

[F1]

Density operator: a density operator is nonnegative, self-adjoint, and has trace one.

[F3]

A finite verifier induces an effect on its witness: the acceptance probability of a witness density ρ is Tr⁡(Exρ) and 0≤Ex≤I.

[F4]

Dirac Notation Conversion: ∣u⟩⟨u∣ is the rank-one map v↦⟨v,u⟩u for a unit vector u.

[F5]

Trace is a linear functional on Mn(F): the finite-dimensional trace is linear.

[F6]

The basis-independent trace of an endomorphism of a finite-dimensional vector space: trace is independent of the chosen ordered basis and is the sum of diagonal entries in that basis.

[F7]

QMA promise class with a verifier effect on witnesses: on a YES instance the completeness threshold is witnessed by a density operator satisfying Tr⁡(Exρ)≥c.

Proof

1.1givenF1F2F4F6choosealgebra

By [F1]–[F2], choose an orthonormal eigenbasis u1,…,ud for ρ, with eigenvalues λj≥0. Basis independence [F6] and its diagonal-sum definition give ∑jλj=Tr⁡(ρ)=1. Thus ρ=∑jλj∣uj⟩⟨uj∣, with zero eigenvalue terms allowed.

2.1F3F4F5F6F7step 1.1algebra∎

Linearity [F5] gives Tr⁡(Exρ)=∑jλjTr⁡(Ex∣uj⟩⟨uj∣). By [F3], these terms are precisely the verifier's pure-state acceptance probabilities. By [F4], in an orthonormal basis beginning with uj, the rank-one factor has only its first diagonal entry nonzero after multiplication by Ex; [F6] therefore gives Tr⁡(Ex∣uj⟩⟨uj∣)=⟨Exuj,uj⟩. This is a convex average; if every positive-weight term were below c, its finite weighted average would be below c. Hence some j with λj>0 has acceptance at least c, so [F7] gives a pure witness meeting the QMA completeness threshold.

Depends on

Used by

Dependency tree · two levels

34 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