Pauli Distance On Ideal Le
ProvedMIPStarRE.QPBT.pauli_distance_on_ideal_leThe collision hypothesis for the sandwich support comparison on QPBT polynomial outcomes, with the field cardinality written as P.q.
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_Algebra_Decoding 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_Combining_Defs import Definitions.Def_QPBT_QPBT_Extraction_EncodingSupport import Definitions.Def_QPBT_QPBT_Games_Defs import Definitions.Def_QPBT_QPBT_Games_DistanceTheorems import Definitions.Def_QPBT_QPBT_Games_DistanceTheorems_Support import Definitions.Def_QPBT_QPBT_Games_DistanceTheorems_TensorSupport import Definitions.Def_QPBT_QPBT_State import Definitions.Def_QPBT_QPBT_Test_MagicSquareTheorems_Rigidity_GroundSlice import Definitions.Def_QPBT_QPBT_Test_PauliBasisTest import Mathlib 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 /-! # Total Pauli comparison on a normalized ideal state The complete answer-summed distance is controlled by the evaluated overlap on another normalized state, the Schwartz--Zippel collision probability, and the distance between the states. This is the operator comparison used after the swap and auxiliary-state construction. ## References Blueprint `lem:qld-unitary`; paper `references/qpbt-paper/14_analysis_of_the_pauli_basis_test.tex:1827-1858`. -/ open scoped BigOperators Matrix MatrixOrder ComplexOrder open MIPStarRE.QPBT open LIDT.MIPStarRE.Quantum MIPStarRE.QPBT.DistanceCalculus open LIDT.MIPStarRE.LDT hiding Measurement
theorem MIPStarRE.QPBT.pauli_distance_on_ideal_le {P : _root_.MIPStarRE.QPBT.AdmissibleParams} {I J : Type*}
[Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
(A : _root_.LIDT.MIPStarRE.Quantum.Measurement (_root_.MIPStarRE.QPBT.PauliRegister P) (I × _root_.MIPStarRE.QPBT.PauliRegister P)) (W : _root_.MIPStarRE.QPBT.PauliKind)
(aux : EuclideanSpace ℂ (I × J)) (haux : ‖aux‖ = 1)
(theta : EuclideanSpace ℂ ((I × _root_.MIPStarRE.QPBT.PauliRegister P) × (J × _root_.MIPStarRE.QPBT.PauliRegister P)))
(htheta : ‖theta‖ = 1) :
let ideal := _root_.MIPStarRE.QPBT.reindexState _root_.MIPStarRE.QPBT.prodShuffle (_root_.MIPStarRE.QPBT.vecTensor aux (_root_.MIPStarRE.QPBT.eprState (_root_.MIPStarRE.QPBT.PauliRegister P)))
let B := _root_.MIPStarRE.QPBT.DistanceCalculus.rightPlacedMeasurement (ιA := J) (_root_.MIPStarRE.QPBT.pauliRegisterMeas (params := P) W)
(∑ h : _root_.MIPStarRE.QPBT.PauliRegister P, ‖_root_.MIPStarRE.QPBT.applyOperatorToState
(_root_.MIPStarRE.QPBT.heteroKron (A.effect h - _root_.MIPStarRE.QPBT.heteroKron (1 : _root_.LIDT.MIPStarRE.Quantum.Op I) (_root_.MIPStarRE.QPBT.pauliProj W h))
(1 : _root_.LIDT.MIPStarRE.Quantum.Op (J × _root_.MIPStarRE.QPBT.PauliRegister P))) ideal‖ ^ 2) ≤
2 * (1 - _root_.LIDT.MIPStarRE.LDT.avgOver (_root_.LIDT.MIPStarRE.LDT.uniformDistribution (Fin P.m → _root_.MIPStarRE.QPBT.PauliScalar P)) (fun u =>
∑ a : _root_.MIPStarRE.QPBT.PauliScalar P, _root_.MIPStarRE.QPBT.DistanceCalculus.stateQForm theta
(_root_.MIPStarRE.QPBT.heteroKron ((A.postprocess (fun h => _root_.MIPStarRE.QPBT.evalPoly (_root_.MIPStarRE.QPBT.encodingPoly h) u)).effect a)
((B.postprocess (fun h => _root_.MIPStarRE.QPBT.evalPoly (_root_.MIPStarRE.QPBT.encodingPoly h) u)).effect a)))) +
2 * ((P.m * P.d : ℝ) / P.q) + 4 * ‖theta - ideal‖ := by sorry