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 and soundness with , and put . For , choose an integer
Then the parallel verifier of QMA parallel repetition with a midpoint threshold has completeness at least and soundness at most . On a NO input its soundness bound holds for every joint -block witness state, including entangled states. The repetition uses witness blocks and verifier copies, so choosing the least integer satisfying the bound gives polynomial size when and are polynomially bounded. The probability bounds hold for every larger as well.
Facts & Assumptions
Given: A finite verifier, a YES or NO promise input, copies, , , and .
A finite verifier induces an effect on its witness: a verifier's accept operator is an effect and its acceptance probability on witness is .
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).
Chernoff bound for independent bernoulli trials: for independent Bernoulli trials with sum and mean , each one-sided additive tail at deviation is at most ; its proof also establishes for a single Bernoulli variable and every real .
QMA promise class with a verifier effect on witnesses: on a YES input some witness has acceptance at least , while on a NO input every witness state has acceptance at most .
The natural logarithm as the inverse of the exponential function: is the inverse of the positive real exponential on .
QMA parallel repetition with a midpoint threshold: the verifier runs copies on distinct witness blocks and accepts when the number of accepts is at least .
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.
POVM outcome weights are probabilities: the joint POVM outcome weights are nonnegative and sum to one.
Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely supplies an orthonormal eigenbasis for each finite-dimensional self-adjoint effect.
Proof
Put . By [F6], the midpoint test accepts at . Its CNOT fanout prepares a separate register for every verifier copy from the classical basis input, and the outputs are evaluated using the same predicate , so each block realizes the acceptance effect of [F1]. On a YES input, choose a witness with acceptance and give the product witness . Each copy acts on a distinct input, witness and ancilla block, so its accept bit is an independent Bernoulli variable by the product rule in [F2] and the finite POVM law. If the midpoint test rejects, then , hence and . The lower-tail inequality in [F3] bounds this event by .
Fix a NO input and any joint witness density on the blocks. By the exact basis-state fanout in [F6], every verifier copy starts with its own fixed input and its own clean ancillas; hence its acceptance effect on its witness block is the same from [F1]. On one block, [F1] and [F4] give for every unit witness vector ; as is an effect, this means . Let on the full -block space. An eigenbasis of from [F9], tensored with the other block bases, shows . Distinct act on distinct tensor factors, so they commute by [F2].
Define the full-space effects and . The joint outcome has effect on this same space: equivalently it is for the one-block effects , . This product/tensor identity follows on elementary tensors by [F2]. The finite POVM trace rule and normalization [F7]–[F8] therefore give, for , . Each factor is positive and at most by step 1.2. In the product of the single-block eigenbases from [F9], their product is diagonal with entries bounded by , so the product is at most that scalar times identity. Taking its trace against the density gives , without any tensor product of full-space effects.
Apply the single-Bernoulli moment bound in [F3] with parameter : . Thus . Since implies , the finite-sum Markov bound gives Taking makes this at most . No independence assumption is used for .
The choice gives on both promise sides by [F5]. The threshold is the exact integer rule in [F6], and repeating a polynomial-size full-list verifier times gives polynomial gate count, witness width, and generator time whenever is polynomially bounded. For the least admissible integer, , which is polynomial under the resource hypotheses of the Statement.
Depends on
- QMA parallel repetition with a midpoint threshold
- QMA promise class with a verifier effect on witnesses
- A finite verifier induces an effect on its witness
- Finite POVMs and their outcome law
- POVM outcome weights are probabilities
- Tensor products of finitely many linear maps
- Ordered tensor registers, their inner product, and wire permutations
- Chernoff bound for independent bernoulli trials
- The natural logarithm as the inverse of the exponential function
- Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely
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
- John Watrous, Quantum Computational Complexity (standard reference, not scraped)
- Dorit Aharonov and Tomer Naveh, Quantum NP: A Survey (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes (standard reference, not scraped)