Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered main example: nondegradable channels with equal private and quantum capacities

Open
QAlgorithms.Papers.Independent.Support50.P07.nondegradable_equalCapacities_example

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

There exist extremal qubit channels N1,N2\mathcal N_1,\mathcal N_2N1​,N2​, each with a two-dimensional environment, such that N1\mathcal N_1N1​ is degradable but not antidegradable and N2\mathcal N_2N2​ is antidegradable but not degradable. Their product is extremal among all CPTP maps on two qubits and is neither degradable nor antidegradable and satisfies

CDM(N1⊗N2)=Q(N1⊗N2)=Q(1)(N1),Cp(N1⊗N2)=Q(N1⊗N2).C_{DM}(\mathcal N_1\otimes\mathcal N_2)=Q(\mathcal N_1\otimes\mathcal N_2)=Q^{(1)}(\mathcal N_1),\qquad C_p(\mathcal N_1\otimes\mathcal N_2)=Q(\mathcal N_1\otimes\mathcal N_2).CDM​(N1​⊗N2​)=Q(N1​⊗N2​)=Q(1)(N1​),Cp​(N1​⊗N2​)=Q(N1​⊗N2​).

Here QQQ is the operational unassisted quantum capacity.

All quantum registers are finite and nonzero, states have trace one, pure vectors have norm one, and entropy and logarithms are in bits. Operational private capacities use memoryless powers, positive blocklengths and message counts, uniform messages, arbitrary mixed block inputs, and normalized decoding POVMs. A code is good when its joint decoded message/environment state has full trace norm less than the error from a perfectly correlated uniform pair tensor its actual common environment marginal. Rates use every positive error and rate slack at all sufficiently large blocklengths. Symmetric assistance allows one arbitrary finite symmetric channel per block without charging its dimension.

This result supplies a capacity identity or bound for the channel family and resource model stated above.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P07
Formal statement
noncomputable section

open scoped BigOperators Matrix ComplexConjugate ComplexOrder

open Filter

namespace QAlgorithms.Papers.Independent.Support50.P07

open QAlgorithms.Papers.Independent.Information100.P67
  (IsIsometry receiverChannel complementaryChannel IsDegradable IsAntidegradable
    dilationPower idealJoint maximumCoherentInformation)

open QAlgorithms.Papers.Independent.Claimed50.P24 (productDilation)

open QAlgorithms.Papers.Independent.Dependency50.P19 (mutualInformation)

variable {A B E C D F : Type}

variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]

variable [Fintype E] [DecidableEq E] [Fintype C] [DecidableEq C]

variable [Fintype D] [DecidableEq D] [Fintype F] [DecidableEq F]

/-- PDF p.5, example acknowledged to Debbie Leung [27]: an actual product of
extremal qubit channels supplies the existential nondegradable example. Extremality
is in the full convex set of CPTP receiver maps, including for their product.
No genericity measure is invented. Quantum capacity and mixing cost are identified. -/
theorem nondegradable_equalCapacities_example :
    ∃ U V : Matrix (Fin 2 × Fin 2) (Fin 2) ℂ,
      IsIsometry U ∧ IsIsometry V ∧
      receiverChannel U ∈ Set.extremePoints ℝ
        {N : Superop (Fin 2) (Fin 2) | IsChannel N} ∧
      receiverChannel V ∈ Set.extremePoints ℝ
        {N : Superop (Fin 2) (Fin 2) | IsChannel N} ∧
      receiverChannel (productDilation U V) ∈ Set.extremePoints ℝ
        {N : Superop (Fin 2 × Fin 2) (Fin 2 × Fin 2) | IsChannel N} ∧
      IsDegradable U ∧ ¬ IsAntidegradable U ∧
      IsAntidegradable V ∧ ¬ IsDegradable V ∧
      ¬ IsDegradable (productDilation U V) ∧ ¬ IsAntidegradable (productDilation U V) ∧
      degradableMixingCost (productDilation U V) = maximumCoherentInformation U ∧
      QAlgorithms.Papers.Independent.Information100.P80.quantumCapacity
        (receiverChannel (productDilation U V)) = maximumCoherentInformation U ∧
      fullTracePrivateCapacity (productDilation U V) = QAlgorithms.Papers.Independent.Information100.P80.quantumCapacity
        (receiverChannel (productDilation U V)) := by sorry

