QPBT definitions: Combining / Linearity / Defs
DefinitionQPBT_QPBT_Combining_Linearity_Defsqpbt
This bundle defines the basic algebraic interface for binary observables. It records Hermiticity, involution, and the resulting isometry property.
Principal definitions:
MIPStarRE.QPBT.IsBinaryObservable: defines a binary observable as a Hermitian operator whose square is identity.MIPStarRE.QPBT.IsBinaryObservable.conjTranspose_eq: states that a binary observable is self-adjoint.MIPStarRE.QPBT.IsBinaryObservable.mul_self_eq_one: states that a binary observable squares to identity.MIPStarRE.QPBT.IsBinaryObservable.isometry: states that a binary observable is isometric because its adjoint is its inverse.
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/Combining/Linearity/Defs.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
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.IsBinaryObservable
end MIPStarRE.QPBT.IsBinaryObservable
/-!
# Binary observables and the state-dependent distance
This file collects the notions in which the quantum linearity theorem of
Natarajan and Vidick is stated: binary observables, the rank-one density
operator of an ancillary vector, and the squared state-dependent distance
between two operators weighted by a positive semidefinite trace-one operator.
The theorem itself, `exists_exactly_linear_observables`, is stated and proved
in `MIPStarRE/QPBT/Combining/Linearity.lean` from the Boolean Fourier,
operator BLR, Naimark rounding, and representation stability modules under
`MIPStarRE/QPBT/Combining/Linearity/`, all of which build on this file.
## Main definitions
* `IsBinaryObservable`: a Hermitian operator whose square is the identity,
together with its algebra: the identity is a binary observable, so is the
product of two commuting ones, every binary observable is an isometry, and it
remains one after ampliation by the identity of another tensor factor.
* `ancProj`: the rank-one density operator `|v⟩⟨v|` of a vector `v`.
* `stateDepDistSq`: the squared state-dependent distance
`d_ρ(S, T)^2 = Re Tr((S - T)^† (S - T) ρ)`.
## References
The notions are those of blueprint
`thm:linearity`, quoted in the QPBT
paper at `references/qpbt-paper/14_analysis_of_the_pauli_basis_test.tex:713-725`
from Theorem 10 of Natarajan--Vidick, arXiv:1610.03574,
`references/nv-paper/fullpaper.tex:1074-1088`; the state-dependent distance is
defined there at lines 866--875.
-/
@[expose] public section
open scoped BigOperators Matrix MatrixOrder ComplexOrder
namespace MIPStarRE.QPBT
open LIDT.MIPStarRE.LDT
open LIDT.MIPStarRE.Quantum
noncomputable section
/-- A binary observable is a Hermitian operator whose square is the identity.
This is the finite-matrix realization of `Obs(H)` in blueprint
`thm:linearity`, quoted at paper
`references/qpbt-paper/14_analysis_of_the_pauli_basis_test.tex:713-725`. -/
def IsBinaryObservable {ι : Type} [Fintype ι] [DecidableEq ι]
(O : _root_.LIDT.MIPStarRE.Quantum.Op ι) : Prop :=
O.IsHermitian ∧ O * O = 1
namespace IsBinaryObservable
variable {ι : Type} [Fintype ι] [DecidableEq ι] {X Y : _root_.LIDT.MIPStarRE.Quantum.Op ι}
/-- A binary observable is self-adjoint. -/
theorem conjTranspose_eq (hX : _root_.MIPStarRE.QPBT.IsBinaryObservable X) : Xᴴ = X := hX.1
/-- A binary observable squares to the identity. -/
theorem mul_self_eq_one (hX : _root_.MIPStarRE.QPBT.IsBinaryObservable X) : X * X = 1 := hX.2
/-- A binary observable is isometric: being self-adjoint and an involution, its
adjoint is its own inverse. -/
theorem isometry (hX : _root_.MIPStarRE.QPBT.IsBinaryObservable X) : Xᴴ * X = 1 := by
rw [hX.conjTranspose_eq, hX.mul_self_eq_one]
end IsBinaryObservable
end
end MIPStarRE.QPBT
Source