Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Two-qudit reconstruction coefficients and endpoint maps

Open
QAlgorithms.Papers.Independent.Intakethird100.P71.twoQudit_reconstruction

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

prove2quantum

Let N=2N=2N=2, d≥2d\ge2d≥2, and let a locally scrambled projective experiment have second features (1,w,w,1)(1,w,w,1)(1,w,w,1) in region order ∅,{1},{2},{1,2}\varnothing,\{1\},\{2\},\{1,2\}∅,{1},{2},{1,2}, with 2d/(d2+1)≤w≤12d/(d^2+1)\le w\le12d/(d2+1)≤w≤1. Its unique coefficient solution is

r∅=d3w−3d2+3dw−2w2+1(dw−1)(d2−2dw+1),r{1}=r{2}=−d4w+2d3−2d+wd(dw−1)(d2−2dw+1),r{1,2}=(d2−1)2d2(d2−2dw+1).\begin{aligned}r_\varnothing&=\frac{d^3w-3d^2+3dw-2w^2+1}{(dw-1)(d^2-2dw+1)},\\r_{\{1\}}=r_{\{2\}}&=\frac{-d^4w+2d^3-2d+w}{d(dw-1)(d^2-2dw+1)},\\r_{\{1,2\}}&=\frac{(d^2-1)^2}{d^2(d^2-2dw+1)}.\end{aligned}r∅​r{1}​=r{2}​r{1,2}​​=(dw−1)(d2−2dw+1)d3w−3d2+3dw−2w2+1​,=d(dw−1)(d2−2dw+1)−d4w+2d3−2d+w​,=d2(d2−2dw+1)(d2−1)2​.​

The constructed map Rw(X)=d2∑ArAXA\mathcal R_w(X)=d^2\sum_A r_A X_ARw​(X)=d2∑A​rA​XA​ is a two-sided inverse of the measurement channel. At the endpoints,

R1=Ld⊗Ld,Ld(X)=(d+1)X−Tr⁡(X)I,R2d/(d2+1)(X)=(d2+1)X−Tr⁡(X)I.\mathcal R_1=\mathcal L_d\otimes\mathcal L_d,\qquad \mathcal L_d(X)=(d+1)X-\operatorname{Tr}(X)I,\qquad \mathcal R_{2d/(d^2+1)}(X)=(d^2+1)X-\operatorname{Tr}(X)I.R1​=Ld​⊗Ld​,Ld​(X)=(d+1)X−Tr(X)I,R2d/(d2+1)​(X)=(d2+1)X−Tr(X)I.

For product inputs the local endpoint is Ld(X)⊗Ld(Y)\mathcal L_d(X)\otimes\mathcal L_d(Y)Ld​(X)⊗Ld​(Y). The tensor-of-maps formulation covers correlated inputs without factoring their marginals.

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 pp.5–6 Eqs.(24)–(28): exact toy-model coefficients and the local/global
endpoint superoperators. Eq.(27) is a tensor of maps on general inputs, with a
product-input specialization; Eq.(28) contains Tr(X) I on arbitrary X. -/
theorem twoQudit_reconstruction {d : ℕ} (hd : 2 ≤ d) (E : ProjectiveEnsemble 2 d)
    (hls : LocallyScrambled (prior E)) (w : ℝ)
    (hw : 2*(d : ℝ)/((d : ℝ)^2+1) ≤ w ∧ w ≤ 1) (hf : ToyFeature (prior E) w) :
    CoefficientSystem (prior E) (toyCoefficients d w) ∧
    (∀ r, CoefficientSystem (prior E) r → r = toyCoefficients d w) ∧
    (∀ X : Op 2 d,
      efReconstruct (toyCoefficients d w) (snapshotMeasurementMap (prior E) X) = X ∧
      snapshotMeasurementMap (prior E) (efReconstruct (toyCoefficients d w) X) = X) ∧
    (∀ X : Op 2 d, efReconstruct (toyCoefficients d 1) X =
      QAlgorithms.piSuperop (fun _ : Fin 2 => oneSiteInverse d) X) ∧
    (∀ X Y : Matrix (Fin d) (Fin d) ℂ,
      efReconstruct (toyCoefficients d 1) (twoSiteProduct X Y) =
        twoSiteProduct (oneSiteInverse d X) (oneSiteInverse d Y)) ∧
    (∀ X : Op 2 d,
      efReconstruct (toyCoefficients d (2*(d : ℝ)/((d : ℝ)^2+1))) X =
        ((d : ℂ)^2+1) • X - X.trace • 1) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P71

end
Source
Classical Shadow Tomography with Locally Scrambled Quantum Dynamics, arXiv:2107.04817v4, PDF p. 5, §II C, Eqs.(24)–(28): two-qudit reconstruction coefficients
Read-back

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

