Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, p. 3 — echo effect: on the maximally entangled state, measuring the reference in B^T and the control in B gives equal outcomes, P(i, j) = δ_ij / c

Proved
RetroCorr.Separation.echo_effect

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

maximally-entangled-statep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1quantum-measurementretrocorrectable-channel

Let c≥1c\ge1c≥1, let W∈U(c)W\in U(c)W∈U(c) be a unitary with columns w1,…,wcw_1,\dots,w_cw1​,…,wc​ (the basis BBB), and let Φc=c−1/2∑a∣a⟩ref∣a⟩ctrl\Phi_c=c^{-1/2}\sum_{a}|a\rangle_{\mathrm{ref}}|a\rangle_{\mathrm{ctrl}}Φc​=c−1/2∑a​∣a⟩ref​∣a⟩ctrl​ be the maximally entangled state of a reference system and the control. Measure the reference in the basis BTB^TBT, whose projectors are (∣wi⟩⟨wi∣)T=∣wˉi⟩⟨wˉi∣(|w_i\rangle\langle w_i|)^T=|\bar w_i\rangle\langle\bar w_i|(∣wi​⟩⟨wi​∣)T=∣wˉi​⟩⟨wˉi​∣, and the control in the basis BBB. Then for all i,ji,ji,j,

Pr⁡[reference gives i, control gives j]=Tr⁡ ⁣[((∣wi⟩⟨wi∣)T⊗∣wj⟩⟨wj∣) ∣Φc⟩⟨Φc∣]={1/c,i=j,0,i≠j.\Pr[\text{reference gives } i,\ \text{control gives } j]=\operatorname{Tr}\!\Big[\big((|w_i\rangle\langle w_i|)^T\otimes|w_j\rangle\langle w_j|\big)\,|\Phi_c\rangle\langle\Phi_c|\Big]=\begin{cases}1/c,& i=j,\\ 0,& i\ne j.\end{cases}Pr[reference gives i, control gives j]=Tr[((∣wi​⟩⟨wi​∣)T⊗∣wj​⟩⟨wj​∣)∣Φc​⟩⟨Φc​∣]={1/c,0,​i=j,i=j.​

So the two outcomes always agree: the measurement of the other half of the entangled pair in BTB^TBT reproduces ("echoes") the result jjj of the channel's measurement of the control in BBB, whatever BBB is. This is the identity behind the protocol of Fig. 2.

Formalization Note The projectors are transposeBasisProj W i and basisProj W j, the state is maxEntDensity c on Fin c × Fin c (reference first), and the probability is QAlgorithms.effectProb (the real part of the trace). For c=0c=0c=0 there are no outcomes and the statement is empty.

Differences from the source:

  • generalization: the control is a qubit and the pair an ebit (c = 2) → every c, with the maximally entangled state Φ_c; reason: at c = 2 it is the paper's statement
  • reading: "measure the other half in the basis B^T" → the projectors (|w_i⟩⟨w_i|)^T = |w̄_i⟩⟨w̄_i|; reason: B^T is the basis of transposed projectors of B
  • reading: "creating an echo of the measurement result j" → the joint outcome law of the B^T measurement on the reference and the B measurement on the control is δ_ij / c; reason: perfect correlation of the two outcomes is the echo
  • encoding: basis B, outcomes 1…c → columns of a unitary W, outcomes in Fin c (0-based); reason: Lean convention; same bases
Preamble
import Mathlib
import Definitions.Def_RetroCorr_Separation_Channel
Formal statement
namespace RetroCorr.Separation
theorem echo_effect (c : ℕ) (W : Matrix.unitaryGroup (Fin c) ℂ) (i j : Fin c) :
    QAlgorithms.effectProb (Matrix.kronecker (transposeBasisProj W i) (basisProj W j))
      (maxEntDensity c) = if i = j then ((c : ℝ))⁻¹ else 0 := 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, §3 ("The essential trick …")
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