Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered result: pinching-channel EPR–GHZ boundary

Open
QAlgorithms.Papers.Independent.Gap48.P39.pinching_qq_boundary

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

prove2quantum

Let U:A′→BCU:A'\to BCU:A′→BC be any full-environment isometric extension of qutrit rank-(2,1)(2,1)(2,1) pinching: Bob's marginal retains the upper-left two-by-two block and the final diagonal entry and deletes all coherences between those blocks. Its closed unassisted EPR–GHZ region, in coordinate order (Q,QB)=(GHZ,Alice–Bob EPR)(Q,Q_B)=(\text{GHZ},\text{Alice–Bob EPR})(Q,QB​)=(GHZ,Alice–Bob EPR), is the nonnegative downward closure of

(Q,QB)=(f(p),p),0≤p≤1,f(p)={1,p≤12,H2(p),p>12.(Q,Q_B)=(f(p),p),\qquad 0\le p\le1,\qquad f(p)=\begin{cases}1,&p\le\tfrac12,\\H_2(p),&p>\tfrac12.\end{cases}(Q,QB​)=(f(p),p),0≤p≤1,f(p)={1,H2​(p),​p≤21​,p>21​.​

Here H2H_2H2​ is binary entropy in bits; a block code is tested jointly against the product of GHZ and EPR targets using squared fidelity, with no initial shared resources or side communication. In particular (1,1/2)(1,1/2)(1,1/2) and (0,1)(0,1)(0,1) are allowed. This follows the explicit equation (25) and Theorem 6, recording the paper's incompatible Figure 1 rather than swapping the resources.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P39
Formal statement
noncomputable section

open scoped BigOperators Matrix ComplexConjugate

namespace QAlgorithms.Papers.Independent.Gap48.P39

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

open QAlgorithms.Papers.Independent.Information100.P03 (PureEnsemble)

open QAlgorithms.Papers.Independent.Claimed50.P08 (cqBlocks holevoInfo)

open QAlgorithms.Papers.Independent.Dependency50.P19 (both epr mutualInformation marginalRA marginalRB)

open QAlgorithms.Papers.Independent.Information100.P58 (Distribution)

open QAlgorithms.Papers.Independent.Information100.P67 (squaredFidelity conditionalEntropy groupedChannelPower)

attribute [local instance] Classical.propDecidable Classical.decEq

variable {A B C X T E : Type}

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

variable [Fintype C] [DecidableEq C] [Fintype X] [DecidableEq X]

variable [Fintype T] [DecidableEq T] [Fintype E] [DecidableEq E]

/-- Unnumbered specialization after Theorem 6, PDF p.11 and (25) p.8.
Coordinates are (GHZ,EPR_B); follow (25) rather than the erroneous Figure 1. -/
theorem pinching_qq_boundary [Nonempty C]
    (U : Matrix (Fin 3 × C) (Fin 3) ℂ) (hU : Uᴴ * U = 1)
    (hP : ∀ rho, traceRight (conjSuperop U rho) = qutritPinching rho) :
    qqCapacity (conjSuperop U) = pinchingRegion := by sorry

end QAlgorithms.Papers.Independent.Gap48.P39

end
Source
Quantum broadcast channels, arXiv:quant-ph/0603098v2, PDF p. 11, Unnumbered result: pinching-channel EPR–GHZ boundary
Read-back

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

Let CCC be a nonempty finite index type with decidable equality, and let U:C3→CFin(3)×CU:\mathbb C^3\to\mathbb C^{\mathrm{Fin}(3)\times C}U:C3→CFin(3)×C satisfy U†U=I3U^\dagger U=I_3U†U=I3​. Assume that for every complex 3×33\times33×3 matrix ρ\rhoρ, the partial trace over CCC of UρU†U\rho U^\daggerUρU† retains exactly the entries whose row and column indices both belong to {0,1}\{0,1\}{0,1} or both equal 222, and sets the other entries to zero. Set N(ρ)=UρU†\mathcal N(\rho)=U\rho U^\daggerN(ρ)=UρU†. Its EPR–GHZ capacity is the closure of all nonnegative pairs (r1,r2)(r_1,r_2)(r1​,r2​) such that for every ϵ>0\epsilon>0ϵ>0, for every sufficiently large integer nnn, with m=⌊2nr1⌋m=\lfloor2^{nr_1}\rfloorm=⌊2nr1​⌋ and k=⌊2nr2⌋k=\lfloor2^{nr_2}\rfloork=⌊2nr2​⌋, there exist a unit vector on (Fin(k)×Fin(m))×Fin(3)n(\mathrm{Fin}(k)\times\mathrm{Fin}(m))\times\mathrm{Fin}(3)^n(Fin(k)×Fin(m))×Fin(3)n, a channel from Bob’s output Fin(3)n\mathrm{Fin}(3)^nFin(3)n to Fin(k)×Fin(m)\mathrm{Fin}(k)\times\mathrm{Fin}(m)Fin(k)×Fin(m), and a channel from Charlie’s output CnC^nCn to Fin(m)\mathrm{Fin}(m)Fin(m), such that after N⊗n\mathcal N^{\otimes n}N⊗n and these decoders, leaving the reference registers untouched, the squared fidelity with an EPR state k−1/2∑i<k∣i,i⟩k^{-1/2}\sum_{i<k}|i,i\ranglek−1/2∑i<k​∣i,i⟩ between the first reference and Bob’s first output, tensored with the pure GHZ state m−1/2∑s<m∣s,s,s⟩m^{-1/2}\sum_{s<m}|s,s,s\ranglem−1/2∑s<m​∣s,s,s⟩ on the other reference and outputs, is at least 1−ϵ1-\epsilon1−ϵ. Channels have finite Kraus representations Φ(Z)=∑aKaZKa†\Phi(Z)=\sum_aK_aZK_a^\daggerΦ(Z)=∑a​Ka​ZKa†​ with ∑aKa†Ka=I\sum_aK_a^\dagger K_a=I∑a​Ka†​Ka​=I, and squared fidelity is (Re⁡tr⁡Z WZ)2\bigl(\operatorname{Re}\operatorname{tr}\sqrt{\sqrt Z\,W\sqrt Z}\bigr)^2(RetrZ​WZ​​)2. The asserted capacity is exactly

{(r1,r2):r1,r2≥0, ∃p∈[0,1], r2≤p,r1≤{1,p≤12,[−pln⁡p−(1−p)ln⁡(1−p)]/ln⁡2,p>12}.\left\{(r_1,r_2):r_1,r_2\ge0,\ \exists p\in[0,1],\ r_2\le p,\quad r_1\le \begin{cases} 1,&p\le\tfrac12,\\ [-p\ln p-(1-p)\ln(1-p)]/\ln2,&p>\tfrac12 \end{cases}\right\}.{(r1​,r2​):r1​,r2​≥0, ∃p∈[0,1], r2​≤p,r1​≤{1,[−plnp−(1−p)ln(1−p)]/ln2,​p≤21​,p>21​​}.

The closure uses the usual topology on R2\mathbb R^2R2, 0ln⁡0=00\ln0=00ln0=0, and zero rates are included.

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

    Confirmed by the moderator at approval.

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