end QAlgorithms.Papers.Independent.Support50.P07

end
Source
The private classical capacity with a symmetric side channel and its application to quantum cryptography, arXiv:0705.3838v1, PDF p. 5, Unnumbered main example: nondegradable channels with equal private and quantum capacities
Read-back

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

There exist matrices U,V:C2→C2⊗C2U,V:\mathbb C^2\to\mathbb C^2\otimes\mathbb C^2U,V:C2→C2⊗C2 with U†U=V†V=I2U^\dagger U=V^\dagger V=I_2U†U=V†V=I2​, having all the properties below. For a dilation W:I→O⊗FW:I\to O\otimes FW:I→O⊗F, write NW(ρ)=Tr⁡F(WρW†)N_W(\rho)=\operatorname{Tr}_F(W\rho W^\dagger)NW​(ρ)=TrF​(WρW†) and NWc(ρ)=Tr⁡O(WρW†)N_W^c(\rho)=\operatorname{Tr}_O(W\rho W^\dagger)NWc​(ρ)=TrO​(WρW†). A channel is a map Φ(X)=∑jKjXKj†\Phi(X)=\sum_jK_jXK_j^\daggerΦ(X)=∑j​Kj​XKj†​ for a finite family satisfying ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I. Say that WWW is degradable when W†W=IW^\dagger W=IW†W=I and there is a channel D:O→FD:O\to FD:O→F with NWc=D∘NWN_W^c=D\circ N_WNWc​=D∘NW​ on every matrix; say that it is antidegradable when W†W=IW^\dagger W=IW†W=I and there is a channel D:F→OD:F\to OD:F→O with NW=D∘NWcN_W=D\circ N_W^cNW​=D∘NWc​ on every matrix. Define their product dilation by

Z((b,d),(e,f)),(a,c)=U(b,e),aV(d,f),c.Z_{((b,d),(e,f)),(a,c)}=U_{(b,e),a}V_{(d,f),c}.Z((b,d),(e,f)),(a,c)​=U(b,e),a​V(d,f),c​.

The channels NUN_UNU​ and NVN_VNV​ are extreme points of the real convex set of all channels from 2×22\times22×2 matrices to 2×22\times22×2 matrices, and NZN_ZNZ​ is an extreme point of the corresponding real convex set of channels on 4×44\times44×4 matrices. Moreover, UUU is degradable and is not antidegradable; VVV is antidegradable and is not degradable; and ZZZ is neither degradable nor antidegradable. For a density matrix, meaning a positive semidefinite matrix of trace 111, let S(ρ)=−Tr⁡(ρlog⁡2ρ)S(\rho)=-\operatorname{Tr}(\rho\log_2\rho)S(ρ)=−Tr(ρlog2​ρ), with zero eigenvalues contributing zero, and define

Imax⁡(W)=sup⁡ρ a density matrix[S(NW(ρ))−S(NWc(ρ))].I_{\max}(W)=\sup_{\rho\text{ a density matrix}} \bigl[S(N_W(\rho))-S(N_W^c(\rho))\bigr].Imax​(W)=ρ a density matrixsup​[S(NW​(ρ))−S(NWc​(ρ))].

Define Cmix(Z)C_{\mathrm{mix}}(Z)Cmix​(Z) as the real infimum of ∑i=0k−1piImax⁡(Wi)\sum_{i=0}^{k-1}p_iI_{\max}(W_i)∑i=0k−1​pi​Imax​(Wi​) over all integers k>0k>0k>0, weights pi≥0p_i\ge0pi​≥0 with ∑ipi=1\sum_i p_i=1∑i​pi​=1, positive integers bi,eib_i,e_ibi​,ei​, isometries Wi:C4→Cbi⊗CeiW_i:\mathbb C^4\to\mathbb C^{b_i}\otimes\mathbb C^{e_i}Wi​:C4→Cbi​⊗Cei​ each of which is degradable or antidegradable, and channels Ti:bi→4T_i:b_i\to4Ti​:bi​→4, such that