Let d≥2d\ge2d≥2 be a natural number, let X={0,…,d−1}2\mathcal X=\{0,\ldots,d-1\}^2X={0,…,d−1}2, and let EEE supply a probability law λ\lambdaλ on unitary matrices on CX\mathbb C^{\mathcal X}CX. Put ν=d−2∑b(U↦U†∣b⟩⟨b∣U)∗λ\nu=d^{-2}\sum_b(U\mapsto U^\dagger|b\rangle\langle b|U)_*\lambdaν=d−2∑b​(U↦U†∣b⟩⟨b∣U)∗​λ, and assume that ν\nuν is invariant under S↦(V0⊗V1)†S(V0⊗V1)S\mapsto(V_0\otimes V_1)^\dagger S(V_0\otimes V_1)S↦(V0​⊗V1​)†S(V0​⊗V1​) for all local unitary matrices V0,V1V_0,V_1V0​,V1​. For A⊆{0,1}A\subseteq\{0,1\}A⊆{0,1}, let Tr⁡AcX\operatorname{Tr}_{A^c}XTrAc​X be the partial trace obtained by summing matching complementary row and column indices, let RA(X)R_A(X)RA​(X) have entries d−(2−∣A∣)(Tr⁡AcX)x∣A,y∣Ad^{-(2-|A|)}(\operatorname{Tr}_{A^c}X)_{x|_A,y|_A}d−(2−∣A∣)(TrAc​X)x∣A​,y∣A​​ when x,yx,yx,y agree outside AAA and 000 otherwise, and define f(A)=∫Re⁡tr⁡((Tr⁡AcS)2) dν(S)f(A)=\int\operatorname{Re}\operatorname{tr}((\operatorname{Tr}_{A^c}S)^2)\,d\nu(S)f(A)=∫Retr((TrAc​S)2)dν(S). Let w∈Rw\in\mathbb Rw∈R satisfy 2d/(d2+1)≤w≤12d/(d^2+1)\le w\le12d/(d2+1)≤w≤1, and assume f(A)=wf(A)=wf(A)=w for every singleton AAA and f(A)=1f(A)=1f(A)=1 for the empty and full subsets. Define

rw(A)={d3w−3d2+3dw−2w2+1(dw−1)(d2−2dw+1),∣A∣=0,−d4w+2d3−2d+wd(dw−1)(d2−2dw+1),∣A∣=1,(d2−1)2d2(d2−2dw+1),∣A∣=2,Er(X)=d2∑Ar(A)RA(X),r_w(A)= \begin{cases} \dfrac{d^3w-3d^2+3dw-2w^2+1}{(dw-1)(d^2-2dw+1)},&|A|=0,\\[4pt] \dfrac{-d^4w+2d^3-2d+w}{d(dw-1)(d^2-2dw+1)},&|A|=1,\\[4pt] \dfrac{(d^2-1)^2}{d^2(d^2-2dw+1)},&|A|=2, \end{cases} \qquad \mathcal E_r(X)=d^2\sum_A r(A)R_A(X),rw​(A)=⎩⎨⎧​(dw−1)(d2−2dw+1)d3w−3d2+3dw−2w2+1​,d(dw−1)(d2−2dw+1)−d4w+2d3−2d+w​,d2(d2−2dw+1)(d2−1)2​,​∣A∣=0,∣A∣=1,∣A∣=2,​Er​(X)=d2A∑​r(A)RA​(X),

and M(X)ij=∑k,l(∫d2SijSlk dν(S))Xkl\mathcal M(X)_{ij}=\sum_{k,l}(\int d^2S_{ij}S_{lk}\,d\nu(S))X_{kl}M(X)ij​=∑k,l​(∫d2Sij​Slk​dν(S))Xkl​. The theorem states that rwr_wrw​ satisfies the equations

∑A,Cr(A)(d3d2−1)2(∑D⊆{0,1}B=A∩Dd−∣D∣(−1/d)∣C△D∣)f(C)=1{B={0,1}}\sum_{A,C}r(A) \left(\frac{d^3}{d^2-1}\right)^2 \left(\sum_{\substack{D\subseteq\{0,1\}\\B=A\cap D}} d^{-|D|}(-1/d)^{|C\triangle D|}\right)f(C) =\mathbf1_{\{B=\{0,1\}\}}A,C∑​r(A)(d2−1d3​)2​D⊆{0,1}B=A∩D​∑​d−∣D∣(−1/d)∣C△D∣​f(C)=1{B={0,1}}​

for every BBB, and that every real function rrr satisfying these equations equals rwr_wrw​. For every complex matrix XXX, Erw(M(X))=X\mathcal E_{r_w}(\mathcal M(X))=XErw​​(M(X))=X and M(Erw(X))=X\mathcal M(\mathcal E_{r_w}(X))=XM(Erw​​(X))=X. In addition, putting ℓd(X)=(d+1)X−tr⁡(X)I\ell_d(X)=(d+1)X-\operatorname{tr}(X)Iℓd​(X)=(d+1)X−tr(X)I, the map Er1\mathcal E_{r_1}Er1​​ equals the linear map ℓd⊗ℓd\ell_d\otimes\ell_dℓd​⊗ℓd​, meaning that it sends each matrix unit Eab⊗EcdE_{ab}\otimes E_{cd}Eab​⊗Ecd​ to ℓd(Eab)⊗ℓd(Ecd)\ell_d(E_{ab})\otimes\ell_d(E_{cd})ℓd​(Eab​)⊗ℓd​(Ecd​); in particular Er1(X⊗Y)=ℓd(X)⊗ℓd(Y)\mathcal E_{r_1}(X\otimes Y)=\ell_d(X)\otimes\ell_d(Y)Er1​​(X⊗Y)=ℓd​(X)⊗ℓd​(Y) for all d×dd\times dd×d complex matrices X,YX,YX,Y. Finally, for every XXX,

Er 2d/(d2+1)(X)=(d2+1)X−tr⁡(X)I.\mathcal E_{r_{\,2d/(d^2+1)}}(X)=(d^2+1)X-\operatorname{tr}(X)I.Er2d/(d2+1)​​(X)=(d2+1)X−tr(X)I.

These last identities use the indicated endpoint coefficients regardless of the value of the given www.

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