QPBT definitions: Test / Completeness / HonestStrategy / MeasurementFamily
DefinitionQPBT_QPBT_Test_Completeness_HonestStrategy_MeasurementFamilyqpbt
This bundle defines the honest measurement families for the Pauli basis test. It includes harmless and deterministic measurements, the local Hilbert-space index, embeddings of Pauli and Magic Square outcomes, and the honest point, axis-line, and diagonal-line measurements.
Principal definitions:
MIPStarRE.QPBT.unitMeasurement: defines the one-outcome measurement used on harmless branches.MIPStarRE.QPBT.deterministicMeasurement: defines a deterministic measurement with a prescribed outcome.MIPStarRE.QPBT.HonestIndex: defines the local Hilbert-space index for the honest Pauli strategy.MIPStarRE.QPBT.placedPauliMeasurement: places a Pauli-register measurement on the first local factor and embeds its outcomes globally.MIPStarRE.QPBT.pauliAnswerOfMs: embeds a Magic Square answer into the global Pauli-test answer alphabet.MIPStarRE.QPBT.honestPointMeasurement: defines the honest point measurement at a typed Pauli question.MIPStarRE.QPBT.honestALineMeasurement: defines the honest axis-line measurement at a typed Pauli question.MIPStarRE.QPBT.honestDLineMeasurement: defines the honest diagonal-line measurement at a typed Pauli question.
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/Test/Completeness/HonestStrategy/MeasurementFamily.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_LIDT_MIPStarRE_Quantum_FiniteMatrix_Basic
import Definitions.Def_LIDT_MIPStarRE_Quantum_FiniteMatrix_NormalizedTrace
import Definitions.Def_LIDT_MIPStarRE_Quantum_Measurement
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_Games_DistanceTheorems_TensorSupport
import Definitions.Def_QPBT_QPBT_Games_Sandwich_Support
import Definitions.Def_QPBT_QPBT_Observables_LineDefs
import Definitions.Def_QPBT_QPBT_Observables_LineMeasurement_Restriction
import Definitions.Def_QPBT_QPBT_Test_Completeness_HonestStrategy
import Definitions.Def_QPBT_QPBT_Test_LowDegreeGame
import Definitions.Def_QPBT_QPBT_Test_MagicSquare
import Definitions.Def_QPBT_QPBT_Test_MagicSquareTheorems_PerfectStrategy_Measurements
import Definitions.Def_QPBT_QPBT_Test_PauliBasisTest
import Mathlib
import Theorems.Thm_LIDT_MIPStarRE_LDT_MakingMeasurementsProjective_isProj_kronecker
namespace LIDT.MIPStarRE.LDT
end LIDT.MIPStarRE.LDT
namespace LIDT.MIPStarRE.Quantum
end LIDT.MIPStarRE.Quantum
namespace MIPStarRE.QPBT
end MIPStarRE.QPBT
/-!
# The honest Pauli measurement family
This module collects the measurements of
`MIPStarRE.QPBT.Test.Completeness.HonestStrategy` into a single measurement
family indexed by the question type of the Pauli basis test. Each honest
measurement acts on the tensor product of the Pauli register with the qubit
supplied to the Magic Square construction, and every outcome is relabelled into
the common answer alphabet of the test. The results recorded here are the
projectivity and the symmetry of every effect of that family.
## References
The measurement family described here is the one displayed in the proof of
`lem:pauli-completeness`,
`references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:1237-1360`;
blueprint `lem:pauli-completeness`.
-/
@[expose] public section
open scoped BigOperators Matrix MatrixOrder ComplexOrder
namespace MIPStarRE.QPBT
open LIDT.MIPStarRE.LDT hiding Measurement
open LIDT.MIPStarRE.Quantum
noncomputable section
/-! ### Tensor placement and relabeling -/
/-- The one-outcome measurement, used to make the harmless branches of the
honest strategy total on questions outside the sampler support. -/
noncomputable def unitMeasurement (V : Type*) [Fintype V] [DecidableEq V] :
_root_.LIDT.MIPStarRE.Quantum.Measurement Unit V :=
_root_.LIDT.MIPStarRE.Quantum.Measurement.ofSumEqOne (fun _ => 1)
(fun _ => Matrix.PosSemidef.one.nonneg) (by simp)
/-- A deterministic measurement with prescribed outcome. -/
noncomputable def deterministicMeasurement {α V : Type*}
[Fintype α] [DecidableEq α] [Fintype V] [DecidableEq V]
(a : α) : _root_.LIDT.MIPStarRE.Quantum.Measurement α V :=
(_root_.MIPStarRE.QPBT.unitMeasurement V).postprocess fun _ => a
/-- A deterministic measurement is projective. -/
theorem deterministicMeasurement_projective {α V : Type*}
[Fintype α] [DecidableEq α] [Fintype V] [DecidableEq V]
(a : α) :
_root_.MIPStarRE.QPBT.Measurement.IsProjective
(_root_.MIPStarRE.QPBT.deterministicMeasurement (V := V) a) := by
apply _root_.MIPStarRE.QPBT.SandwichProduct.postprocess_isProjective
intro u
cases u
exact IsStarProjection.one _
/-- Every effect of a deterministic measurement is symmetric. -/
theorem deterministicMeasurement_effect_transpose {α V : Type*}
[Fintype α] [DecidableEq α] [Fintype V] [DecidableEq V]
(a b : α) :
((_root_.MIPStarRE.QPBT.deterministicMeasurement (V := V) a).effect b)ᵀ =
(_root_.MIPStarRE.QPBT.deterministicMeasurement (V := V) a).effect b := by
apply _root_.MIPStarRE.QPBT.postprocess_effect_transpose
intro u
cases u
exact Matrix.transpose_one
/-- Tensor placement on the first factor preserves symmetry of effects. -/
theorem leftPlacedMeasurement_effect_transpose {α V W : Type*}
[Fintype α] [Fintype V] [DecidableEq V] [Fintype W] [DecidableEq W]
(M : _root_.LIDT.MIPStarRE.Quantum.Measurement α V) (hM : ∀ a, (M.effect a)ᵀ = M.effect a) (a : α) :
((_root_.MIPStarRE.QPBT.DistanceCalculus.leftPlacedMeasurement (ιB := W) M).effect a)ᵀ =
(_root_.MIPStarRE.QPBT.DistanceCalculus.leftPlacedMeasurement (ιB := W) M).effect a := by
change (_root_.MIPStarRE.QPBT.heteroKron (M.effect a) (1 : _root_.LIDT.MIPStarRE.Quantum.Op W))ᵀ =
_root_.MIPStarRE.QPBT.heteroKron (M.effect a) (1 : _root_.LIDT.MIPStarRE.Quantum.Op W)
ext ⟨i, k⟩ ⟨j, l⟩
simp only [Matrix.transpose_apply, _root_.MIPStarRE.QPBT.heteroKron, Matrix.kronecker,
Matrix.kroneckerMap_apply]
rw [show M.effect a j i = M.effect a i j by
exact congrFun (congrFun (hM a) i) j]
by_cases hkl : k = l
· subst l
simp
· simp [hkl, Ne.symm hkl]
/-- The local Hilbert-space index used by the honest Pauli strategy. The
second factor is the qubit supplied to the Magic Square construction. -/
abbrev HonestIndex (P : _root_.MIPStarRE.QPBT.AdmissibleParams) := _root_.MIPStarRE.QPBT.PauliRegister P × ZMod 2
/-- Place a Pauli-register measurement on the first factor of the honest local
space and relabel its outcomes with a global answer embedding. -/
noncomputable def placedPauliMeasurement {P : _root_.MIPStarRE.QPBT.AdmissibleParams}
{α : Type*} [Fintype α] [DecidableEq α]
(M : _root_.LIDT.MIPStarRE.Quantum.Measurement α (_root_.MIPStarRE.QPBT.PauliRegister P)) (f : α → _root_.MIPStarRE.QPBT.PauliAnswer P) :
_root_.LIDT.MIPStarRE.Quantum.Measurement (_root_.MIPStarRE.QPBT.PauliAnswer P) (_root_.MIPStarRE.QPBT.HonestIndex P) :=
(_root_.MIPStarRE.QPBT.DistanceCalculus.leftPlacedMeasurement (ιB := ZMod 2) M).postprocess f
/-! ### The total honest measurement family -/
/-- Embed a Magic Square answer into the global Pauli-test answer alphabet. -/
def pauliAnswerOfMs {P : _root_.MIPStarRE.QPBT.AdmissibleParams} : _root_.MIPStarRE.QPBT.MsAnswer → _root_.MIPStarRE.QPBT.PauliAnswer P
| .triple a => .msTriple a
| .bit a => .bit a
/-- The honest point measurement at a typed Pauli question. -/
noncomputable def honestPointMeasurement (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (W : _root_.MIPStarRE.QPBT.PauliKind)
(z : _root_.MIPStarRE.QPBT.PauliSpace P) : _root_.LIDT.MIPStarRE.Quantum.Measurement (_root_.MIPStarRE.QPBT.PauliAnswer P) (_root_.MIPStarRE.QPBT.HonestIndex P) :=
_root_.MIPStarRE.QPBT.placedPauliMeasurement (_root_.MIPStarRE.QPBT.pauliPointMeasurement P W (_root_.MIPStarRE.QPBT.pauliPointBlock W z))
(fun a => .value a)
/-- The honest axis-line measurement at a typed Pauli question. -/
noncomputable def honestALineMeasurement (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (W : _root_.MIPStarRE.QPBT.PauliKind)
(z : _root_.MIPStarRE.QPBT.PauliSpace P) : _root_.LIDT.MIPStarRE.Quantum.Measurement (_root_.MIPStarRE.QPBT.PauliAnswer P) (_root_.MIPStarRE.QPBT.HonestIndex P) :=
_root_.MIPStarRE.QPBT.placedPauliMeasurement (_root_.MIPStarRE.QPBT.pauliALineMeasurement P W z) (fun a => .alinePoly a)
/-- The honest diagonal-line measurement at a typed Pauli question. -/
noncomputable def honestDLineMeasurement (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (W : _root_.MIPStarRE.QPBT.PauliKind)
(z : _root_.MIPStarRE.QPBT.PauliSpace P) : _root_.LIDT.MIPStarRE.Quantum.Measurement (_root_.MIPStarRE.QPBT.PauliAnswer P) (_root_.MIPStarRE.QPBT.HonestIndex P) :=
_root_.MIPStarRE.QPBT.placedPauliMeasurement (_root_.MIPStarRE.QPBT.pauliDLineMeasurement P W z) (fun a => .dlinePoly a)
/-- The honest Pauli/W measurement at a typed Pauli question. -/
noncomputable def honestPauliMeasurement (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (W : _root_.MIPStarRE.QPBT.PauliKind) :
_root_.LIDT.MIPStarRE.Quantum.Measurement (_root_.MIPStarRE.QPBT.PauliAnswer P) (_root_.MIPStarRE.QPBT.HonestIndex P) :=
_root_.MIPStarRE.QPBT.placedPauliMeasurement (_root_.MIPStarRE.QPBT.pauliBasisMeasurement W) (fun a => .pauliOutcome a)
/-- The honest Pair/W measurement at a typed Pauli question. The trace
measurement is retained when the phase is nonzero, whereas the proof of
`lem:pauli-completeness` chooses a trivial measurement in that inactive case.
The corresponding Pair checks then accept automatically. The present choice
remains projective, consistent, and commuting along the question graph, so it
gives the same existential completeness conclusion. -/
noncomputable def honestPairWMeasurement (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (W : _root_.MIPStarRE.QPBT.PauliKind)
(z : _root_.MIPStarRE.QPBT.PauliSpace P) : _root_.LIDT.MIPStarRE.Quantum.Measurement (_root_.MIPStarRE.QPBT.PauliAnswer P) (_root_.MIPStarRE.QPBT.HonestIndex P) :=
_root_.MIPStarRE.QPBT.placedPauliMeasurement
(_root_.MIPStarRE.QPBT.pauliTraceMeasurement P W
(_root_.MIPStarRE.QPBT.pauliPointBlock W z)
(match W with | .X => _root_.MIPStarRE.QPBT.pauliRXBlock z | .Z => _root_.MIPStarRE.QPBT.pauliRZBlock z))
(fun a => .bit a)
/-- The honest Pair measurement, with a deterministic harmless branch when the
two Pair/W observables anticommute. -/
noncomputable def honestPairMeasurement (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
(z : _root_.MIPStarRE.QPBT.PauliSpace P) : _root_.LIDT.MIPStarRE.Quantum.Measurement (_root_.MIPStarRE.QPBT.PauliAnswer P) (_root_.MIPStarRE.QPBT.HonestIndex P) := by
classical
by_cases hgamma : _root_.MIPStarRE.QPBT.pauliPairGamma P z = 0
· exact _root_.MIPStarRE.QPBT.placedPauliMeasurement (_root_.MIPStarRE.QPBT.pauliPairMeasurement P z hgamma)
(fun a => .pairBits a)
· exact _root_.MIPStarRE.QPBT.deterministicMeasurement (V := _root_.MIPStarRE.QPBT.HonestIndex P) (.pairBits (0, 0))
/-- The honest Magic Square measurement at a typed Pauli question. -/
noncomputable def honestMagicMeasurement (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (t : _root_.MIPStarRE.QPBT.MsType)
(z : _root_.MIPStarRE.QPBT.PauliSpace P) : _root_.LIDT.MIPStarRE.Quantum.Measurement (_root_.MIPStarRE.QPBT.PauliAnswer P) (_root_.MIPStarRE.QPBT.HonestIndex P) := by
classical
by_cases hgamma : _root_.MIPStarRE.QPBT.pauliPairGamma P z = 0
· exact _root_.MIPStarRE.QPBT.deterministicMeasurement (V := _root_.MIPStarRE.QPBT.HonestIndex P)
(match t with
| .constraint _ => (.msTriple 0 : _root_.MIPStarRE.QPBT.PauliAnswer P)
| .var _ => (.bit 0 : _root_.MIPStarRE.QPBT.PauliAnswer P))
· exact (_root_.MIPStarRE.QPBT.pauliMagicMeasurement P z hgamma t).postprocess _root_.MIPStarRE.QPBT.pauliAnswerOfMs
/-- The total honest measurement family, defined on all 26 Pauli question
types and all ambient coefficient vectors. -/
noncomputable def honestMeasurement (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
(t : _root_.MIPStarRE.QPBT.PauliType) (z : _root_.MIPStarRE.QPBT.PauliSpace P) :
_root_.LIDT.MIPStarRE.Quantum.Measurement (_root_.MIPStarRE.QPBT.PauliAnswer P) (_root_.MIPStarRE.QPBT.HonestIndex P) :=
match t with
| .point W => _root_.MIPStarRE.QPBT.honestPointMeasurement P W z
| .aline W => _root_.MIPStarRE.QPBT.honestALineMeasurement P W z
| .dline W => _root_.MIPStarRE.QPBT.honestDLineMeasurement P W z
| .pauli W => _root_.MIPStarRE.QPBT.honestPauliMeasurement P W
| .pairW W => _root_.MIPStarRE.QPBT.honestPairWMeasurement P W z
| .pair => _root_.MIPStarRE.QPBT.honestPairMeasurement P z
| .ms t => _root_.MIPStarRE.QPBT.honestMagicMeasurement P t z
/-- Injective answer relabelling preserves projectivity of a placed Pauli
measurement. -/
theorem placedPauliMeasurement_projective {P : _root_.MIPStarRE.QPBT.AdmissibleParams}
{α : Type*} [Fintype α] [DecidableEq α]
(M : _root_.LIDT.MIPStarRE.Quantum.Measurement α (_root_.MIPStarRE.QPBT.PauliRegister P))
(hM : _root_.MIPStarRE.QPBT.Measurement.IsProjective M)
(f : α → _root_.MIPStarRE.QPBT.PauliAnswer P) (hf : Function.Injective f) :
_root_.MIPStarRE.QPBT.Measurement.IsProjective (_root_.MIPStarRE.QPBT.placedPauliMeasurement M f) := by
intro a
by_cases ha : a ∈ Set.range f
· rcases ha with ⟨b, rfl⟩
change _root_.LIDT.MIPStarRE.Quantum.IsProj (((_root_.MIPStarRE.QPBT.DistanceCalculus.leftPlacedMeasurement (ιB := ZMod 2) M).postprocess f).effect
(f b))
rw [_root_.MIPStarRE.QPBT.SandwichProduct.postprocess_effect_of_injective _ f hf b]
exact _root_.LIDT.MIPStarRE.LDT.MakingMeasurementsProjective.isProj_kronecker
(hM b) (IsStarProjection.one _)
· change _root_.LIDT.MIPStarRE.Quantum.IsProj
(((_root_.MIPStarRE.QPBT.DistanceCalculus.leftPlacedMeasurement (ιB := ZMod 2) M).postprocess f).effect a)
rw [_root_.MIPStarRE.QPBT.postprocess_effect_eq_zero_of_notMem _ _ ha]
exact IsStarProjection.zero _
/-- Injective answer relabelling preserves symmetry of a placed Pauli
measurement. -/
theorem placedPauliMeasurement_effect_transpose {P : _root_.MIPStarRE.QPBT.AdmissibleParams}
{α : Type*} [Fintype α] [DecidableEq α]
(M : _root_.LIDT.MIPStarRE.Quantum.Measurement α (_root_.MIPStarRE.QPBT.PauliRegister P))
(hM : ∀ a, (M.effect a)ᵀ = M.effect a)
(f : α → _root_.MIPStarRE.QPBT.PauliAnswer P) (a : _root_.MIPStarRE.QPBT.PauliAnswer P) :
((_root_.MIPStarRE.QPBT.placedPauliMeasurement M f).effect a)ᵀ =
(_root_.MIPStarRE.QPBT.placedPauliMeasurement M f).effect a := by
rw [show _root_.MIPStarRE.QPBT.placedPauliMeasurement M f =
(_root_.MIPStarRE.QPBT.DistanceCalculus.leftPlacedMeasurement (ιB := ZMod 2) M).postprocess f by rfl]
apply _root_.MIPStarRE.QPBT.postprocess_effect_transpose
intro b
exact _root_.MIPStarRE.QPBT.leftPlacedMeasurement_effect_transpose M hM b
/-- The global honest measurement is projective at every question. -/
theorem honestMeasurement_projective (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (t : _root_.MIPStarRE.QPBT.PauliType)
(z : _root_.MIPStarRE.QPBT.PauliSpace P) :
_root_.MIPStarRE.QPBT.Measurement.IsProjective (_root_.MIPStarRE.QPBT.honestMeasurement P t z) := by
cases t with
| point W =>
simpa [_root_.MIPStarRE.QPBT.honestMeasurement, _root_.MIPStarRE.QPBT.honestPointMeasurement] using
(_root_.MIPStarRE.QPBT.placedPauliMeasurement_projective
(_root_.MIPStarRE.QPBT.pauliPointMeasurement P W (_root_.MIPStarRE.QPBT.pauliPointBlock W z))
(_root_.MIPStarRE.QPBT.pauliPointMeasurement_projective P W (_root_.MIPStarRE.QPBT.pauliPointBlock W z))
(fun a => _root_.MIPStarRE.QPBT.PauliAnswer.value a) (by intro; simp))
| aline W =>
simpa [_root_.MIPStarRE.QPBT.honestMeasurement, _root_.MIPStarRE.QPBT.honestALineMeasurement] using
(_root_.MIPStarRE.QPBT.placedPauliMeasurement_projective (_root_.MIPStarRE.QPBT.pauliALineMeasurement P W z)
(_root_.MIPStarRE.QPBT.pauliALineMeasurement_projective P W z)
(fun a => _root_.MIPStarRE.QPBT.PauliAnswer.alinePoly a) (by intro; simp))
| dline W =>
simpa [_root_.MIPStarRE.QPBT.honestMeasurement, _root_.MIPStarRE.QPBT.honestDLineMeasurement] using
(_root_.MIPStarRE.QPBT.placedPauliMeasurement_projective (_root_.MIPStarRE.QPBT.pauliDLineMeasurement P W z)
(_root_.MIPStarRE.QPBT.pauliDLineMeasurement_projective P W z)
(fun a => _root_.MIPStarRE.QPBT.PauliAnswer.dlinePoly a) (by intro; simp))
| pauli W =>
simpa [_root_.MIPStarRE.QPBT.honestMeasurement, _root_.MIPStarRE.QPBT.honestPauliMeasurement] using
(_root_.MIPStarRE.QPBT.placedPauliMeasurement_projective (_root_.MIPStarRE.QPBT.pauliBasisMeasurement W)
(fun a => _root_.MIPStarRE.QPBT.pauliProj_isProj W a)
(fun a => _root_.MIPStarRE.QPBT.PauliAnswer.pauliOutcome a) (by intro; simp))
| pairW W =>
simpa [_root_.MIPStarRE.QPBT.honestMeasurement, _root_.MIPStarRE.QPBT.honestPairWMeasurement] using
(_root_.MIPStarRE.QPBT.placedPauliMeasurement_projective
(_root_.MIPStarRE.QPBT.pauliTraceMeasurement P W (_root_.MIPStarRE.QPBT.pauliPointBlock W z)
(match W with | .X => _root_.MIPStarRE.QPBT.pauliRXBlock z | .Z => _root_.MIPStarRE.QPBT.pauliRZBlock z))
(_root_.MIPStarRE.QPBT.pauliTraceMeasurement_projective P W _ _)
(fun a => _root_.MIPStarRE.QPBT.PauliAnswer.bit a) (by intro; simp))
| pair =>
classical
by_cases hg : _root_.MIPStarRE.QPBT.pauliPairGamma P z = 0
· simpa [_root_.MIPStarRE.QPBT.honestMeasurement, _root_.MIPStarRE.QPBT.honestPairMeasurement, hg] using
(_root_.MIPStarRE.QPBT.placedPauliMeasurement_projective (_root_.MIPStarRE.QPBT.pauliPairMeasurement P z hg)
(_root_.MIPStarRE.QPBT.pauliPairMeasurement_projective P z hg)
(fun a => _root_.MIPStarRE.QPBT.PauliAnswer.pairBits a) (by intro; simp))
· simpa [_root_.MIPStarRE.QPBT.honestMeasurement, _root_.MIPStarRE.QPBT.honestPairMeasurement, hg] using
(_root_.MIPStarRE.QPBT.deterministicMeasurement_projective
(V := _root_.MIPStarRE.QPBT.HonestIndex P) (α := _root_.MIPStarRE.QPBT.PauliAnswer P) (.pairBits (0, 0)))
| ms t =>
classical
by_cases hg : _root_.MIPStarRE.QPBT.pauliPairGamma P z = 0
· simpa [_root_.MIPStarRE.QPBT.honestMeasurement, _root_.MIPStarRE.QPBT.honestMagicMeasurement, hg] using
(_root_.MIPStarRE.QPBT.deterministicMeasurement_projective
(V := _root_.MIPStarRE.QPBT.HonestIndex P) (α := _root_.MIPStarRE.QPBT.PauliAnswer P)
(match t with
| .constraint _ => (.msTriple 0 : _root_.MIPStarRE.QPBT.PauliAnswer P)
| .var _ => (.bit 0 : _root_.MIPStarRE.QPBT.PauliAnswer P)))
· simpa [_root_.MIPStarRE.QPBT.honestMeasurement, _root_.MIPStarRE.QPBT.honestMagicMeasurement, hg] using
(_root_.MIPStarRE.QPBT.SandwichProduct.postprocess_isProjective (_root_.MIPStarRE.QPBT.pauliMagicMeasurement P z hg t)
(_root_.MIPStarRE.QPBT.pauliMagicMeasurement_projective P z hg t) _root_.MIPStarRE.QPBT.pauliAnswerOfMs)
/-- The honest `Point/W` effects are symmetric matrices: each is a sum of
generalized Pauli projectors, and those are symmetric in the computational
basis. Symmetry of the effects is what lets the maximally entangled state
transfer a player's measurement to its partner in the consistency step of
`lem:pauli-completeness`. -/
theorem pauliPointMeasurement_effect_transpose (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (W : _root_.MIPStarRE.QPBT.PauliKind)
(u : Fin P.m → _root_.MIPStarRE.QPBT.PauliScalar P) (a : _root_.MIPStarRE.QPBT.PauliScalar P) :
((_root_.MIPStarRE.QPBT.pauliPointMeasurement P W u).effect a)ᵀ =
(_root_.MIPStarRE.QPBT.pauliPointMeasurement P W u).effect a := by
apply _root_.MIPStarRE.QPBT.postprocess_effect_transpose
intro h
exact _root_.MIPStarRE.QPBT.pauliProj_transpose W h
/-- The honest `ALine/W` effects are symmetric matrices, by the same
coarse-graining of symmetric generalized Pauli projectors as in the `Point`
case. -/
theorem pauliALineMeasurement_effect_transpose (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (W : _root_.MIPStarRE.QPBT.PauliKind)
(z : _root_.MIPStarRE.QPBT.PauliSpace P) (a : Fin (P.d + 1) → _root_.MIPStarRE.QPBT.PauliScalar P) :
((_root_.MIPStarRE.QPBT.pauliALineMeasurement P W z).effect a)ᵀ =
(_root_.MIPStarRE.QPBT.pauliALineMeasurement P W z).effect a := by
apply _root_.MIPStarRE.QPBT.postprocess_effect_transpose
intro h
exact _root_.MIPStarRE.QPBT.pauliProj_transpose W h
/-- The honest `DLine/W` effects are symmetric matrices, by the same
coarse-graining of symmetric generalized Pauli projectors as in the `Point`
case. -/
theorem pauliDLineMeasurement_effect_transpose (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (W : _root_.MIPStarRE.QPBT.PauliKind)
(z : _root_.MIPStarRE.QPBT.PauliSpace P) (a : Fin (P.m * P.d + 1) → _root_.MIPStarRE.QPBT.PauliScalar P) :
((_root_.MIPStarRE.QPBT.pauliDLineMeasurement P W z).effect a)ᵀ =
(_root_.MIPStarRE.QPBT.pauliDLineMeasurement P W z).effect a := by
apply _root_.MIPStarRE.QPBT.postprocess_effect_transpose
intro h
exact _root_.MIPStarRE.QPBT.pauliProj_transpose W h
/-- The global honest measurement has symmetric effects. -/
theorem honestMeasurement_effect_transpose (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (t : _root_.MIPStarRE.QPBT.PauliType)
(z : _root_.MIPStarRE.QPBT.PauliSpace P) (a : _root_.MIPStarRE.QPBT.PauliAnswer P) :
((_root_.MIPStarRE.QPBT.honestMeasurement P t z).effect a)ᵀ =
(_root_.MIPStarRE.QPBT.honestMeasurement P t z).effect a := by
cases t with
| point W =>
change ((_root_.MIPStarRE.QPBT.honestPointMeasurement P W z).effect a)ᵀ =
(_root_.MIPStarRE.QPBT.honestPointMeasurement P W z).effect a
exact _root_.MIPStarRE.QPBT.placedPauliMeasurement_effect_transpose _
(_root_.MIPStarRE.QPBT.pauliPointMeasurement_effect_transpose P W (_root_.MIPStarRE.QPBT.pauliPointBlock W z)) _ _
| aline W =>
change ((_root_.MIPStarRE.QPBT.honestALineMeasurement P W z).effect a)ᵀ =
(_root_.MIPStarRE.QPBT.honestALineMeasurement P W z).effect a
exact _root_.MIPStarRE.QPBT.placedPauliMeasurement_effect_transpose _
(_root_.MIPStarRE.QPBT.pauliALineMeasurement_effect_transpose P W z) _ _
| dline W =>
change ((_root_.MIPStarRE.QPBT.honestDLineMeasurement P W z).effect a)ᵀ =
(_root_.MIPStarRE.QPBT.honestDLineMeasurement P W z).effect a
exact _root_.MIPStarRE.QPBT.placedPauliMeasurement_effect_transpose _
(_root_.MIPStarRE.QPBT.pauliDLineMeasurement_effect_transpose P W z) _ _
| pauli W =>
change ((_root_.MIPStarRE.QPBT.honestPauliMeasurement P W).effect a)ᵀ =
(_root_.MIPStarRE.QPBT.honestPauliMeasurement P W).effect a
exact _root_.MIPStarRE.QPBT.placedPauliMeasurement_effect_transpose (_root_.MIPStarRE.QPBT.pauliBasisMeasurement W)
(_root_.MIPStarRE.QPBT.pauliProj_transpose W) _ _
| pairW W =>
change ((_root_.MIPStarRE.QPBT.honestPairWMeasurement P W z).effect a)ᵀ =
(_root_.MIPStarRE.QPBT.honestPairWMeasurement P W z).effect a
exact _root_.MIPStarRE.QPBT.placedPauliMeasurement_effect_transpose _
(_root_.MIPStarRE.QPBT.pauliTraceMeasurement_effect_transpose P W _ _) _ _
| pair =>
classical
by_cases hg : _root_.MIPStarRE.QPBT.pauliPairGamma P z = 0
· simpa [_root_.MIPStarRE.QPBT.honestMeasurement, _root_.MIPStarRE.QPBT.honestPairMeasurement, hg] using
(_root_.MIPStarRE.QPBT.placedPauliMeasurement_effect_transpose (_root_.MIPStarRE.QPBT.pauliPairMeasurement P z hg)
(fun β => by
change (_root_.MIPStarRE.QPBT.pauliPairEffect P z β)ᵀ = _root_.MIPStarRE.QPBT.pauliPairEffect P z β
rw [_root_.MIPStarRE.QPBT.pauliPairEffect, Matrix.transpose_mul,
_root_.MIPStarRE.QPBT.pauliTraceMeasurement_effect_transpose,
_root_.MIPStarRE.QPBT.pauliTraceMeasurement_effect_transpose]
exact (_root_.MIPStarRE.QPBT.pauliTraceMeasurement_effect_commute P z hg β.1 β.2).eq.symm)
(fun a => _root_.MIPStarRE.QPBT.PauliAnswer.pairBits a) a)
· simpa [_root_.MIPStarRE.QPBT.honestMeasurement, _root_.MIPStarRE.QPBT.honestPairMeasurement, hg] using
(_root_.MIPStarRE.QPBT.deterministicMeasurement_effect_transpose
(α := _root_.MIPStarRE.QPBT.PauliAnswer P) (V := _root_.MIPStarRE.QPBT.HonestIndex P) (.pairBits (0, 0)) a)
| ms t =>
classical
by_cases hg : _root_.MIPStarRE.QPBT.pauliPairGamma P z = 0
· simpa [_root_.MIPStarRE.QPBT.honestMeasurement, _root_.MIPStarRE.QPBT.honestMagicMeasurement, hg] using
(_root_.MIPStarRE.QPBT.deterministicMeasurement_effect_transpose
(α := _root_.MIPStarRE.QPBT.PauliAnswer P) (V := _root_.MIPStarRE.QPBT.HonestIndex P)
(match t with
| .constraint _ => (.msTriple 0 : _root_.MIPStarRE.QPBT.PauliAnswer P)
| .var _ => (.bit 0 : _root_.MIPStarRE.QPBT.PauliAnswer P)) a)
· simpa [_root_.MIPStarRE.QPBT.honestMeasurement, _root_.MIPStarRE.QPBT.honestMagicMeasurement, hg] using
(_root_.MIPStarRE.QPBT.postprocess_effect_transpose (_root_.MIPStarRE.QPBT.pauliMagicMeasurement P z hg t)
_root_.MIPStarRE.QPBT.pauliAnswerOfMs
(fun b => _root_.MIPStarRE.QPBT.pauliMagicMeasurement_effect_transpose P z hg t b) a)
end
end MIPStarRE.QPBT
Source