Fixed-evolution sandwich has the required local moments
OpenQAlgorithms.Papers.Independent.Intakethird100.P71.fixedEvolution_sandwichMomentsFix qudits, , and an arbitrary unitary independently of the unknown input state. Let and be independent random local unitaries whose twirling superoperators equal those of normalized product Haar measure at orders two and three. For the sandwich , choose the prior basis outcome uniformly and set . Its prior law is a probability measure with integrable polynomial moments. If is its local Haar twirl, then
When its measurement channel is injective, Eq. (12) has unique real coefficients defining its inverse, and the resulting shadows reconstruct every density matrix without bias. This formulation includes the moment property used for Clifford end factors without asserting continuous Haar invariance of their discrete probability laws.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P71
noncomputable section
open MeasureTheory
open scoped Matrix ComplexConjugate ENNReal Matrix.Norms.Elementwise
namespace QAlgorithms.Papers.Independent.Intakethird100.P71
attribute [local instance] Classical.propDecidable
local notation "Config" n:max d:max =>
QAlgorithms.Papers.Independent.Information100.P21.Config (P := Fin n) (fun _ => d)
local notation "Op" n:max d:max =>
QAlgorithms.Papers.Independent.Information100.P21.Op (Config n d)
attribute [local instance] QAlgorithms.Papers.Independent.Intakethird100.P71.matrixContinuousENorm
local notation "Unitary" n:max d:max => Matrix.unitaryGroup (Config n d) ℂ
local notation "Local" n:max d:max => Fin n → Matrix.unitaryGroup (Fin d) ℂ
open QAlgorithms.Papers.Independent.Information100.P63 (tensorPower)
/-- PDF p.11 §III C: fixed evolution sandwiched between independent local
2/3-designs has the required snapshot moments. Finite Clifford factors are not
asserted Haar-invariant as laws. Completeness is needed only for reconstruction. -/
theorem fixedEvolution_sandwichMoments {n d : ℕ} (hd : 2 ≤ d) (U0 : Unitary n d)
(H muL muR : Measure (Local n d)) [IsProbabilityMeasure H] [H.IsMulLeftInvariant]
[IsProbabilityMeasure muL] [IsProbabilityMeasure muR]
(hL : ∀ t ∈ ({2,3} : Finset ℕ), IsLocalDesign muL H t)
(hR : ∀ t ∈ ({2,3} : Finset ℕ), IsLocalDesign muR H t) :
let nu := sandwichPrior U0 muL muR
IsProbabilityMeasure nu ∧ SnapshotPolynomialIntegrable nu ∧
(∀ t ∈ ({2,3} : Finset ℕ), snapshotMoment nu t = snapshotMoment (twirled H nu) t) ∧
(∀ hc : Complete nu, ∃! r : Finset (Fin n) → ℝ,
CoefficientSystem nu r ∧ (∀ X : Op n d, efReconstruct r X = snapshotInverse nu hc X) ∧
(∀ rho : Op n d, IsDensityMatrix rho →
(∫ S, efReconstruct r S ∂posteriorOf nu rho) = rho)) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P71
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let , , , , and let be any unitary matrix on . For a family of local unitary matrices, write . Let be probability measures on these families, with invariant under left multiplication by every fixed family. Assume that, for each , each , and every complex matrix indexed by copies of ,
Define
The theorem states that is a probability measure; that is integrable for every natural , including , that is integrable for every complex matrix , and that is integrable for every pair ; and that for . Define . For every assumption that is injective, writing , there exists exactly one real function on the site subsets satisfying all of the following together. First, with
it satisfies for every . Second, for every , where has entry when agree outside , and otherwise; the partial trace sums matching complementary indices. Third, for every positive semidefinite of trace ,
The case and all empty products and subsets are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.