Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Example 5: formation and cost for all mixtures of the two Pauli-dilation vectors

Open
QAlgorithms.Papers.Independent.Intakenext100.P60.pauli_mixtures

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

prove2quantum

Let p0,px,py,pz≥0p_0,p_x,p_y,p_z\ge0p0​,px​,py​,pz​≥0 sum to one, with

p0+pz−px−py≥∣p0+py−px−pz∣,p0+pz−px−py≥∣p0+px−py−pz∣.p_0+p_z-p_x-p_y\ge |p_0+p_y-p_x-p_z|,\qquad p_0+p_z-p_x-p_y\ge |p_0+p_x-p_y-p_z|.p0​+pz​−px​−py​≥∣p0​+py​−px​−pz​∣,p0​+pz​−px​−py​≥∣p0​+px​−py​−pz​∣.

In output:environment order on C2⊗C4\mathbb C^2\otimes\mathbb C^4C2⊗C4, put

u=p0∣00⟩+px∣1x⟩+ipy∣1y⟩+pz∣0z⟩,u=\sqrt{p_0}|00\rangle+\sqrt{p_x}|1x\rangle+i\sqrt{p_y}|1y\rangle+\sqrt{p_z}|0z\rangle,u=p0​​∣00⟩+px​​∣1x⟩+ipy​​∣1y⟩+pz​​∣0z⟩, v=p0∣10⟩+px∣0x⟩−ipy∣0y⟩−pz∣1z⟩.v=\sqrt{p_0}|10\rangle+\sqrt{p_x}|0x\rangle-i\sqrt{p_y}|0y\rangle-\sqrt{p_z}|1z\rangle.v=p0​​∣10⟩+px​​∣0x⟩−ipy​​∣0y⟩−pz​​∣1z⟩.

Write ρs=s∣u⟩⟨u∣+(1−s)∣v⟩⟨v∣\rho_s=s|u\rangle\langle u|+(1-s)|v\rangle\langle v|ρs​=s∣u⟩⟨u∣+(1−s)∣v⟩⟨v∣ for 0≤s≤10\le s\le10≤s≤1, ρT=ρ1/2\rho_T=\rho_{1/2}ρT​=ρ1/2​, and h=H2(p0+pz)h=H_2(p_0+p_z)h=H2​(p0​+pz​), where H2(t)=−tlog⁡2t−(1−t)log⁡2(1−t)H_2(t)=-t\log_2t-(1-t)\log_2(1-t)H2​(t)=−tlog2​t−(1−t)log2​(1−t) and 0log⁡20=00\log_2 0=00log2​0=0. Entanglement is measured across the two displayed parties.

For every s∈[0,1]s\in[0,1]s∈[0,1],

Ec(ρs)=Ef(ρs)=h.E_c(\rho_s)=E_f(\rho_s)=h.Ec​(ρs​)=Ef​(ρs​)=h.

Moreover, for each positive integer nnn, form the 2n2^n2n tensor-word projectors from ∣u⟩⟨u∣|u\rangle\langle u|∣u⟩⟨u∣ and ∣v⟩⟨v∣|v\rangle\langle v|∣v⟩⟨v∣. Every convex mixture of these projectors has formation nhnhnh, across all output qubits versus all environments. This assertion does not include arbitrary entangled superpositions of the words.

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.8--9, Example 5 and (14): cost and formation for every mixture,
plus optimality of every convex mixture of the named positive-length tensor words. -/
theorem pauli_mixtures (p : Fin 4 → ℝ) (hp : PauliAdmissible p) :
    (∀ s ∈ Set.Icc (0 : ℝ) 1,
      formationCostBits (pauliMixture p s) = binEntropy2 (p 0 + p 3) ∧
      formation (pauliMixture p s) = binEntropy2 (p 0 + p 3)) ∧
    (∀ n : ℕ, 0 < n → ∀ mu : (Fin n → Fin 2) → ℝ,
      (∀ w, 0 ≤ mu w) → (∑ w, mu w) = 1 →
      formation (pauliWordMixture p n mu) = n * binEntropy2 (p 0 + p 3)) := 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. 9, Example 5: formation and cost for all mixtures of the two Pauli-dilation vectors
Read-back

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