NZ(ρ)=∑ipiTi(NWi(ρ))N_Z(\rho)=\sum_i p_iT_i(N_{W_i}(\rho))NZ​(ρ)=i∑​pi​Ti​(NWi​​(ρ))

for every matrix ρ\rhoρ; zero weights are allowed. Define Ptr(Z)P_{\mathrm{tr}}(Z)Ptr​(Z) as the real supremum of rates r≥0r\ge0r≥0 such that, for every ε>0\varepsilon>0ε>0 and s>0s>0s>0, there exists n0>0n_0>0n0​>0 for which every n≥n0n\ge n_0n≥n0​ admits M>0M>0M>0, input density matrices ρm\rho_mρm​ on (C4)⊗n(\mathbb C^4)^{\otimes n}(C4)⊗n, and a measurement Qj≥0Q_j\ge0Qj​≥0, ∑jQj=I\sum_jQ_j=I∑j​Qj​=I, on the receiver output, whose joint matrix has blocks

Ω(m,j,e),(m,j,e′)=1M∑b,c(Qj)c,b(Z⊗nρm(Z⊗n)†)(b,e),(c,e′)\Omega_{(m,j,e),(m,j,e')}=\frac1M\sum_{b,c}(Q_j)_{c,b}(Z^{\otimes n}\rho_m(Z^{\otimes n})^\dagger)_{(b,e),(c,e')}Ω(m,j,e),(m,j,e′)​=M1​b,c∑​(Qj​)c,b​(Z⊗nρm​(Z⊗n)†)(b,e),(c,e′)​

and zero entries between different mmm or jjj, and satisfies

∥Ω−1M∑m∣m,m⟩⟨m,m∣⊗Tr⁡m,jΩ∥1<ε,r−s≤log⁡2Mn.\left\|\Omega-\frac1M\sum_m|m,m\rangle\langle m,m|\otimes\operatorname{Tr}_{m,j}\Omega\right\|_1<\varepsilon, \qquad r-s\le\frac{\log_2M}{n}.​Ω−M1​m∑​∣m,m⟩⟨m,m∣⊗Trm,j​Ω​1​<ε,r−s≤nlog2​M​.

Here ∥X∥1=Tr⁡X†X\|X\|_1=\operatorname{Tr}\sqrt{X^\dagger X}∥X∥1​=TrX†X​. Define Q(NZ)Q(N_Z)Q(NZ​) as the real supremum of nonnegative rates admitting a sequence of positive integers MnM_nMn​ and encoding and decoding channels En:Mn→4n\mathcal E_n:M_n\to4^nEn​:Mn​→4n, Dn:4n→Mn\mathcal D_n:4^n\to M_nDn​:4n→Mn​, whose entanglement fidelities

Tr⁡ ⁣[ΦMn(id⁡Mn⊗(Dn∘NZ⊗n∘En))(ΦMn)]\operatorname{Tr}\!\left[\Phi_{M_n} (\operatorname{id}_{M_n}\otimes(\mathcal D_n\circ N_Z^{\otimes n}\circ\mathcal E_n))(\Phi_{M_n})\right]Tr[ΦMn​​(idMn​​⊗(Dn​∘NZ⊗n​∘En​))(ΦMn​​)]

tend to 111, and for which, for every s>0s>0s>0, r−s≤log⁡2Mn/nr-s\le\log_2M_n/nr−s≤log2​Mn​/n eventually; ΦM\Phi_MΦM​ is the projector onto M−1/2∑j∣j,j⟩M^{-1/2}\sum_j|j,j\rangleM−1/2∑j​∣j,j⟩. This sequence includes n=0n=0n=0, with empty tensor products and total division by zero. The asserted numerical equalities are

Cmix(Z)=Imax⁡(U),Q(NZ)=Imax⁡(U),Ptr(Z)=Q(NZ).C_{\mathrm{mix}}(Z)=I_{\max}(U),\qquad Q(N_Z)=I_{\max}(U),\qquad P_{\mathrm{tr}}(Z)=Q(N_Z).Cmix​(Z)=Imax​(U),Q(NZ​)=Imax​(U),Ptr​(Z)=Q(NZ​).
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 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