Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Assisting classical and coherent communication

Open
QAlgorithms.Papers.Independent.Support50.P37.assisting_communication

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

prove2quantum

Let UUU be a fixed bipartite unitary or rectangular isometry between nonzero finite-dimensional registers held by Alice and Bob. Local quantum operations and local ancillas are free; every nonlocal call and every supplied EPR pair is counted. A positive signed rate produces a resource and a negative rate consumes it. Write RXY(U;c1,c2,e)\mathcal R_{XY}(U;c_1,c_2,e)RXY​(U;c1​,c2​,e) for simultaneous achievable forward XXX, backward YYY, and ebit rates, where X,Y∈{C,Co,Q}X,Y\in\{\mathrm C,\mathrm{Co},\mathrm Q\}X,Y∈{C,Co,Q} denote dephasing classical bits, coherent copying bits, and noiseless qubits. Achievability means that for every error tolerance ϵ>0\epsilon>0ϵ>0 and rate slack δ>0\delta>0δ>0, all sufficiently large nnn admit a fixed finite protocol with at most nnn uses of UUU, signed resource counts within δ\deltaδ, and joint trace-distance error at most ϵ\epsilonϵ, uniformly over normalized inputs and untouched reference systems. The protocol precedes the input; no external shared seed or catalyst is free.

Let c1,c2≥0c_1,c_2\ge0c1​,c2​≥0 and e∈Re\in\mathbb Re∈R. Both of the following chains hold, with every link an equivalence:

RCC(U;c1,−c2,e)⟺RCC(U;c1,0,e)⟺RCoCo(U;c1,0,e)⟺RCoCo(U;c1,−c2,e+c2),RCC(U;−c1,−c2,e)⟺RCC(U;0,0,e)⟺RCoCo(U;−c1,−c2,e+c1+c2).\begin{gathered} \mathcal R_{\mathrm C\mathrm C}(U;c_1,-c_2,e) \Longleftrightarrow\mathcal R_{\mathrm C\mathrm C}(U;c_1,0,e) \Longleftrightarrow\mathcal R_{\mathrm{Co}\mathrm{Co}}(U;c_1,0,e) \Longleftrightarrow\mathcal R_{\mathrm{Co}\mathrm{Co}}(U;c_1,-c_2,e+c_2),\\[4pt] \mathcal R_{\mathrm C\mathrm C}(U;-c_1,-c_2,e) \Longleftrightarrow\mathcal R_{\mathrm C\mathrm C}(U;0,0,e) \Longleftrightarrow\mathcal R_{\mathrm{Co}\mathrm{Co}}(U;-c_1,-c_2,e+c_1+c_2). \end{gathered}RCC​(U;c1​,−c2​,e)⟺RCC​(U;c1​,0,e)⟺RCoCo​(U;c1​,0,e)⟺RCoCo​(U;c1​,−c2​,e+c2​),RCC​(U;−c1​,−c2​,e)⟺RCC​(U;0,0,e)⟺RCoCo​(U;−c1​,−c2​,e+c1​+c2​).​

Classical assistance does not enlarge these communication or entanglement tradeoffs. Coherent assistance contributes its displayed entanglement increment. The formal statement conjoins the five adjacent equivalences.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P37
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P37

open QAlgorithms.Papers.Independent.Support21.P19

open QAlgorithms.Papers.Independent.Renew46.P34 (rateConstraint)

open scoped Matrix ComplexConjugate

attribute [local instance] Classical.propDecidable Classical.decEq

/-- PDF p.8, Theorem 2, Eqs.(23)–(29): both displayed chains, as five separate
edge equivalences. The nonnegative assisting amounts C1,C2 occur with negative
signed communication rates. E is arbitrary, including entanglement consumption. -/
theorem assisting_communication (U : Resource) (hU : IsIsometricResource U)
    (C1 C2 E : ℝ) (hC1 : 0 ≤ C1) (hC2 : 0 ≤ C2) :
    (AchievesBidirectional U .classical .classical C1 (-C2) E ↔
      AchievesBidirectional U .classical .classical C1 0 E) ∧
    (AchievesBidirectional U .classical .classical C1 0 E ↔
      AchievesBidirectional U .coherent .coherent C1 0 E) ∧
    (AchievesBidirectional U .coherent .coherent C1 0 E ↔
      AchievesBidirectional U .coherent .coherent C1 (-C2) (E+C2)) ∧
    (AchievesBidirectional U .classical .classical (-C1) (-C2) E ↔
      AchievesBidirectional U .classical .classical 0 0 E) ∧
    (AchievesBidirectional U .classical .classical 0 0 E ↔
      AchievesBidirectional U .coherent .coherent (-C1) (-C2) (E+C1+C2)) := by sorry

end QAlgorithms.Papers.Independent.Support50.P37

end
Source
Bidirectional coherent classical communication, arXiv:quant-ph/0412126v3, PDF p. 8, Theorem 2, Eqs. (23)–(29)
Read-back

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

