Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Example 6: depolarizing dilation subspaces have constant formation and cost

Open
QAlgorithms.Papers.Independent.Intakenext100.P60.depolarizing_constant

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let d≥2d\ge2d≥2 and −1/(d2−1)≤λ≤1-1/(d^2-1)\le\lambda\le1−1/(d2−1)≤λ≤1. Choose unitaries σ0,…,σd2−1\sigma_0,\ldots,\sigma_{d^2-1}σ0​,…,σd2−1​ on Cd\mathbb C^dCd with σ0=I\sigma_0=Iσ0​=I and Tr⁡(σi†σj)=dδij\operatorname{Tr}(\sigma_i^\dagger\sigma_j)=d\delta_{ij}Tr(σi†​σj​)=dδij​. Put p0=λ+(1−λ)/d2p_0=\lambda+(1-\lambda)/d^2p0​=λ+(1−λ)/d2 and pi=(1−p0)/(d2−1)p_i=(1-p_0)/(d^2-1)pi​=(1−p0​)/(d2−1) for i>0i>0i>0. Define the isometry

Uλx=∑i=0d2−1pi σix⊗∣i⟩,U_\lambda x=\sum_{i=0}^{d^2-1}\sqrt{p_i}\,\sigma_i x\otimes |i\rangle,Uλ​x=i=0∑d2−1​pi​​σi​x⊗∣i⟩,

and its range Kλ⊂Cd⊗Cd2K_\lambda\subset\mathbb C^d\otimes\mathbb C^{d^2}Kλ​⊂Cd⊗Cd2. Let a=λ+(1−λ)/da=\lambda+(1-\lambda)/da=λ+(1−λ)/d, b=(1−λ)/db=(1-\lambda)/db=(1−λ)/d, and hλ=−alog⁡2a−(d−1)blog⁡2bh_\lambda=-a\log_2 a-(d-1)b\log_2 bhλ​=−alog2​a−(d−1)blog2​b, using 0log⁡20=00\log_2 0=00log2​0=0. This is the minimum output entropy of the depolarizing channel.

Every density matrix ρ\rhoρ supported on KλK_\lambdaKλ​ satisfies

Ec(ρ)=Ef(ρ)=hλ.E_c(\rho)=E_f(\rho)=h_\lambda.Ec​(ρ)=Ef​(ρ)=hλ​.

For every positive integer nnn, every convex mixture of product states on Kλ⊗nK_\lambda^{\otimes n}Kλ⊗n​ has formation nhλnh_\lambdanhλ​. The tensor cut groups all output systems against all environment systems. Product factors may be mixed supported density matrices. This family gives explicitly computable entanglement costs.

Here EfE_fEf​ is the infimum of average pure-state marginal entropy over normalized finite decompositions of the stated density matrix. EcE_cEc​ is the asymptotic EPR preparation rate under deterministic two-way LOCC, and EDE_DED​ is the corresponding asymptotic distillation rate, in bits per copy. All entropies and logarithms are in bits.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P60
Formal statement
namespace QAlgorithms.Papers.Independent.Intakenext100.P60

open scoped Matrix ComplexConjugate ComplexOrder TensorProduct

noncomputable section

attribute [local instance] Classical.propDecidable Classical.decEq

-- Exact accepted matrix, normalized ensemble, convex roof, grouped copies and LOCC.

open QAlgorithms.Papers.Independent.Information100.P21 (Op FiniteLOCC)

open QAlgorithms.Papers.Independent.Information100.P08 (PureEnsemble pureAverage formation)

open QAlgorithms.Papers.Independent.Information100.P80 (groupedPower)

open QAlgorithms.Papers.Independent.Gap48.P32 (twoWayDistillable)

/-- PDF pp.10--11, Example 6: every supported state has the same cost and formation;
mixtures of n-fold product states have formation n times the same entropy. -/
theorem depolarizing_constant {d : ℕ} (D : DepolarizingData d) :
    (∀ rho : Op (Fin d × Fin (d ^ 2)), IsDensityMatrix rho →
      HasRangeIn (dilationSpace (depolarizingDilation D)) rho →
      formationCostBits rho = depolarizingEntropyBits D ∧ formation rho = depolarizingEntropyBits D) ∧
    (∀ n : ℕ, 0 < n → ∀ m : ℕ, ∀ mu : Fin m → ℝ,
      (∀ j, 0 ≤ mu j) → (∑ j, mu j) = 1 →
      ∀ rho : Fin m → Fin n → Op (Fin d × Fin (d ^ 2)),
      (∀ j i, IsDensityMatrix (rho j i)) →
      (∀ j i, HasRangeIn (dilationSpace (depolarizingDilation D)) (rho j i)) →
      formation (productMixture n m mu rho) = n * depolarizingEntropyBits D) := by sorry

end

end QAlgorithms.Papers.Independent.Intakenext100.P60
Source
Remarks on additivity of the Holevo channel capacity and of the entanglement of formation, arXiv:quant-ph/0206148v4, PDF p. 10, Example 6: depolarizing dilation subspaces have constant formation and cost
Read-back

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

Let d∈Nd\in\mathbb Nd∈N and let DDD consist of d≥2d\ge2d≥2, a real parameter −1/(d2−1)≤λ≤1-1/(d^2-1)\le\lambda\le1−1/(d2−1)≤λ≤1, and matrices σi∈Cd×d\sigma_i\in\mathbb C^{d\times d}σi​∈Cd×d, 0≤i<d20\le i<d^20≤i<d2, satisfying σ0=Id\sigma_0=I_dσ0​=Id​, σi†σi=Id\sigma_i^\dagger\sigma_i=I_dσi†​σi​=Id​, and Tr⁡(σi†σj)=d δij\operatorname{Tr}(\sigma_i^\dagger\sigma_j)=d\,\delta_{ij}Tr(σi†​σj​)=dδij​. Define

