Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The full quantum/coherent bidirectional region square

Open
QAlgorithms.Papers.Independent.Support50.P37.quantum_coherent_region_square

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 arbitrary q1,q2,e∈Rq_1,q_2,e\in\mathbb Rq1​,q2​,e∈R, define the four propositions

A=RQQ(U;q1,q2,e),B=RCoQ(U;2q1,q2,e−q1),C=RQCo(U;q1,2q2,e−q2),D=RCoCo(U;2q1,2q2,e−q1−q2).\begin{aligned} A&=\mathcal R_{\mathrm Q\mathrm Q}(U;q_1,q_2,e),\\ B&=\mathcal R_{\mathrm{Co}\mathrm Q}(U;2q_1,q_2,e-q_1),\\ C&=\mathcal R_{\mathrm Q\mathrm{Co}}(U;q_1,2q_2,e-q_2),\\ D&=\mathcal R_{\mathrm{Co}\mathrm{Co}}(U;2q_1,2q_2,e-q_1-q_2). \end{aligned}ABCD​=RQQ​(U;q1​,q2​,e),=RCoQ​(U;2q1​,q2​,e−q1​),=RQCo​(U;q1​,2q2​,e−q2​),=RCoCo​(U;2q1​,2q2​,e−q1​−q2​).​

Every edge of the square is an equivalence:

(A⟺B) ∧ (A⟺C) ∧ (B⟺D) ∧ (C⟺D).(A\Longleftrightarrow B)\ \land\ (A\Longleftrightarrow C)\ \land\ (B\Longleftrightarrow D)\ \land\ (C\Longleftrightarrow D).(A⟺B) ∧ (A⟺C) ∧ (B⟺D) ∧ (C⟺D).

This determines all four quantum/coherent bidirectional regions from any one of them. It is an asymptotic statement with counted startup and recycling; finite coherent teleportation's returned catalyst is not a free input.

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.(33): all four edges of the quantum/coherent rate-region square.
Rates Q1,Q2,E are signed. This is an asymptotic assertion: the finite coherent
teleportation catalyst must be generated and recycled through counted calls.
No finite zero-seed two-cobit equality is asserted. -/
theorem quantum_coherent_region_square (U : Resource) (hU : IsIsometricResource U)
    (Q1 Q2 E : ℝ) :
    (AchievesBidirectional U .quantum .quantum Q1 Q2 E ↔
      AchievesBidirectional U .coherent .quantum (2*Q1) Q2 (E-Q1)) ∧
    (AchievesBidirectional U .quantum .quantum Q1 Q2 E ↔
      AchievesBidirectional U .quantum .coherent Q1 (2*Q2) (E-Q2)) ∧
    (AchievesBidirectional U .coherent .quantum (2*Q1) Q2 (E-Q1) ↔
      AchievesBidirectional U .coherent .coherent (2*Q1) (2*Q2) (E-Q1-Q2)) ∧
    (AchievesBidirectional U .quantum .coherent Q1 (2*Q2) (E-Q2) ↔
      AchievesBidirectional U .coherent .coherent (2*Q1) (2*Q2) (E-Q1-Q2)) := by sorry

end QAlgorithms.Papers.Independent.Support50.P37

end
Source
Bidirectional coherent classical communication, arXiv:quant-ph/0412126v3, PDF p. 9, §IV, Eq. (33)
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 Q1,Q2,EQ_1,Q_2,EQ1​,Q2​,E be arbitrary real numbers. Define AU(s,t;x,y,z)\mathcal A_U(s,t;x,y,z)AU​(s,t;x,y,z) to mean that for every ε,δ>0\varepsilon,\delta>0ε,δ>0, every sufficiently large natural nnn, starting at some n0≥1n_0\ge1n0​≥1, admits 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​) satisfying the following rule at rates x,y,zx,y,zx,y,z: a negative rate rrr forces production zero and permits consumption at most n(−r+δ)n(-r+\delta)n(−r+δ), whereas a nonnegative rate forces consumption zero and requires production at least n(r−δ)n(r-\delta)n(r−δ). There must be a finite sequential composition of local product channels and resource calls with arbitrary finite local memory, using 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 no calls to other resource kinds, approximating the tensor product of mfm_fmf​ forward resources, mbm_bmb​ backward resources, and eoe_oeo​ entangled-pair preparations. A quantum resource transfers a two-dimensional input unchanged to the other party; 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∣; a backward resource 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 means that every density input, including any positive finite reference register, yields output difference DDD satisfying 12Re⁡tr⁡D†D≤ε\frac12\operatorname{Re}\operatorname{tr}\sqrt{D^\dagger D}\le\varepsilon21​RetrD†D​≤ε. With this definition, the declaration asserts the conjunction

AU(quantum,quantum;Q1,Q2,E)  ⟺  AU(coherent,quantum;2Q1,Q2,E−Q1),AU(quantum,quantum;Q1,Q2,E)  ⟺  AU(quantum,coherent;Q1,2Q2,E−Q2),AU(coherent,quantum;2Q1,Q2,E−Q1)  ⟺  AU(coherent,coherent;2Q1,2Q2,E−Q1−Q2),AU(quantum,coherent;Q1,2Q2,E−Q2)  ⟺  AU(coherent,coherent;2Q1,2Q2,E−Q1−Q2).\begin{aligned} \mathcal A_U(\mathrm{quantum},\mathrm{quantum};Q_1,Q_2,E) &\iff \mathcal A_U(\mathrm{coherent},\mathrm{quantum};2Q_1,Q_2,E-Q_1),\\ \mathcal A_U(\mathrm{quantum},\mathrm{quantum};Q_1,Q_2,E) &\iff \mathcal A_U(\mathrm{quantum},\mathrm{coherent};Q_1,2Q_2,E-Q_2),\\ \mathcal A_U(\mathrm{coherent},\mathrm{quantum};2Q_1,Q_2,E-Q_1) &\iff \mathcal A_U(\mathrm{coherent},\mathrm{coherent};2Q_1,2Q_2,E-Q_1-Q_2),\\ \mathcal A_U(\mathrm{quantum},\mathrm{coherent};Q_1,2Q_2,E-Q_2) &\iff \mathcal A_U(\mathrm{coherent},\mathrm{coherent};2Q_1,2Q_2,E-Q_1-Q_2). \end{aligned}AU​(quantum,quantum;Q1​,Q2​,E)AU​(quantum,quantum;Q1​,Q2​,E)AU​(coherent,quantum;2Q1​,Q2​,E−Q1​)AU​(quantum,coherent;Q1​,2Q2​,E−Q2​)​⟺AU​(coherent,quantum;2Q1​,Q2​,E−Q1​),⟺AU​(quantum,coherent;Q1​,2Q2​,E−Q2​),⟺AU​(coherent,coherent;2Q1​,2Q2​,E−Q1​−Q2​),⟺AU​(coherent,coherent;2Q1​,2Q2​,E−Q1​−Q2​).​

No nonnegativity assumptions are imposed on Q1,Q2,EQ_1,Q_2,EQ1​,Q2​,E; negative and zero rates retain exactly the consumption and production rules specified above.

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