Let UUU be any bipartite resource with positive input and output dimensions and map X↦VXV†X\mapsto VXV^\daggerX↦VXV†, where V†V=IV^\dagger V=IV†V=I, and let C1,C2,EC_1,C_2,EC1​,C2​,E be real numbers with C1,C2≥0C_1,C_2\ge0C1​,C2​≥0. Write AU(s,t;x,y,z)\mathcal A_U(s,t;x,y,z)AU​(s,t;x,y,z) for the following precise property: for every ε,δ>0\varepsilon,\delta>0ε,δ>0, all natural nnn beyond some n0≥1n_0\ge1n0​≥1 admit natural forward, backward, and entanglement consumption/production pairs (fi,mf)(f_i,m_f)(fi​,mf​), (bi,mb)(b_i,m_b)(bi​,mb​), (ei,eo)(e_i,e_o)(ei​,eo​); for each corresponding rate r=x,y,zr=x,y,zr=x,y,z, negative rrr requires production zero and consumption at most n(−r+δ)n(-r+\delta)n(−r+δ), while nonnegative rrr requires consumption zero and production at least n(r−δ)n(r-\delta)n(r−δ). A finite composition of local product channels and resource calls with arbitrary finite local memory must use at most nnn calls to UUU, eie_iei​ entangled-pair preparations, fif_ifi​ forward resources of type sss, and bib_ibi​ backward resources of type ttt, with all other resource counts zero, to approximate mfm_fmf​ forward resources, mbm_bmb​ backward resources, and eoe_oeo​ entangled-pair preparations in tensor product. Classical communication transfers a two-dimensional input with its off-diagonal entries deleted; coherent communication sends ∣i⟩⟨j∣|i\rangle\langle j|∣i⟩⟨j∣ to ∣i,i⟩⟨j,j∣|i,i\rangle\langle j,j|∣i,i⟩⟨j,j∣; reversing a resource exchanges the parties; and each entangled-pair preparation outputs (∣00⟩+∣11⟩)/2(|00\rangle+|11\rangle)/\sqrt2(∣00⟩+∣11⟩)/2​. Zero copies are one-dimensional identities. Local channels are finite Kraus maps with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I, calls leave accompanying memory unchanged, and call counts add under composition. Approximation requires 12Re⁡tr⁡D†D≤ε\frac12\operatorname{Re}\operatorname{tr}\sqrt{D^\dagger D}\le\varepsilon21​RetrD†D​≤ε for the output difference DDD on every density input extended by every positive finite reference register. With this meaning, all five equivalences hold:

AU(classical,classical;C1,−C2,E)  ⟺  AU(classical,classical;C1,0,E),AU(classical,classical;C1,0,E)  ⟺  AU(coherent,coherent;C1,0,E),AU(coherent,coherent;C1,0,E)  ⟺  AU(coherent,coherent;C1,−C2,E+C2),AU(classical,classical;−C1,−C2,E)  ⟺  AU(classical,classical;0,0,E),AU(classical,classical;0,0,E)  ⟺  AU(coherent,coherent;−C1,−C2,E+C1+C2).\begin{aligned} \mathcal A_U(\mathrm{classical},\mathrm{classical};C_1,-C_2,E) &\iff\mathcal A_U(\mathrm{classical},\mathrm{classical};C_1,0,E),\\ \mathcal A_U(\mathrm{classical},\mathrm{classical};C_1,0,E) &\iff\mathcal A_U(\mathrm{coherent},\mathrm{coherent};C_1,0,E),\\ \mathcal A_U(\mathrm{coherent},\mathrm{coherent};C_1,0,E) &\iff\mathcal A_U(\mathrm{coherent},\mathrm{coherent};C_1,-C_2,E+C_2),\\ \mathcal A_U(\mathrm{classical},\mathrm{classical};-C_1,-C_2,E) &\iff\mathcal A_U(\mathrm{classical},\mathrm{classical};0,0,E),\\ \mathcal A_U(\mathrm{classical},\mathrm{classical};0,0,E) &\iff\mathcal A_U(\mathrm{coherent},\mathrm{coherent};-C_1,-C_2,E+C_1+C_2). \end{aligned}AU​(classical,classical;C1​,−C2​,E)AU​(classical,classical;C1​,0,E)AU​(coherent,coherent;C1​,0,E)AU​(classical,classical;−C1​,−C2​,E)AU​(classical,classical;0,0,E)​⟺AU​(classical,classical;C1​,0,E),⟺AU​(coherent,coherent;C1​,0,E),⟺AU​(coherent,coherent;C1​,−C2​,E+C2​),⟺AU​(classical,classical;0,0,E),⟺AU​(coherent,coherent;−C1​,−C2​,E+C1​+C2​).​

The hypotheses allow C1=0C_1=0C1​=0 or C2=0C_2=0C2​=0, and impose no sign condition on EEE.

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