Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Fig. 2, p. 3 — one use of S = R_{2,2} with two-way classical communication implements a noiseless qubit channel

Proved
RetroCorr.Separation.fig2_noiseless_qubit

by mikedeng1 · Oct 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-protocolretrocorrectable-channeltwo-way-classical-communication

Let S=R2,2S=R_{2,2}S=R2,2​ be the standard retrocorrectable channel with qubit control and qubit data, with its Haar-distributed classical flag k=(B,U1,U2)k=(B,U_1,U_2)k=(B,U1​,U2​). There is a two-way assisted protocol that uses SSS exactly once, with free classical communication in both directions and no prior entanglement, and transmits one qubit without error:

∃ two-way code P with one use of S for 1 qubit:outP(ρ)=ρfor every one-qubit density matrix ρ.\exists\ \text{two-way code }P\text{ with one use of }S\text{ for }1\text{ qubit}:\qquad \mathrm{out}_P(\rho)=\rho\quad\text{for every one-qubit density matrix }\rho .∃ two-way code P with one use of S for 1 qubit:outP​(ρ)=ρfor every one-qubit density matrix ρ.

In the paper's protocol, Alice feeds the control input half of an ebit and the data input the message qubit; Bob announces BBB; Alice measures the other half of the ebit in BTB^TBT and, by the echo effect, obtains the channel's hidden outcome jjj, which she announces; Bob undoes UjU_jUj​. The statement asserts that such a protocol exists in the operational model used to define Q2Q_2Q2​, and that its output equals its input on every state.

Formalization Note TwoWayCode (flagLaw 2 2) (retroBranch 2 2) 1 1 is a code with exactly one channel use for m=1m=1m=1 qubit (QAlgorithms.Qubits 1), in the adaptive model of RetroCorr.Separation.TwoWay; P.output ρ is Bob's final state. The flag is announced to both parties after the use, which is Bob telling Alice BBB over the back channel.

Differences from the source:

  • reading: "Protocol … to implement a noiseless qubit channel" (Fig. 2's specific protocol) → there exists a two-way code with one use of S whose output equals its input; reason: the caption's claim is that the protocol implements the identity channel, and the existence of such a code is that claim in the capacity model
  • encoding: "noiseless qubit channel" → output = input for every one-qubit density matrix; reason: a noiseless channel is the identity on every state
  • encoding: Bob tells Alice B; Alice tells Bob j → the flag and every instrument outcome are public; reason: free two-way classical communication
Preamble
import Mathlib
import Definitions.Def_RetroCorr_Separation_Channel
import Definitions.Def_RetroCorr_Separation_TwoWay
Formal statement
namespace RetroCorr.Separation
theorem fig2_noiseless_qubit :
    ∃ P : TwoWayCode (flagLaw 2 2) (retroBranch 2 2) 1 1,
      ∀ ρ : Matrix (QAlgorithms.Qubits 1) (QAlgorithms.Qubits 1) ℂ,
        QAlgorithms.IsDensityMatrix ρ → P.output ρ = ρ := by sorry
end RetroCorr.Separation
Source
Bennett, Devetak, Shor & Smolin, Inequalities and separations among assisted capacities of quantum channels, arXiv:quant-ph/0406086v1, p. 3, Fig. 2 caption
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · 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