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.

Parallel QMA amplification remains sound for entangled witnesses

Statement

Let a QMA verifier have completeness c and soundness s with 0≤s<c≤1, and put γ=c−s. For 0<δ<1, choose an integer

r≥2γ−2ln⁡(1/δ).

Then the parallel verifier of QMA parallel repetition with a midpoint threshold has completeness at least 1−δ and soundness at most δ. On a NO input its soundness bound holds for every joint r-block witness state, including entangled states. The repetition uses r witness blocks and r verifier copies, so choosing the least integer r satisfying the bound gives polynomial size when γ−1 and ln⁡(1/δ) are polynomially bounded. The probability bounds hold for every larger r as well.

Facts & Assumptions

Given: A finite verifier, a YES or NO promise input, r≥1 copies, 0≤s<c≤1, γ=c−s, and δ∈(0,1).

[F1]

A finite verifier induces an effect on its witness: a verifier's accept operator is an effect Ex and its acceptance probability on witness ρ is Tr⁡(Exρ).

[F2]

Tensor products of finitely many linear maps: tensor maps act factorwise on elementary tensors, and the ordered tensor registers retain the stated factor order (Ordered tensor registers, their inner product, and wire permutations).

[F3]

Chernoff bound for independent bernoulli trials: for independent Bernoulli trials with sum S and mean μ, each one-sided additive tail at deviation t≥0 is at most exp⁡(−2t2/r); its proof also establishes Eeu(X−p)≤eu2/8 for a single Bernoulli(p) variable and every real u.

[F4]

QMA promise class with a verifier effect on witnesses: on a YES input some witness has acceptance at least c, while on a NO input every witness state has acceptance at most s.

[F5]

The natural logarithm as the inverse of the exponential function: ln⁡ is the inverse of the positive real exponential on (0,∞).

[F6]

QMA parallel repetition with a midpoint threshold: the verifier runs r copies on distinct witness blocks and accepts when the number of accepts is at least ⌈r(c+s)/2⌉.

[F7]

Finite POVMs and their outcome law: the joint finite measurement is represented by tensor-product effects whose weights are obtained by the Born trace rule.

[F8]

POVM outcome weights are probabilities: the joint POVM outcome weights are nonnegative and sum to one.

Proof

1.1givenF1F2F3F4F6algebra

Put τ=(c+s)/2=s+γ/2. By [F6], the midpoint test accepts at ⌈rτ⌉. Its CNOT fanout prepares a separate register ∣x⟩ for every verifier copy from the classical basis input, and the outputs are evaluated using the same predicate Acc⁡n(x,⋅), so each block realizes the acceptance effect Ex of [F1]. On a YES input, choose a witness ρ with acceptance p≥c and give the product witness ρ⊗r. Each copy acts on a distinct input, witness and ancilla block, so its accept bit is an independent Bernoulli(p) variable by the product rule in [F2] and the finite POVM law. If the midpoint test rejects, then S<⌈rτ⌉, hence S<rτ and S−rp≤−rγ/2. The lower-tail inequality in [F3] bounds this event by exp⁡(−rγ2/2).

1.2givenF1F2F4F6F9algebra

Fix a NO input and any joint witness density σ on the r blocks. By the exact basis-state fanout in [F6], every verifier copy starts with its own fixed ∣x⟩ input and its own clean ancillas; hence its acceptance effect on its witness block is the same Ex from [F1]. On one block, [F1] and [F4] give ⟨Exv,v⟩≤s for every unit witness vector v; as Ex is an effect, this means 0≤Ex≤sI. Let Aj=I⊗⋯⊗Ex⊗⋯⊗I on the full r-block space. An eigenbasis of Ex from [F9], tensored with the other block bases, shows 0≤Aj≤sI. Distinct Aj act on distinct tensor factors, so they commute by [F2].

2.1givenF1F2F7F8F9step 1.2algebra

Define the full-space effects Bj,1=Aj and Bj,0=I−Aj. The joint outcome b∈{0,1}r has effect ∏jBj,bj on this same space: equivalently it is ⨂jCbj for the one-block effects C1=Ex, C0=I−Ex. This product/tensor identity follows on elementary tensors by [F2]. The finite POVM trace rule and normalization [F7]–[F8] therefore give, for t>0, EσetS=Tr⁡ ⁣(σ∑bet∣b∣∏jBj,bj)=Tr⁡ ⁣(σ∏j=1r(I+(et−1)Aj)). Each factor is positive and at most (1−s+set)I by step 1.2. In the product of the single-block eigenbases from [F9], their product is diagonal with entries bounded by (1−s+set)r, so the product is at most that scalar times identity. Taking its trace against the density σ gives EσetS≤(1−s+set)r, without any tensor product of full-space effects.

3.1F3step 2.1algebra

Apply the single-Bernoulli moment bound in [F3] with parameter s: e−ts(1−s+set)≤et2/8. Thus Eσet(S−rs)≤ert2/8. Since S≥⌈rτ⌉ implies S−rs≥rγ/2, the finite-sum Markov bound gives Pr⁡σ(S≥⌈rτ⌉)≤exp⁡(−trγ/2+rt2/8). Taking t=2γ makes this at most e−rγ2/2. No independence assumption is used for σ.

4.1givenF5F6step 1.1step 3.1algebra∎

The choice r≥2γ−2ln⁡(1/δ) gives e−rγ2/2≤δ on both promise sides by [F5]. The threshold is the exact integer rule in [F6], and repeating a polynomial-size full-list verifier r times gives polynomial gate count, witness width, and generator time whenever r is polynomially bounded. For the least admissible integer, r≤2γ−2ln⁡(1/δ)+1, which is polynomial under the resource hypotheses of the Statement.

Depends on

Used by

Dependency tree · two levels

55 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