p0=λ+1−λd2,w0=p0,wi=1−p0d2−1 (i≠0),W(a,i),j=wi(σi)a,j,K=span⁡C{W⋅,j:0≤j<d},p_0=\lambda+\frac{1-\lambda}{d^2},\quad w_0=p_0,\quad w_i=\frac{1-p_0}{d^2-1}\ (i\ne0),\quad W_{(a,i),j}=\sqrt{w_i}(\sigma_i)_{a,j},\quad K=\operatorname{span}_{\mathbb C}\{W_{\cdot,j}:0\le j<d\},p0​=λ+d21−λ​,w0​=p0​,wi​=d2−11−p0​​ (i=0),W(a,i),j​=wi​​(σi​)a,j​,K=spanC​{W⋅,j​:0≤j<d},

and HD=−alog⁡2a−(d−1)blog⁡2bH_D=-a\log_2a-(d-1)b\log_2bHD​=−alog2​a−(d−1)blog2​b, where b=(1−λ)/db=(1-\lambda)/db=(1−λ)/d, a=λ+ba=\lambda+ba=λ+b, and 0log⁡20=00\log_20=00log2​0=0. Every positive semidefinite trace-one matrix ρ\rhoρ on Cd⊗Cd2\mathbb C^d\otimes\mathbb C^{d^2}Cd⊗Cd2 whose every column belongs to KKK satisfies both C(ρ)=HDC(\rho)=H_DC(ρ)=HD​ and F(ρ)=HDF(\rho)=H_DF(ρ)=HD​. Moreover, for every integer n>0n>0n>0, every m∈Nm\in\mathbb Nm∈N, every μj≥0\mu_j\ge0μj​≥0 with ∑j<mμj=1\sum_{j<m}\mu_j=1∑j<m​μj​=1, and every family of positive semidefinite trace-one matrices ρj,i\rho_{j,i}ρj,i​ on the same bipartite space whose columns all belong to KKK, one has

F(X)=nHD,X(x,y),(x′,y′)=∑j<mμj∏i<n(ρj,i)(xi,yi),(xi′,yi′).F(X)=nH_D,\qquad X_{(x,y),(x',y')}= \sum_{j<m}\mu_j\prod_{i<n}(\rho_{j,i})_{(x_i,y_i),(x'_i,y'_i)}.F(X)=nHD​,X(x,y),(x′,y′)​=j<m∑​μj​i<n∏​(ρj,i​)(xi​,yi​),(xi′​,yi′​)​.

Here F(ω)F(\omega)F(ω) is the real infimum of ∑trtH(Tr⁡B∣vt⟩⟨vt∣)\sum_t r_t H(\operatorname{Tr}_B|v_t\rangle\langle v_t|)∑t​rt​H(TrB​∣vt​⟩⟨vt​∣) over all finite decompositions ω=∑trt∣vt⟩⟨vt∣\omega=\sum_t r_t|v_t\rangle\langle v_t|ω=∑t​rt​∣vt​⟩⟨vt​∣ with rt≥0r_t\ge0rt​≥0, ∑trt=1\sum_t r_t=1∑t​rt​=1, and ∥vt∥=1\|v_t\|=1∥vt​∥=1; H(Q)=−Re⁡Tr⁡f(Q)H(Q)=-\operatorname{Re}\operatorname{Tr}f(Q)H(Q)=−ReTrf(Q), f(x)=xlog⁡2xf(x)=x\log_2xf(x)=xlog2​x, uses spectral functional calculus, and (Tr⁡BQ)a,a′=∑bQ(a,b),(a′,b)(\operatorname{Tr}_B Q)_{a,a'}=\sum_bQ_{(a,b),(a',b)}(TrB​Q)a,a′​=∑b​Q(a,b),(a′,b)​. The quantity C(ω)C(\omega)C(ω) is the real infimum of all E∈RE\in\mathbb RE∈R such that, for every ϵ,η>0\epsilon,\eta>0ϵ,η>0, there exist integers u≥0u\ge0u≥0, r>0r>0r>0, and a finite local protocol LLL with ∣E−u/r∣≤η|E-u/r|\le\eta∣E−u/r∣≤η and 12∥L(Su)−ω^[r]∥1≤ϵ\tfrac12\|L(S_u)-\widehat\omega^{[r]}\|_1\le\epsilon21​∥L(Su​)−ω[r]∥1​≤ϵ. Here ∥Y∥1=Re⁡Tr⁡Y†Y\|Y\|_1=\operatorname{Re}\operatorname{Tr}\sqrt{Y^\dagger Y}∥Y∥1​=ReTrY†Y​, SuS_uSu​ is the grouped uuu-fold power of the projector onto (∣0,1⟩−∣1,0⟩)/2(|0,1\rangle-|1,0\rangle)/\sqrt2(∣0,1⟩−∣1,0⟩)/2​, ω^\widehat\omegaω relabels both bases by their fixed finite enumerations, and grouped powers multiply one-copy entries and reindex strings through the fixed bijections to power-dimensional index sets. A finite local protocol is recursively built from identity maps and local finite Kraus families satisfying ∑tKt†Kt=I\sum_tK_t^\dagger K_t=I∑t​Kt†​Kt​=I, with branch-dependent further protocols and a sum of unnormalized branch outputs. Formation permits u=0u=0u=0 and does not demand growing block lengths. In the second assertion n=0n=0n=0 is excluded, while m=0m=0m=0 is quantified over but cannot satisfy the unit-sum hypothesis; zero individual mixture weights and the endpoints of the parameter interval remain included.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me