Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Fixed-evolution sandwich has the required local moments

Open
QAlgorithms.Papers.Independent.Intakethird100.P71.fixedEvolution_sandwichMoments

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Fix NNN qudits, d≥2d\ge2d≥2, and an arbitrary unitary U0U_0U0​ independently of the unknown input state. Let LLL and RRR be independent random local unitaries whose twirling superoperators equal those of normalized product Haar measure at orders two and three. For the sandwich U=LU0RU=L U_0 RU=LU0​R, choose the prior basis outcome bbb uniformly and set S=U†∣b⟩⟨b∣US=U^\dagger|b\rangle\langle b|US=U†∣b⟩⟨b∣U. Its prior law ν\nuν is a probability measure with integrable polynomial moments. If νLS\nu^{\rm LS}νLS is its local Haar twirl, then

EνS⊗t=EνLSS⊗t,t∈{2,3}.\mathbb E_\nu S^{\otimes t}=\mathbb E_{\nu^{\rm LS}}S^{\otimes t},\qquad t\in\{2,3\}.Eν​S⊗t=EνLS​S⊗t,t∈{2,3}.

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.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P71
Formal statement
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
Source
Classical Shadow Tomography with Locally Scrambled Quantum Dynamics, arXiv:2107.04817v4, PDF p. 11, §III C: fixed evolution sandwiched by local random unitaries
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let n≥0n\ge0n≥0, d≥2d\ge2d≥2, X={0,…,d−1}n\mathcal X=\{0,\ldots,d-1\}^nX={0,…,d−1}n, N=dnN=d^nN=dn, and let U0U_0U0​ be any unitary matrix on CX\mathbb C^{\mathcal X}CX. For a family V=(Vi)i<nV=(V_i)_{i<n}V=(Vi​)i<n​ of local d×dd\times dd×d unitary matrices, write LV=⨂iViL_V=\bigotimes_iV_iLV​=⨂i​Vi​. Let H,μL,μRH,\mu_L,\mu_RH,μL​,μR​ be probability measures on these families, with HHH invariant under left multiplication by every fixed family. Assume that, for each t∈{2,3}t\in\{2,3\}t∈{2,3}, each μ∈{μL,μR}\mu\in\{\mu_L,\mu_R\}μ∈{μL​,μR​}, and every complex matrix XXX indexed by ttt copies of X\mathcal XX,

∫(LV⊗t)†XLV⊗t dμ(V)=∫(LV⊗t)†XLV⊗t dH(V),(S⊗t)xy=∏a=0t−1Sxaya.\int (L_V^{\otimes t})^\dagger X L_V^{\otimes t}\,d\mu(V) = \int (L_V^{\otimes t})^\dagger X L_V^{\otimes t}\,dH(V), \qquad (S^{\otimes t})_{xy}=\prod_{a=0}^{t-1}S_{x_a y_a}.∫(LV⊗t​)†XLV⊗t​dμ(V)=∫(LV⊗t​)†XLV⊗t​dH(V),(S⊗t)xy​=a=0∏t−1​Sxa​ya​​.

Define

ν=N−1∑b∈X((L,R)↦(LLU0LR)†∣b⟩⟨b∣(LLU0LR))∗(μL⊗μR),ν~=((V,S)↦LV†SLV)∗(H⊗ν).\nu=N^{-1}\sum_{b\in\mathcal X} \bigl((L,R)\mapsto (L_LU_0L_R)^\dagger|b\rangle\langle b|(L_LU_0L_R)\bigr)_*(\mu_L\otimes\mu_R), \quad \widetilde\nu=((V,S)\mapsto L_V^\dagger SL_V)_*(H\otimes\nu).ν=N−1b∈X∑​((L,R)↦(LL​U0​LR​)†∣b⟩⟨b∣(LL​U0​LR​))∗​(μL​⊗μR​),ν=((V,S)↦LV†​SLV​)∗​(H⊗ν).

The theorem states that ν\nuν is a probability measure; that S↦S⊗tS\mapsto S^{\otimes t}S↦S⊗t is integrable for every natural ttt, including 000, that S↦tr⁡(SX)SS\mapsto\operatorname{tr}(SX)SS↦tr(SX)S is integrable for every complex matrix XXX, and that S↦(Re⁡tr⁡(XS))2Re⁡tr⁡(SY)S\mapsto(\operatorname{Re}\operatorname{tr}(XS))^2\operatorname{Re}\operatorname{tr}(SY)S↦(Retr(XS))2Retr(SY) is integrable for every pair X,YX,YX,Y; and that ∫S⊗t dν=∫S⊗t dν~\int S^{\otimes t}\,d\nu=\int S^{\otimes t}\,d\widetilde\nu∫S⊗tdν=∫S⊗tdν for t=2,3t=2,3t=2,3. Define M(X)ij=∑k,l(∫NSijSlk dν(S))Xkl\mathcal M(X)_{ij}=\sum_{k,l}(\int NS_{ij}S_{lk}\,d\nu(S))X_{kl}M(X)ij​=∑k,l​(∫NSij​Slk​dν(S))Xkl​. For every assumption that M\mathcal MM is injective, writing R=M−1\mathcal R=\mathcal M^{-1}R=M−1, there exists exactly one real function rrr on the site subsets satisfying all of the following together. First, with

f(C)=∫Re⁡tr⁡((Tr⁡CcS)2) dν(S),F(A,B,C)=(d3d2−1)n∑DB=A∩Dd−∣D∣(−1/d)∣C△D∣,f(C)=\int\operatorname{Re}\operatorname{tr}((\operatorname{Tr}_{C^c}S)^2)\,d\nu(S), \quad F(A,B,C)=\left(\frac{d^3}{d^2-1}\right)^n \sum_{\substack{D\\B=A\cap D}}d^{-|D|}(-1/d)^{|C\triangle D|},f(C)=∫Retr((TrCc​S)2)dν(S),F(A,B,C)=(d2−1d3​)nDB=A∩D​∑​d−∣D∣(−1/d)∣C△D∣,

it satisfies ∑A,Cr(A)F(A,B,C)f(C)=1{B={0,…,n−1}}\sum_{A,C}r(A)F(A,B,C)f(C)=\mathbf1_{\{B=\{0,\ldots,n-1\}\}}∑A,C​r(A)F(A,B,C)f(C)=1{B={0,…,n−1}}​ for every BBB. Second, N∑Ar(A)RA(X)=R(X)N\sum_A r(A)R_A(X)=\mathcal R(X)N∑A​r(A)RA​(X)=R(X) for every XXX, where RA(X)R_A(X)RA​(X) has entry d−(n−∣A∣)(Tr⁡AcX)x∣A,y∣Ad^{-(n-|A|)}(\operatorname{Tr}_{A^c}X)_{x|_A,y|_A}d−(n−∣A∣)(TrAc​X)x∣A​,y∣A​​ when x,yx,yx,y agree outside AAA, and 000 otherwise; the partial trace sums matching complementary indices. Third, for every positive semidefinite ρ\rhoρ of trace 111,

∫N∑Ar(A)RA(S) dνρ(S)=ρ,dνρ=[NRe⁡tr⁡(Sρ)]+dν.\int N\sum_A r(A)R_A(S)\,d\nu_\rho(S)=\rho, \qquad d\nu_\rho=[N\operatorname{Re}\operatorname{tr}(S\rho)]_+d\nu.∫NA∑​r(A)RA​(S)dνρ​(S)=ρ,dνρ​=[NRetr(Sρ)]+​dν.

The case n=0n=0n=0 and all empty products and subsets are included.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me