Pauli Soundness
ProvedMIPStarRE.QPBT.Palomar.pauli_soundnessqpbt
There exist universal real constants with and such that, for every Pauli parameter package , error , and strategy with value at least , one can extract a Pauli-register witness . Its state error and every raw Alice and Bob Pauli error obey
determines the compact game and fixed field model, is the original strategy, and is the extracted representation. This is the qudit Pauli-basis soundness theorem.
Formalization Credit. This Lean declaration is part of the Quantum Pauli basis test formalization by Ruixuan Deng. The source code was generated by AI agents; Ruixuan Deng is the responsible maintainer.
Mathematical Source. The mathematical source is Ji, Natarajan, Vidick, Wright, and Yuen, MIP*=RE, arXiv:2001.04383v3.
Preamble
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_AxisParallelLine import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_DiagonalLine import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_LinePolynomials import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_LowDegreePolynomial import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_OpFamily import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_ParametersBase import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_ParametersFiniteAnswers import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_QuantumState import Definitions.Def_LIDT_MIPStarRE_LDT_CommutativityPoints_Defs import Definitions.Def_LIDT_MIPStarRE_LDT_ExpansionHypercubeGraph_Defs_Core import Definitions.Def_LIDT_MIPStarRE_LDT_GlobalVariance_Defs_Core import Definitions.Def_LIDT_MIPStarRE_LDT_MakingMeasurementsProjective_Defs import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_Defs_Families import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_Defs_Interpolation import Definitions.Def_LIDT_MIPStarRE_LDT_Tactic_AvgCongr import Definitions.Def_LIDT_MIPStarRE_LDT_Test_StrategyCore import Definitions.Def_QPBT_QPBT_Algebra_FieldBasis import Definitions.Def_QPBT_QPBT_Algebra_LowDegreeCode import Definitions.Def_QPBT_QPBT_Algebra_Pauli import Definitions.Def_QPBT_QPBT_Games_Defs import Definitions.Def_QPBT_QPBT_Palomar_Definitions import Definitions.Def_QPBT_QPBT_Palomar_PauliExtractionBridge import Definitions.Def_QPBT_QPBT_Palomar_PauliGameBridge import Definitions.Def_QPBT_QPBT_Palomar_PauliGameStrategyBridge import Definitions.Def_QPBT_QPBT_State import Definitions.Def_QPBT_QPBT_Test_PauliBasisTest import Definitions.Def_QPBT_QPBT_Test_SoundnessDefs import Mathlib import Mathlib.Algebra.MvPolynomial.Equiv import Mathlib.Analysis.MeanInequalitiesPow import Mathlib.Analysis.SpecialFunctions.Pow.Continuity import Mathlib.Analysis.SpecificLimits.Basic namespace MIPStarRE.QPBT.Palomar end MIPStarRE.QPBT.Palomar /-! # Compact Pauli basis test soundness This module transports the registered qudit and qubit soundness theorems to the compact Palomar game. The statements use the once-and-for-all field model, arbitrary compact strategies, raw prescribed-answer effects, the unsquared state norm, and separate unaveraged Alice and Bob squared operator sums. ## References `references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:1431-1491`, paper `thm:pauli` and `cor:pauli-binary`; `references/qpbt-paper/04_preliminaries.tex:1163-1208`. -/ open MIPStarRE.QPBT.Palomar
Formal statement
theorem MIPStarRE.QPBT.Palomar.pauli_soundness :
∃ a b : ℝ, 1 ≤ a ∧ 0 < b ∧ b < 1 ∧
∀ (P : _root_.MIPStarRE.QPBT.Palomar.PauliParams) (epsilon : ℝ), 0 ≤ epsilon →
∀ S : _root_.MIPStarRE.QPBT.Palomar.PauliStrategy P
(_root_.MIPStarRE.QPBT.fixedFieldModel P.q P.is_admissible_size).K,
1 - epsilon ≤ S.value
(_root_.MIPStarRE.QPBT.Palomar.pauliGame P
(_root_.MIPStarRE.QPBT.binaryRepresentation
(_root_.MIPStarRE.QPBT.fixedFieldModel P.q P.is_admissible_size))
(_root_.MIPStarRE.QPBT.fixedBinTrace
(_root_.MIPStarRE.QPBT.fixedFieldModel P.q P.is_admissible_size))) →
∃ w : _root_.MIPStarRE.QPBT.Palomar.ExtractionWitness
(R := _root_.MIPStarRE.QPBT.Palomar.PauliRegister P
(_root_.MIPStarRE.QPBT.fixedFieldModel P.q P.is_admissible_size).K) S,
_root_.MIPStarRE.QPBT.Palomar.stateError w ≤ _root_.MIPStarRE.QPBT.Palomar.deltaQld a b epsilon P.m P.d P.q ∧
(∀ W : _root_.MIPStarRE.QPBT.Palomar.PauliKind,
_root_.MIPStarRE.QPBT.Palomar.rawPauliAliceError P S w
(_root_.MIPStarRE.QPBT.fixedBinTrace
(_root_.MIPStarRE.QPBT.fixedFieldModel P.q P.is_admissible_size)) W ≤
_root_.MIPStarRE.QPBT.Palomar.deltaQld a b epsilon P.m P.d P.q) ∧
∀ W : _root_.MIPStarRE.QPBT.Palomar.PauliKind,
_root_.MIPStarRE.QPBT.Palomar.rawPauliBobError P S w
(_root_.MIPStarRE.QPBT.fixedBinTrace
(_root_.MIPStarRE.QPBT.fixedFieldModel P.q P.is_admissible_size)) W ≤
_root_.MIPStarRE.QPBT.Palomar.deltaQld a b epsilon P.m P.d P.q := by sorrySource