Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Classical/coherent mapping in every signed quadrant

Open
QAlgorithms.Papers.Independent.Support50.P37.signed_classical_coherent_regions

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 all signed real rates c1,c2,ec_1,c_2,ec1​,c2​,e,

RCC(U;c1,c2,e)⟺RCoCo(U;c1,c2,e−min⁡(c1,0)−min⁡(c2,0)).\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-\min(c_1,0)-\min(c_2,0)).RCC​(U;c1​,c2​,e)⟺RCoCo​(U;c1​,c2​,e−min(c1​,0)−min(c2​,0)).

Thus the classical region CCE\mathrm{CCE}CCE determines the coherent region CoCoE\mathrm{CoCoE}CoCoE in every quadrant. For example, consumed communication rates c1=−a,c2=−bc_1=-a,c_2=-bc1​=−a,c2​=−b, with a,b≥0a,b\ge0a,b≥0, shift the coherent entanglement coordinate to e+a+be+a+be+a+b.

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.9, Eq.(31): mapping of the full signed CCE and CoCoE regions.
The preceding prose prints CCC; the displayed formula and the defined region use CCE.
All three coordinates are real, and consumed cobits increase the E coordinate. -/
theorem signed_classical_coherent_regions (U : Resource) (hU : IsIsometricResource U)
    (C1 C2 E : ℝ) :
    AchievesBidirectional U .classical .classical C1 C2 E ↔
      AchievesBidirectional U .coherent .coherent C1 C2
        (E-min C1 0-min C2 0) := by sorry

end QAlgorithms.Papers.Independent.Support50.P37

end
Source
Bidirectional coherent classical communication, arXiv:quant-ph/0412126v3, PDF p. 9, §IV, Eq. (31)
Read-back

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

For every bipartite resource UUU with positive input and output dimensions and map X↦VXV†X\mapsto VXV^\daggerX↦VXV† for an isometry V†V=IV^\dagger V=IV†V=I, and every real C1,C2,EC_1,C_2,EC1​,C2​,E, one has

AU(classical,classical;C1,C2,E)  ⟺  AU ⁣(coherent,coherent;C1,C2,E−min⁡(C1,0)−min⁡(C2,0)).\mathcal A_U(\mathrm{classical},\mathrm{classical};C_1,C_2,E) \iff \mathcal A_U\!\left(\mathrm{coherent},\mathrm{coherent}; C_1,C_2,E-\min(C_1,0)-\min(C_2,0)\right).AU​(classical,classical;C1​,C2​,E)⟺AU​(coherent,coherent;C1​,C2​,E−min(C1​,0)−min(C2​,0)).

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, there is a natural n0≥1n_0\ge1n0​≥1 such that every natural n≥n0n\ge n_0n≥n0​ admits natural 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​) at rates x,y,zx,y,zx,y,z: a negative rate rrr forces production zero and bounds consumption by n(−r+δ)n(-r+\delta)n(−r+δ); a nonnegative rate forces consumption zero and bounds production below by 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 the tensor product of mfm_fmf​ forward resources, mbm_bmb​ backward resources, and eoe_oeo​ entangled-pair preparations. Classical communication transfers a two-dimensional input after deleting its off-diagonal entries; coherent communication 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 communication exchanges the parties; an entangled-pair preparation outputs (∣00⟩+∣11⟩)/2(|00\rangle+|11\rangle)/\sqrt2(∣00⟩+∣11⟩)/2​; and zero copies are identities on one-dimensional registers. Local channels are finite Kraus maps with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I, resource calls preserve accompanying memory, and composition adds counts. Approximation requires the two outputs, after adjoining any positive finite reference register and applying the maps to any positive semidefinite trace-one input, to differ by DDD with 12Re⁡tr⁡D†D≤ε\frac12\operatorname{Re}\operatorname{tr}\sqrt{D^\dagger D}\le\varepsilon21​RetrD†D​≤ε. All three rates may be negative, zero, or positive, and zero rates use the nonnegative branch of the rule.

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