QPBT definitions: Games / Sandwich / Support
DefinitionQPBT_QPBT_Games_Sandwich_Supportqpbt
This bundle collects three elementary interfaces used in the Pauli calculations. It rewrites a product distribution as iterated averaging, preserves projectivity under outcome coarsening, and identifies the effect behavior of an injective relabeling.
Principal definitions:
MIPStarRE.QPBT.SandwichProduct.avgOver_distribution_prod: rewrites averaging over a product of finite distributions as iterated averaging.MIPStarRE.QPBT.SandwichProduct.postprocess_isProjective: states that coarsening the outcomes of a projective measurement preserves projectivity.MIPStarRE.QPBT.SandwichProduct.postprocess_effect_of_injective: states that an injective relabeling does not merge the effect at a relabeled outcome.
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/Games/Sandwich/Support.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_Distribution
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_LIDT_MIPStarRE_Quantum_FiniteMatrix_Basic
import Definitions.Def_LIDT_MIPStarRE_Quantum_Measurement
import Definitions.Def_QPBT_QPBT_Games_Defs
import Definitions.Def_QPBT_QPBT_Games_DistanceTheorems_Support
import Definitions.Def_QPBT_QPBT_Games_DistributionAux
namespace LIDT.MIPStarRE.LDT
end LIDT.MIPStarRE.LDT
namespace LIDT.MIPStarRE.Quantum
end LIDT.MIPStarRE.Quantum
namespace MIPStarRE.QPBT
end MIPStarRE.QPBT
namespace MIPStarRE.QPBT.DistanceCalculus
end MIPStarRE.QPBT.DistanceCalculus
namespace MIPStarRE.QPBT.SandwichProduct
end MIPStarRE.QPBT.SandwichProduct
/-! # Quantitative support for sandwiched measurements
This module develops the consistency and operator-distance estimates used
in the quantitative sandwich argument.
## References
Blueprint `lem:ld-sandwich` and `lem:ld-sandwich-measurement`; paper
`references/qpbt-paper/06_nonlocal_games_and_mipstar.tex:465-501`.
-/
@[expose] public section
open scoped BigOperators MatrixOrder Matrix ComplexOrder
namespace MIPStarRE.QPBT
open LIDT.MIPStarRE.LDT hiding Measurement
open LIDT.MIPStarRE.Quantum
open DistanceCalculus
namespace SandwichProduct
/-- Averaging over the product of two finite distributions is iterated
averaging. This is the formalization-only identity
`lem:sandwich-product-average` used in the proof of `lem:ld-sandwich`; detailed
source argument `references/neexp-paper/05_quantum_preliminaries.tex:952-994`. -/
theorem avgOver_distribution_prod {X Y : Type*}
[DecidableEq X] [DecidableEq Y] (μ : _root_.LIDT.MIPStarRE.LDT.Distribution X) (ν : _root_.LIDT.MIPStarRE.LDT.Distribution Y)
(f : X × Y → ℝ) :
_root_.LIDT.MIPStarRE.LDT.avgOver (_root_.MIPStarRE.QPBT.Distribution.prod μ ν) f =
_root_.LIDT.MIPStarRE.LDT.avgOver μ (fun x => _root_.LIDT.MIPStarRE.LDT.avgOver ν (fun y => f (x, y))) := by
unfold _root_.LIDT.MIPStarRE.LDT.avgOver
change (∑ p ∈ μ.support.product ν.support,
(μ.weight p.1 * ν.weight p.2) * f p) = _
calc
(∑ p ∈ μ.support.product ν.support,
(μ.weight p.1 * ν.weight p.2) * f p) =
∑ x ∈ μ.support, ∑ y ∈ ν.support,
(μ.weight x * ν.weight y) * f (x, y) := by
exact Finset.sum_product' μ.support ν.support
(fun x y => (μ.weight x * ν.weight y) * f (x, y))
_ = _ := by
apply Finset.sum_congr rfl
intro x _
rw [Finset.mul_sum]
apply Finset.sum_congr rfl
intro y _
ring
/-- Coarsening the outcomes of a projective measurement preserves
projectivity. This is the formalization-only fact
`lem:sandwich-postprocess-projective` used in the palindromic construction of
`lem:ld-sandwich`; detailed source argument
`references/neexp-paper/05_quantum_preliminaries.tex:930-946`. -/
theorem postprocess_isProjective {α β ι : Type*}
[Fintype α] [DecidableEq α] [Fintype β] [DecidableEq β]
[Fintype ι] [DecidableEq ι]
(M : _root_.LIDT.MIPStarRE.Quantum.Measurement α ι) (hM : _root_.MIPStarRE.QPBT.Measurement.IsProjective M)
(f : α → β) : _root_.MIPStarRE.QPBT.Measurement.IsProjective (M.postprocess f) := by
classical
intro b
refine { isIdempotentElem := ?_, isSelfAdjoint := ?_ }
· change (M.postprocess f).effect b * (M.postprocess f).effect b =
(M.postprocess f).effect b
simp only [_root_.LIDT.MIPStarRE.Quantum.Measurement.postprocess_effect]
rw [Finset.sum_mul]
simp_rw [Finset.mul_sum]
calc
(∑ a ∈ Finset.univ.filter (fun a => f a = b),
∑ a' ∈ Finset.univ.filter (fun a' => f a' = b),
M.effect a * M.effect a') =
∑ a ∈ Finset.univ.filter (fun a => f a = b),
∑ a' ∈ Finset.univ.filter (fun a' => f a' = b),
if a' = a then M.effect a else 0 := by
apply Finset.sum_congr rfl
intro a _
apply Finset.sum_congr rfl
intro a' _
by_cases haa' : a' = a
· subst a'
simp [(hM a).isIdempotentElem.eq]
· rw [if_neg haa']
exact _root_.MIPStarRE.QPBT.DistanceCalculus.projective_effect_mul_effect_eq_zero
M hM (Ne.symm haa')
_ = ∑ a ∈ Finset.univ.filter (fun a => f a = b), M.effect a := by
apply Finset.sum_congr rfl
intro a ha
simp [ha]
· change ((M.postprocess f).effect b)ᴴ = (M.postprocess f).effect b
exact
(Matrix.nonneg_iff_posSemidef.mp ((M.postprocess f).pos b)).isHermitian.eq
/-- An injective relabeling does not merge the effect at a relabeled
outcome. This is the formalization-only identity
`lem:sandwich-injective-postprocess` used to identify product outcomes in
`lem:ld-sandwich`; detailed source argument
`references/neexp-paper/05_quantum_preliminaries.tex:930-946`. -/
theorem postprocess_effect_of_injective {α β ι : Type*}
[Fintype α] [DecidableEq α] [Fintype β] [DecidableEq β]
[Fintype ι] [DecidableEq ι]
(M : _root_.LIDT.MIPStarRE.Quantum.Measurement α ι) (f : α → β) (hf : Function.Injective f) (a : α) :
(M.postprocess f).effect (f a) = M.effect a := by
simp only [_root_.LIDT.MIPStarRE.Quantum.Measurement.postprocess_effect, Finset.sum_filter]
rw [Fintype.sum_eq_single a]
· simp
· intro z hza
rw [if_neg]
exact fun h => hza (hf h)
end SandwichProduct
end MIPStarRE.QPBT
Source