Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Bidirectional coherification with arbitrary signed entanglement

Open
QAlgorithms.Papers.Independent.Support50.P37.bidirectional_coherification

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.

For any c1,c2≥0c_1,c_2\ge0c1​,c2​≥0 and any e∈Re\in\mathbb Re∈R,

RCC(U;c1,c2,e)⟺RCoCo(U;c1,c2,e).\mathcal R_{\mathrm C\mathrm C}(U;c_1,c_2,e) \quad\Longleftrightarrow\quad \mathcal R_{\mathrm{Co}\mathrm{Co}}(U;c_1,c_2,e).RCC​(U;c1​,c2​,e)⟺RCoCo​(U;c1​,c2​,e).

This identifies the entire nonnegative communication quadrant, retaining the same signed entanglement rate, including zero communication rates.

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.3, Theorem 1, Eqs.(2)–(3), including the signed-E extensions on p.8.
The p.1 abstract is instantiated by this nonnegative-communication quadrant.
E<0 consumes nonnegative EPR counts of rate -E, as defined on p.2; the negative
EPR-copy exponent printed in Eq.(21) is not used as a tensor exponent. -/
theorem bidirectional_coherification (U : Resource) (hU : IsIsometricResource U)
    (C1 C2 E : ℝ) (hC1 : 0 ≤ C1) (hC2 : 0 ≤ C2) :
    AchievesBidirectional U .classical .classical C1 C2 E ↔
      AchievesBidirectional U .coherent .coherent C1 C2 E := by sorry

end QAlgorithms.Papers.Independent.Support50.P37

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

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

Let UUU be any bipartite resource whose four input and output dimensions are positive and whose map is X↦VXV†X\mapsto VXV^\daggerX↦VXV† for some matrix VVV with V†V=IV^\dagger V=IV†V=I. For all real C1,C2,EC_1,C_2,EC1​,C2​,E with C1,C2≥0C_1,C_2\ge0C1​,C2​≥0, the declaration asserts

AU(classical,classical;C1,C2,E)  ⟺  AU(coherent,coherent;C1,C2,E).\mathcal A_U(\mathrm{classical},\mathrm{classical};C_1,C_2,E) \iff \mathcal A_U(\mathrm{coherent},\mathrm{coherent};C_1,C_2,E).AU​(classical,classical;C1​,C2​,E)⟺AU​(coherent,coherent;C1​,C2​,E).

Here AU(s,t;x,y,z)\mathcal A_U(s,t;x,y,z)AU​(s,t;x,y,z) means that for every ε,δ>0\varepsilon,\delta>0ε,δ>0, for every sufficiently large natural nnn starting at some n0≥1n_0\ge1n0​≥1, there are natural consumption and production counts (fi,mf)(f_i,m_f)(fi​,mf​), (bi,mb)(b_i,m_b)(bi​,mb​), (ei,eo)(e_i,e_o)(ei​,eo​) satisfying this rule at rates x,y,zx,y,zx,y,z, respectively: a negative rate rrr requires zero production and consumption at most n(−r+δ)n(-r+\delta)n(−r+δ), while a nonnegative rate requires zero consumption and production at least n(r−δ)n(r-\delta)n(r−δ). A finite sequential composition of local product channels and resource calls, allowing 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, and no other resource kinds, to approximate the tensor product of mfm_fmf​ forward resources, mbm_bmb​ backward resources, and eoe_oeo​ entangled-pair preparations. A classical resource transfers a two-dimensional input after deleting its off-diagonal entries; a coherent resource maps ∣i⟩⟨j∣|i\rangle\langle j|∣i⟩⟨j∣ to ∣i,i⟩⟨j,j∣|i,i\rangle\langle j,j|∣i,i⟩⟨j,j∣; backward resources exchange the parties, and an entangled-pair preparation outputs (∣00⟩+∣11⟩)/2(|00\rangle+|11\rangle)/\sqrt2(∣00⟩+∣11⟩)/2​. Zero copies are identities on one-dimensional registers. Local channels have finite Kraus representations with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I, resource calls preserve their accompanying local memory, and composition adds call counts. Approximation means that for every positive finite reference dimension and every positive semidefinite trace-one input matrix MMM, the two reference-extended outputs differ by a matrix DDD with 12Re⁡tr⁡D†D≤ε\frac12\operatorname{Re}\operatorname{tr}\sqrt{D^\dagger D}\le\varepsilon21​RetrD†D​≤ε. The entanglement rate EEE may have either sign, and either communication rate may be zero.

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