Theorem F.3, Claim 1 — For every prover strategy P of a theory containing quantum theory against a quantum verifier, the map S induced by (τ0, Π1, …, Πr) is an r-slot q
OpenGPTIP632.Classical.Supplement.claim_F_3_1The source result is:
We define and from by the formula of Definition F.1; these are linear maps between the real spaces and , which by (T1) and Definition D.4(i) are the spaces of Hermitian matrices on the corresponding qubit registers. Claim 1: is a quantum comb.
For every theory G containing quantum theory (Definition D.4), every r, qubit registers M_i, M'i, and every prover strategy (τ0; P0,…,Pr; Π1,…,Πr) of G with Π_i ∈ Chan_G(M_i P{i−1}, M'i P_i): the induced maps S^(j), j = 0,…,r (formula of Definition F.1, S^(0) = 1, S^(r) = S) are completely positive and satisfy (id ⊗ Tr{M'j}) ∘ S^(j) = S^(j−1) ⊗ Tr{M_j} for 1 ≤ j ≤ r. Both conditions of Definition F.1, for every j.
The concrete systems, gates, class definitions and any conclusion predicates are defined by the supplement interfaces. Completeness is at least 2/3 and soundness is at most 1/3, except for the explicitly quantified 0 < s < c < 1 clause of Lemma F.9. Every fixed message bound means at most k messages, counting both directions. No simulation theorem or class equality is assumed.
Differences from the source:
- generalization: theories closed under all sequential and parallel compositions → the published Theory interface requires channel-channel and instrument-instrument closure, without mixed closure axioms; reason: every source theory qualifies; the induced-map and circuit-value assertions use the actual positive unit-preserving maps and do not need mixed allowed-operation closure
- encoding: finite-dimensional systems, composites and quantum channels in fixed bases → real coordinate frames, binary-tree register presentations (including a labelled copy of Delta_3), Kraus gate matrices and complete positivity on every ancilla dimension; reason: these represent the same quantum, classical and transported cones; labels and parentheses carry no operational data
- encoding: the explicitly defined QC, classical and triangular theories are valid theories → existential proofs of PreTheory.Ok package the fixed concrete data into the published Theory type; reason: validity is a conclusion, not an added hypothesis; proof irrelevance makes all such proof witnesses describe exactly the same theory
- encoding: S and each prefix S^(j), with S^(0)=1 and the partial-trace causality equations → actual raw-coordinate prover contractions; CP at every prefix and finite sums against the trace units; reason: the finite coordinate identities are precisely Definition F.1, including the zero-slot identity
- encoding: adaptive quantum or classical circuits in the source gate sets → published VData circuits and interaction probabilities, with zero-based outcome labels and classical copy as a constant-size circuit macro; reason: wire placements, total completion on malformed records, and recording the decision last preserve every physical interaction; copy is implemented using fixed preparation and reversible classical gates
import Mathlib import Definitions.Def_GPTIP632_Classical_Supplement_Claims set_option autoImplicit false
namespace GPTIP632.Classical.Supplement
open QAlgorithms.Complexity KTUnitary.Synth
theorem claim_F_3_1 :
∃ hQ : (qcPre []).Ok,
∀ (G : Theory), G.Standing → ∀ (E : QEmb G) (V : VData (qc0 hQ)),
V.IsVerifier → QubitMsgs V → ∀ x : Str, ∀ P : Prover (E.push V) x,
InducedQuantumComb E (E.push V) x P := by sorry
end GPTIP632.Classical.Supplement