Projective Rounding With Explicit Constant
ProvedMIPStarRE.QPBT.projective_rounding_with_explicit_constantEvaluating a local operator against the left marginal agrees with evaluating its left tensor placement against the bipartite density.
All objects, parameters, typeclass assumptions, and hypotheses are quantified in the accompanying formal statement; each symbol denotes the object of the displayed Lean type with that name. The conclusion is the proposition
This result is an importable reduction step in the formal dependency graph for the quantum Pauli basis test completeness or soundness argument.
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.
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_Consistency import Definitions.Def_QPBT_QPBT_Games_Defs import Definitions.Def_QPBT_QPBT_Games_Distance import Definitions.Def_QPBT_QPBT_Games_DistanceTheorems_ProjectiveRounding import Definitions.Def_QPBT_QPBT_Games_DistanceTheorems_Support import Definitions.Def_QPBT_QPBT_Games_DistanceTheorems_TensorSupport import Definitions.Def_QPBT_QPBT_Upstream namespace LIDT.MIPStarRE.LDT end LIDT.MIPStarRE.LDT namespace LIDT.MIPStarRE.LDT.MakingMeasurementsProjective end LIDT.MIPStarRE.LDT.MakingMeasurementsProjective namespace LIDT.MIPStarRE.Quantum end LIDT.MIPStarRE.Quantum namespace MIPStarRE.QPBT end MIPStarRE.QPBT namespace MIPStarRE.QPBT.DistanceCalculus end MIPStarRE.QPBT.DistanceCalculus /-! # Projective rounding for consistent POVMs This module proves the orthonormalization lemma `lem:ortho` with an explicit error constant: if a POVM `Q` on Alice's space and a POVM `R` on Bob's space are `δ`-consistent on a unit bipartite state `ψ`, then Alice has a projective measurement `P` on her original space with `P_a ⊗ 1` within `220 · δ^(1/4)` of `Q_a ⊗ 1` on `ψ`. The argument passes to Alice's reduced state and follows the construction of the LDT orthonormalization theorem. Rounding the almost-projective effects of `Q` and reducing their ranks gives a family of projectors `Q_a` whose ranges are almost orthogonal; assembling those ranges into one auxiliary space gives an operator `X`, whose positive-Gram polar factor `X̂` is a coisometry; and pulling the block projector of each outcome back along `X̂`, so that `P_a = X̂ᴴ T_a X̂`, gives a projective family close to `Q`. The family `P` lives on Alice's original space and is completed to a measurement at one fixed outcome once its missing state mass has been shown to be small. ## References - `references/qpbt-paper/14_analysis_of_the_pauli_basis_test.tex:131-153` - Blueprint `lem:ortho` - Blueprint `lem:ortho-explicit-constant`, the statement proved in this module - `references/ldt-paper/orthonormalization.tex` -/ open scoped BigOperators Matrix MatrixOrder ComplexOrder open MIPStarRE.QPBT open LIDT.MIPStarRE.LDT hiding Measurement open LIDT.MIPStarRE.Quantum MIPStarRE.QPBT.DistanceCalculus open LIDT.MIPStarRE.LDT.MakingMeasurementsProjective
theorem MIPStarRE.QPBT.projective_rounding_with_explicit_constant {ιA ιB α : Type*}
[Fintype ιA] [DecidableEq ιA] [Fintype ιB] [DecidableEq ιB]
[Fintype α] [DecidableEq α]
(ψ : EuclideanSpace ℂ (ιA × ιB)) (hψ : ‖ψ‖ = 1)
(Q : _root_.LIDT.MIPStarRE.Quantum.Measurement α ιA)
(R : _root_.LIDT.MIPStarRE.Quantum.Measurement α ιB) (δ : _root_.LIDT.MIPStarRE.LDT.Error) (hδ : 0 ≤ δ)
(hcons : _root_.MIPStarRE.QPBT.consistencyDefect (_root_.LIDT.MIPStarRE.LDT.uniformDistribution Unit)
(fun _ a => _root_.MIPStarRE.QPBT.heteroKron (Q.effect a) 1)
(fun _ a => _root_.MIPStarRE.QPBT.heteroKron 1 (R.effect a)) ψ ≤ δ) :
∃ Pm : _root_.LIDT.MIPStarRE.Quantum.Measurement α ιA,
_root_.MIPStarRE.QPBT.Measurement.IsProjective Pm ∧
_root_.MIPStarRE.QPBT.opFamilyDistSq (_root_.LIDT.MIPStarRE.LDT.uniformDistribution Unit)
(fun _ a => _root_.MIPStarRE.QPBT.heteroKron (Pm.effect a) 1)
(fun _ a => _root_.MIPStarRE.QPBT.heteroKron (Q.effect a) 1) ψ ≤
220 * Real.rpow δ (1 / 4 : _root_.LIDT.MIPStarRE.LDT.Error) := by sorry