QPBT definitions: Palomar / PauliGameStrategyBridge
DefinitionQPBT_QPBT_Palomar_PauliGameStrategyBridgeqpbt
This bundle bridges compact symmetric Pauli games and the registered strategy interface. It relabels questions and answers, transports strategies and PMFs along equivalences, and records preservation of the symmetric game presentation and corresponding masses.
Principal definitions:
MIPStarRE.QPBT.Palomar.compactPauliQuestionDecidableEq: defines decidable equality for compact Pauli questions.MIPStarRE.QPBT.Palomar.SymmetricGame.relabel: relabels the questions and answers of a compact symmetric game.MIPStarRE.QPBT.Palomar.SymmetricStrategy.relabel: relabels the questions and outcomes of a compact symmetric strategy.MIPStarRE.QPBT.Palomar.pauliStrategyToLibrary: converts a compact Pauli strategy into a strategy for the registered game.MIPStarRE.QPBT.Palomar.pauliSymmetricGame: states that the compact Pauli game has the exact symmetric presentation transported from the source data.MIPStarRE.QPBT.Palomar.pauliSymmetricStrategyToLibrary: converts a compact symmetric Pauli strategy into a registered symmetric strategy.MIPStarRE.QPBT.Palomar.PMF.map_equiv_apply: states that pushing a PMF through an equivalence preserves mass at corresponding points.MIPStarRE.QPBT.Palomar.PMF.map_equiv_apply': states that a PMF pushed through an equivalence is evaluated by pulling the point back.
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.
Definition code
-- Generated from QPBT/Palomar/PauliGameStrategyBridge.lean by skeleton subtraction.
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_Games_Defs
import Definitions.Def_QPBT_QPBT_Games_StrategyClasses
import Definitions.Def_QPBT_QPBT_Palomar_Bridge
import Definitions.Def_QPBT_QPBT_Palomar_Definitions
import Definitions.Def_QPBT_QPBT_Palomar_LowDegreeGameStrategyBridge
import Definitions.Def_QPBT_QPBT_Palomar_PauliGameBridge
import Definitions.Def_QPBT_QPBT_Test_Completeness
import Definitions.Def_QPBT_QPBT_Test_PauliBasisTest
import Mathlib
namespace MIPStarRE.QPBT.Palomar
end MIPStarRE.QPBT.Palomar
namespace MIPStarRE.QPBT.Palomar.Game
end MIPStarRE.QPBT.Palomar.Game
namespace MIPStarRE.QPBT.Palomar.PMF
end MIPStarRE.QPBT.Palomar.PMF
namespace MIPStarRE.QPBT.Palomar.POVM
end MIPStarRE.QPBT.Palomar.POVM
namespace MIPStarRE.QPBT.Palomar.SymmetricGame
end MIPStarRE.QPBT.Palomar.SymmetricGame
namespace MIPStarRE.QPBT.Palomar.SymmetricStrategy
end MIPStarRE.QPBT.Palomar.SymmetricStrategy
/-!
# Strategy bridge for the compact Pauli basis game
This module transports compact strategies across the exact question and answer
equivalences of `PauliGameBridge`. It preserves the game, Born value,
projectivity, symmetry, consistency, positive-support commutation, and the SPCC
predicate exactly.
## References
`references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:1126-1491`.
-/
@[expose] public section
namespace MIPStarRE.QPBT.Palomar
noncomputable section
local instance compactPauliQuestionDecidableEq
(P : _root_.MIPStarRE.QPBT.AdmissibleParams) :
DecidableEq
(_root_.MIPStarRE.QPBT.Palomar.PauliQuestion (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P) (_root_.MIPStarRE.QPBT.PauliScalar P)) :=
_root_.MIPStarRE.QPBT.Palomar.instDecidableEqPauliQuestion
namespace PMF
/-- Pushing a PMF through an equivalence preserves its mass at corresponding points. -/
@[simp] theorem map_equiv_apply {X Y : Type*} (p : PMF X) (e : X ≃ Y) (x : X) :
(p.map e) (e x) = p x := by
classical
simp [PMF.map_apply, e.injective.eq_iff]
/-- A PMF pushed through an equivalence is evaluated by pulling the point back. -/
theorem map_equiv_apply' {X Y : Type*} (p : PMF X) (e : X ≃ Y) (y : Y) :
(p.map e) y = p (e.symm y) := by
simpa only [e.apply_symm_apply] using _root_.MIPStarRE.QPBT.Palomar.PMF.map_equiv_apply p e (e.symm y)
end PMF
namespace Game
/-- Relabeling a compact game and then relabeling by the inverse equivalences is exact. -/
theorem relabel_symm_relabel {X Y A B X' Y' A' B' : Type}
[Fintype X] [Fintype Y] [Fintype A] [Fintype B]
[Fintype X'] [Fintype Y'] [Fintype A'] [Fintype B']
[DecidableEq X] [DecidableEq Y] [DecidableEq A] [DecidableEq B]
[DecidableEq X'] [DecidableEq Y'] [DecidableEq A'] [DecidableEq B']
(G : _root_.MIPStarRE.QPBT.Palomar.Game X Y A B) (eX : X ≃ X') (eY : Y ≃ Y')
(eA : A ≃ A') (eB : B ≃ B') :
_root_.MIPStarRE.QPBT.Palomar.Game.relabel (_root_.MIPStarRE.QPBT.Palomar.Game.relabel G eX eY eA eB)
eX.symm eY.symm eA.symm eB.symm = G := by
apply _root_.MIPStarRE.QPBT.Palomar.Game.ext
· ext xy
change ((G.μ.map (Equiv.prodCongr eX eY)).map
(Equiv.prodCongr eX.symm eY.symm)) xy = G.μ xy
rw [_root_.MIPStarRE.QPBT.Palomar.PMF.map_equiv_apply']
change (G.μ.map (Equiv.prodCongr eX eY))
((Equiv.prodCongr eX eY) xy) = G.μ xy
exact _root_.MIPStarRE.QPBT.Palomar.PMF.map_equiv_apply G.μ (Equiv.prodCongr eX eY) xy
· funext x y a b
simp [_root_.MIPStarRE.QPBT.Palomar.Game.relabel]
end Game
namespace SymmetricGame
/-- Relabel the questions and answers of a compact symmetric game. -/
def relabel {X A X' A' : Type}
[Fintype X] [Fintype A] [Fintype X'] [Fintype A']
[DecidableEq X] [DecidableEq A] [DecidableEq X'] [DecidableEq A']
(G : _root_.MIPStarRE.QPBT.Palomar.SymmetricGame X A) (eX : X ≃ X') (eA : A ≃ A') :
_root_.MIPStarRE.QPBT.Palomar.SymmetricGame X' A' where
toGame := _root_.MIPStarRE.QPBT.Palomar.Game.relabel G.toGame eX eX eA eA
μ_symm := by
intro x y
change (G.μ.map (Equiv.prodCongr eX eX)) (x, y) =
(G.μ.map (Equiv.prodCongr eX eX)) (y, x)
rw [_root_.MIPStarRE.QPBT.Palomar.PMF.map_equiv_apply', _root_.MIPStarRE.QPBT.Palomar.PMF.map_equiv_apply']
exact G.μ_symm (eX.symm x) (eX.symm y)
decide_symm := by
intro x y a b
exact G.decide_symm (eX.symm x) (eX.symm y) (eA.symm a) (eA.symm b)
end SymmetricGame
namespace SymmetricStrategy
/-- Relabel the questions and outcomes of a compact symmetric strategy. -/
def relabel {X A X' A' : Type}
[Fintype X] [Fintype A] [Fintype X'] [Fintype A']
(S : _root_.MIPStarRE.QPBT.Palomar.SymmetricStrategy X A) (eX : X ≃ X') (eA : A ≃ A') :
_root_.MIPStarRE.QPBT.Palomar.SymmetricStrategy X' A' where
ι := S.ι
ψ := S.ψ
ψ_norm := S.ψ_norm
ψ_swap := S.ψ_swap
meas := fun x => _root_.MIPStarRE.QPBT.Palomar.POVM.relabel eA (S.meas (eX.symm x))
/-- Symmetric relabeling agrees with relabeling the underlying general strategy. -/
@[simp] theorem relabel_toStrategy {X A X' A' : Type}
[Fintype X] [Fintype A] [Fintype X'] [Fintype A']
(S : _root_.MIPStarRE.QPBT.Palomar.SymmetricStrategy X A) (eX : X ≃ X') (eA : A ≃ A') :
(_root_.MIPStarRE.QPBT.Palomar.SymmetricStrategy.relabel S eX eA).toStrategy =
_root_.MIPStarRE.QPBT.Palomar.Strategy.relabel S.toStrategy eX eX eA eA :=
rfl
end SymmetricStrategy
/-- Relabeling the concrete compact Pauli game gives the registered game exactly. -/
theorem pauliGame_relabel_eq (P : _root_.MIPStarRE.QPBT.AdmissibleParams) :
_root_.MIPStarRE.QPBT.Palomar.Game.relabel
(_root_.MIPStarRE.QPBT.Palomar.pauliGame (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P)
(_root_.MIPStarRE.QPBT.binaryRepresentation P.model)
(_root_.MIPStarRE.QPBT.fixedBinTrace P.model))
(_root_.MIPStarRE.QPBT.Palomar.pauliQuestionEquiv P) (_root_.MIPStarRE.QPBT.Palomar.pauliQuestionEquiv P)
(_root_.MIPStarRE.QPBT.Palomar.pauliAnswerEquivCompact P) (_root_.MIPStarRE.QPBT.Palomar.pauliAnswerEquivCompact P) =
_root_.MIPStarRE.QPBT.Palomar.Game.ofGame (_root_.MIPStarRE.QPBT.pauliBasisTest P) := by
apply _root_.MIPStarRE.QPBT.Palomar.Game.ext
· exact _root_.MIPStarRE.QPBT.Palomar.pauliQuestionPMF_map P
· funext x y a b
change _root_.MIPStarRE.QPBT.Palomar.pauliWin (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P)
(_root_.MIPStarRE.QPBT.binaryRepresentation P.model)
(_root_.MIPStarRE.QPBT.fixedBinTrace P.model)
((_root_.MIPStarRE.QPBT.Palomar.pauliQuestionEquiv P).symm x) ((_root_.MIPStarRE.QPBT.Palomar.pauliQuestionEquiv P).symm y)
((_root_.MIPStarRE.QPBT.Palomar.pauliAnswerEquivCompact P).symm a) ((_root_.MIPStarRE.QPBT.Palomar.pauliAnswerEquivCompact P).symm b) =
_root_.MIPStarRE.QPBT.pauliWinPredicate P x y a b
simpa using _root_.MIPStarRE.QPBT.Palomar.pauliWin_equiv P
((_root_.MIPStarRE.QPBT.Palomar.pauliQuestionEquiv P).symm x) ((_root_.MIPStarRE.QPBT.Palomar.pauliQuestionEquiv P).symm y)
((_root_.MIPStarRE.QPBT.Palomar.pauliAnswerEquivCompact P).symm a) ((_root_.MIPStarRE.QPBT.Palomar.pauliAnswerEquivCompact P).symm b)
/-- Convert a compact Pauli strategy into a strategy for the registered game. -/
def pauliStrategyToLibrary (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
(S : _root_.MIPStarRE.QPBT.Palomar.Strategy
(_root_.MIPStarRE.QPBT.Palomar.PauliQuestion (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P) (_root_.MIPStarRE.QPBT.PauliScalar P))
(_root_.MIPStarRE.QPBT.Palomar.PauliQuestion (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P) (_root_.MIPStarRE.QPBT.PauliScalar P))
(_root_.MIPStarRE.QPBT.Palomar.PauliAnswer (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P) (_root_.MIPStarRE.QPBT.PauliScalar P))
(_root_.MIPStarRE.QPBT.Palomar.PauliAnswer (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P) (_root_.MIPStarRE.QPBT.PauliScalar P))) :
_root_.MIPStarRE.QPBT.Strategy (_root_.MIPStarRE.QPBT.pauliBasisTest P) :=
_root_.MIPStarRE.QPBT.Palomar.Strategy.toStrategy (G := _root_.MIPStarRE.QPBT.pauliBasisTest P)
(_root_.MIPStarRE.QPBT.Palomar.Strategy.relabel S
(_root_.MIPStarRE.QPBT.Palomar.pauliQuestionEquiv P) (_root_.MIPStarRE.QPBT.Palomar.pauliQuestionEquiv P)
(_root_.MIPStarRE.QPBT.Palomar.pauliAnswerEquivCompact P) (_root_.MIPStarRE.QPBT.Palomar.pauliAnswerEquivCompact P))
/-- The compact Pauli game has the exact symmetric presentation transported from the source. -/
noncomputable def pauliSymmetricGame (P : _root_.MIPStarRE.QPBT.AdmissibleParams) :
_root_.MIPStarRE.QPBT.Palomar.SymmetricGame
(_root_.MIPStarRE.QPBT.Palomar.PauliQuestion (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P) (_root_.MIPStarRE.QPBT.PauliScalar P))
(_root_.MIPStarRE.QPBT.Palomar.PauliAnswer (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P) (_root_.MIPStarRE.QPBT.PauliScalar P)) :=
_root_.MIPStarRE.QPBT.Palomar.SymmetricGame.relabel
(_root_.MIPStarRE.QPBT.Palomar.SymmetricGame.ofSymmetricGame (_root_.MIPStarRE.QPBT.pauliBasisTestSymm P))
(_root_.MIPStarRE.QPBT.Palomar.pauliQuestionEquiv P).symm (_root_.MIPStarRE.QPBT.Palomar.pauliAnswerEquivCompact P).symm
/-- The symmetric compact presentation has the compact Pauli game as its underlying game. -/
@[simp] theorem pauliSymmetricGame_toGame (P : _root_.MIPStarRE.QPBT.AdmissibleParams) :
(_root_.MIPStarRE.QPBT.Palomar.pauliSymmetricGame P).toGame =
_root_.MIPStarRE.QPBT.Palomar.pauliGame (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P)
(_root_.MIPStarRE.QPBT.binaryRepresentation P.model)
(_root_.MIPStarRE.QPBT.fixedBinTrace P.model) := by
calc
(_root_.MIPStarRE.QPBT.Palomar.pauliSymmetricGame P).toGame =
_root_.MIPStarRE.QPBT.Palomar.Game.relabel (_root_.MIPStarRE.QPBT.Palomar.Game.ofGame (_root_.MIPStarRE.QPBT.pauliBasisTest P))
(_root_.MIPStarRE.QPBT.Palomar.pauliQuestionEquiv P).symm (_root_.MIPStarRE.QPBT.Palomar.pauliQuestionEquiv P).symm
(_root_.MIPStarRE.QPBT.Palomar.pauliAnswerEquivCompact P).symm (_root_.MIPStarRE.QPBT.Palomar.pauliAnswerEquivCompact P).symm := rfl
_ = _root_.MIPStarRE.QPBT.Palomar.Game.relabel (_root_.MIPStarRE.QPBT.Palomar.Game.relabel
(_root_.MIPStarRE.QPBT.Palomar.pauliGame (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P)
(_root_.MIPStarRE.QPBT.binaryRepresentation P.model)
(_root_.MIPStarRE.QPBT.fixedBinTrace P.model))
(_root_.MIPStarRE.QPBT.Palomar.pauliQuestionEquiv P) (_root_.MIPStarRE.QPBT.Palomar.pauliQuestionEquiv P)
(_root_.MIPStarRE.QPBT.Palomar.pauliAnswerEquivCompact P) (_root_.MIPStarRE.QPBT.Palomar.pauliAnswerEquivCompact P))
(_root_.MIPStarRE.QPBT.Palomar.pauliQuestionEquiv P).symm (_root_.MIPStarRE.QPBT.Palomar.pauliQuestionEquiv P).symm
(_root_.MIPStarRE.QPBT.Palomar.pauliAnswerEquivCompact P).symm
(_root_.MIPStarRE.QPBT.Palomar.pauliAnswerEquivCompact P).symm := by
rw [_root_.MIPStarRE.QPBT.Palomar.pauliGame_relabel_eq]
_ = _root_.MIPStarRE.QPBT.Palomar.pauliGame (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P)
(_root_.MIPStarRE.QPBT.binaryRepresentation P.model)
(_root_.MIPStarRE.QPBT.fixedBinTrace P.model) :=
_root_.MIPStarRE.QPBT.Palomar.Game.relabel_symm_relabel _ _ _ _ _
/-- Convert a compact symmetric Pauli strategy into a registered symmetric strategy. -/
def pauliSymmetricStrategyToLibrary (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
(S : _root_.MIPStarRE.QPBT.Palomar.SymmetricStrategy
(_root_.MIPStarRE.QPBT.Palomar.PauliQuestion (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P) (_root_.MIPStarRE.QPBT.PauliScalar P))
(_root_.MIPStarRE.QPBT.Palomar.PauliAnswer (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P) (_root_.MIPStarRE.QPBT.PauliScalar P))) :
_root_.MIPStarRE.QPBT.SymmetricStrategy (_root_.MIPStarRE.QPBT.pauliBasisTestSymm P) :=
_root_.MIPStarRE.QPBT.Palomar.SymmetricStrategy.toSymmetricStrategy
(_root_.MIPStarRE.QPBT.Palomar.SymmetricStrategy.relabel S (_root_.MIPStarRE.QPBT.Palomar.pauliQuestionEquiv P) (_root_.MIPStarRE.QPBT.Palomar.pauliAnswerEquivCompact P))
/-- Symmetric conversion is exactly the relabeled compact symmetric strategy. -/
@[simp] theorem of_pauliSymmetricStrategyToLibrary
(P : _root_.MIPStarRE.QPBT.AdmissibleParams)
(S : _root_.MIPStarRE.QPBT.Palomar.SymmetricStrategy
(_root_.MIPStarRE.QPBT.Palomar.PauliQuestion (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P) (_root_.MIPStarRE.QPBT.PauliScalar P))
(_root_.MIPStarRE.QPBT.Palomar.PauliAnswer (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P) (_root_.MIPStarRE.QPBT.PauliScalar P))) :
_root_.MIPStarRE.QPBT.Palomar.SymmetricStrategy.ofSymmetricStrategy (_root_.MIPStarRE.QPBT.Palomar.pauliSymmetricStrategyToLibrary P S) =
_root_.MIPStarRE.QPBT.Palomar.SymmetricStrategy.relabel S (_root_.MIPStarRE.QPBT.Palomar.pauliQuestionEquiv P)
(_root_.MIPStarRE.QPBT.Palomar.pauliAnswerEquivCompact P) := by
simp [_root_.MIPStarRE.QPBT.Palomar.pauliSymmetricStrategyToLibrary]
rfl
end
end MIPStarRE.QPBT.Palomar
Source