Let p=(p0,p1,p2,p3)p=(p_0,p_1,p_2,p_3)p=(p0​,p1​,p2​,p3​) be real numbers satisfying pi≥0p_i\ge0pi​≥0, ∑ipi=1\sum_ip_i=1∑i​pi​=1, and both inequalities ∣p0+p2−p1−p3∣≤p0+p3−p1−p2|p_0+p_2-p_1-p_3|\le p_0+p_3-p_1-p_2∣p0​+p2​−p1​−p3​∣≤p0​+p3​−p1​−p2​ and ∣p0+p1−p2−p3∣≤p0+p3−p1−p2|p_0+p_1-p_2-p_3|\le p_0+p_3-p_1-p_2∣p0​+p1​−p2​−p3​∣≤p0​+p3​−p1​−p2​. Put h=H2(p0+p3)h=H_2(p_0+p_3)h=H2​(p0​+p3​), where H2(t)=binEntropy⁡(t)/log⁡2H_2(t)=\operatorname{binEntropy}(t)/\log2H2​(t)=binEntropy(t)/log2. Define D(a,r),j=pr(Pr)ajD_{(a,r),j}=\sqrt{p_r}(P_r)_{aj}D(a,r),j​=pr​​(Pr​)aj​, with P0=IP_0=IP0​=I, P1=(0110)P_1=\left(\begin{smallmatrix}0&1\\1&0\end{smallmatrix}\right)P1​=(01​10​), P2=(0−ii0)P_2=\left(\begin{smallmatrix}0&-\mathrm i\\\mathrm i&0\end{smallmatrix}\right)P2​=(0i​−i0​), and P3=diag⁡(1,−1)P_3=\operatorname{diag}(1,-1)P3​=diag(1,−1); let vjv_jvj​ be column jjj of DDD, and set Rs=s v0v0†+(1−s)v1v1†R_s=s\,v_0v_0^\dagger+(1-s)v_1v_1^\daggerRs​=sv0​v0†​+(1−s)v1​v1†​. For a bipartite matrix XXX, define EF(X)E_F(X)EF​(X) as the real infimum of ∑jqjS(Tr⁡B∣ψj⟩⟨ψj∣)\sum_jq_jS(\operatorname{Tr}_B|\psi_j\rangle\langle\psi_j|)∑j​qj​S(TrB​∣ψj​⟩⟨ψj​∣) over every finite family of unit vectors ψj\psi_jψj​ and real weights qj≥0q_j\ge0qj​≥0, ∑jqj=1\sum_jq_j=1∑j​qj​=1, satisfying X=∑jqj∣ψj⟩⟨ψj∣X=\sum_jq_j|\psi_j\rangle\langle\psi_j|X=∑j​qj​∣ψj​⟩⟨ψj​∣, where S(Y)=−Re⁡tr⁡(x↦xlog⁡2x)(Y)S(Y)=-\operatorname{Re}\operatorname{tr}(x\mapsto x\log_2x)(Y)S(Y)=−Retr(x↦xlog2​x)(Y) uses continuous functional calculus. Define EC(X)E_C(X)EC​(X), after the specified fixed bijections reindex both local bases by finite integer sets, as the real infimum of all real EEE such that, for every ε,δ>0\varepsilon,\delta>0ε,δ>0, there exist natural numbers m,nm,nm,n with n>0n>0n>0 and a finite local-operations-and-classical-communication map LLL for which ∣E−m/n∣≤δ|E-m/n|\le\delta∣E−m/n∣≤δ and 12∥L(Φ−⊗m)−X⊗n∥1≤ε\frac12\|L(\Phi_-^{\otimes m})-X^{\otimes n}\|_1\le\varepsilon21​∥L(Φ−⊗m​)−X⊗n∥1​≤ε. Here Φ−=∣ψ−⟩⟨ψ−∣\Phi_-=|\psi_-\rangle\langle\psi_-|Φ−​=∣ψ−​⟩⟨ψ−​∣, ψ−=(∣0,1⟩−∣1,0⟩)/2\psi_-=(|0,1\rangle-|1,0\rangle)/\sqrt2ψ−​=(∣0,1⟩−∣1,0⟩)/2​; tensor powers group the two parties and use the specified finite-index bijections; ∥Z∥1=Re⁡tr⁡Z†Z\|Z\|_1=\operatorname{Re}\operatorname{tr}\sqrt{Z^\dagger Z}∥Z∥1​=RetrZ†Z​; and finite local-operations-and-classical-communication maps are generated from identity maps by finite local Kraus instruments with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I, branch-dependent continuations of the same kind, and summation of the branch outputs. No separate condition E≥0E\ge0E≥0 is inserted in this infimum, and m=0m=0m=0 is allowed. The theorem asserts that for every s∈[0,1]s\in[0,1]s∈[0,1], including both endpoints,

EC(Rs)=h,EF(Rs)=h,E_C(R_s)=h,\qquad E_F(R_s)=h,EC​(Rs​)=h,EF​(Rs​)=h,

and that for every natural number n>0n>0n>0 and every μ:{0,1}n→R\mu:\{0,1\}^n\to\mathbb Rμ:{0,1}n→R with μ(w)≥0\mu(w)\ge0μ(w)≥0 and ∑wμ(w)=1\sum_w\mu(w)=1∑w​μ(w)=1, the vectors Vw(x,r)=∏i=0n−1D(xi,ri),wiV_w(x,r)=\prod_{i=0}^{n-1}D_{(x_i,r_i),w_i}Vw​(x,r)=∏i=0n−1​D(xi​,ri​),wi​​ satisfy

EF ⁣(∑wμ(w)VwVw†)=nh.E_F\!\left(\sum_w\mu(w)V_wV_w^\dagger\right)=n h.EF​(w∑​μ(w)Vw​Vw†​)=nh.

Zero coordinates of ppp and zero weights of μ\muμ are permitted; the second assertion does not quantify over n=0n=0n=0.

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