Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma F.9 — In quantum theory with classical systems (optionally with finitely many Δ_d adjoined, standard coordinates and gates), arbitrary messages give no

Open
GPTIP632.Classical.Supplement.lemma_F_9

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

complexity-theoryp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-information

The source result is:

Lemma F.9 (Classical registers as messages in quantum theory). Let QC be quantum theory with classical systems, possibly with finitely many classical systems Δd\Delta_dΔd​ of fixed dimensions adjoined as elementary systems, each with its standard coordinates and with the gates preparation of δ1\delta_1δ1​, readout of the label and discard. Then GIP(QC;k)=QIP(k)\mathsf{GIP}(\mathsf{QC}; k) = \mathsf{QIP}(k)GIP(QC;k)=QIP(k) for every kkk, and GIP(QC)=QIP=PSPACE\mathsf{GIP}(\mathsf{QC}) = \mathsf{QIP} = \mathsf{PSPACE}GIP(QC)=QIP=PSPACE. The fixed-message equality holds with any fixed thresholds 0<s<c<10 < s < c < 10<s<c<1 imposed on both sides; for polynomially many messages these thresholds give the same class PSPACE\mathsf{PSPACE}PSPACE.

For every finite list ds of dimensions d (each ≥ 1) of adjoined classical elementary systems Δ_d (QC_ds; ds = [] is QC itself): GIP(QC_ds; k) = QIP(k) for every k; GIP(QC_ds) = QIP; QIP = PSPACE; and for every pair of real constants 0 < s < c < 1: GIP_{c,s}(QC_ds; k) = QIP_{c,s}(k) for every k and GIP_{c,s}(QC_ds) = PSPACE. Every clause.

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:

  • 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: any finite list of adjoined positive-dimensional classical systems Delta_d → an arbitrary list ds whose entry n denotes Delta_(n+1); reason: offset indexing covers exactly all positive dimensions, including the empty list and dimension one
  • 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
Preamble
import Mathlib
import Definitions.Def_GPTIP632_Classical_Supplement_Claims

set_option autoImplicit false
Formal statement
namespace GPTIP632.Classical.Supplement
open QAlgorithms.Complexity KTUnitary.Synth

theorem lemma_F_9 :
    ∃ hQ : (qcPre []).Ok,
      ∀ ds : List ℕ, ∃ h : (qcPre ds).Ok,
        ((qcPre ds).toTheory h).Standing ∧
        (∀ k : ℕ, GIPk ((qcPre ds).toTheory h) k = QIPk hQ k) ∧
        GIP ((qcPre ds).toTheory h) = QIP hQ ∧ QIP hQ = PromisePSPACE O₀ ∧
        ∀ s c : ℝ, 0 < s → s < c → c < 1 →
          (∀ k : ℕ, GIPgen ((qcPre ds).toTheory h) c s k = QIPgen hQ c s k) ∧
          GIPgen ((qcPre ds).toTheory h) c s ⊤ = PromisePSPACE O₀ := by sorry

end GPTIP632.Classical.Supplement
Source
Kishor Bharti, Beyond IP = PSPACE and QIP = PSPACE: Interactive Proofs in Arbitrary Physical Theories, STOC 2027 submission #632 (October 2026), source.pdf SHA-256 ebbc45027e7a3b48cbfb1a2deb89e9a7d8374373b23763680b948fda16cf4da7, p.31 (PDF p.33), Lemma F.9

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me