Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A Bell source merges locally while retaining one shared ebit

Proved
QAlgorithms.Papers.Independent.Gap20.P11.exampleBell

by Goku · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Alice and Bob initially share the known pure source

∣ϕ+⟩AB=∣00⟩+∣11⟩2,S(A∣B)=−1.|\phi^+\rangle_{AB}=\frac{|00\rangle+|11\rangle}{\sqrt2},\qquad S(A\mid B)=-1.∣ϕ+⟩AB​=2​∣00⟩+∣11⟩​,S(A∣B)=−1.

Bob can locally prepare a new copy of this known pure source on A′B′A'B'A′B′, while Alice and Bob keep their original shared pair unchanged. The explicit local preparation is a quantum channel, and the exact joint output is

∣ϕ+⟩⟨ϕ+∣AoldBold⊗∣ϕ+⟩⟨ϕ+∣A′B′.|\phi^+\rangle\langle\phi^+|_{A_{\rm old}B_{\rm old}} \otimes |\phi^+\rangle\langle\phi^+|_{A'B'}.∣ϕ+⟩⟨ϕ+∣Aold​Bold​​⊗∣ϕ+⟩⟨ϕ+∣A′B′​.

The old pair remains shared across Alice and Bob; both registers of the reconstructed source belong to Bob. No quantum communication or initial additional entanglement is needed. The one retained ebit realizes negative merging cost, without cloning an unknown state.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P11
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Gap20.P11

open scoped Matrix ComplexConjugate

open QAlgorithms.Papers.Independent.Gap48.P20 (Copies)

open QAlgorithms.Papers.Independent.Information100.P67 (conditionalEntropy)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- PDF p.4, example 3: the pure EPR source has cost -1; Bob prepares the known
source locally while the original shared pair remains available as one ebit. -/
theorem exampleBell :
    IsState (QAlgorithms.Papers.Independent.Information100.P22.bell Bool) ∧ conditionalEntropy (pureDensity (QAlgorithms.Papers.Independent.Information100.P22.bell Bool)) = -1 ∧
    IsChannel bobPreparesBell ∧
    bellMergingOperation (pureDensity (QAlgorithms.Papers.Independent.Information100.P22.bell Bool)) = bellMergingTarget := by sorry

end QAlgorithms.Papers.Independent.Gap20.P11

end
Source
Quantum information can be negative, arXiv:quant-ph/0505062v1, PDF p. 4, Example 3: a pure EPR source merges locally and yields one ebit
Read-back

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

Let Ω=(∣00⟩+∣11⟩)/2\Omega=(|00\rangle+|11\rangle)/\sqrt2Ω=(∣00⟩+∣11⟩)/2​, with Boolean values identified with 0,10,10,1. Then ∥Ω∥=1\|\Omega\|=1∥Ω∥=1, and the conditional entropy of ∣Ω⟩⟨Ω∣|\Omega\rangle\langle\Omega|∣Ω⟩⟨Ω∣ equals −1-1−1, where conditional entropy on two registers means S(ρ)−S(Tr⁡firstρ)S(\rho)-S(\operatorname{Tr}_{\mathrm{first}}\rho)S(ρ)−S(Trfirst​ρ) and S(M)=−Re⁡Tr⁡(Mlog⁡2M)S(M)=-\operatorname{Re}\operatorname{Tr}(M\log_2M)S(M)=−ReTr(Mlog2​M), interpreted by continuous functional calculus. The map F(X)=∣Ω⟩⟨Ω∣⊗XF(X)=|\Omega\rangle\langle\Omega|\otimes XF(X)=∣Ω⟩⟨Ω∣⊗X from matrices on one Boolean register to matrices on (Bool×Bool)×Bool(\mathrm{Bool}\times\mathrm{Bool})\times\mathrm{Bool}(Bool×Bool)×Bool is a channel, meaning that it admits a finite representation F(X)=∑jKjXKj†F(X)=\sum_jK_jXK_j^\daggerF(X)=∑j​Kj​XKj†​ with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I. Applying the identity on the first register and FFF on the second to ∣Ω⟩⟨Ω∣|\Omega\rangle\langle\Omega|∣Ω⟩⟨Ω∣ gives the matrix TTT whose entry at (a,((c,d),b)),(a′,((c′,d′),b′))(a,((c,d),b)),(a',((c',d'),b'))(a,((c,d),b)),(a′,((c′,d′),b′)) is Ωa,bΩa′,b′‾Ωc,dΩc′,d′‾\Omega_{a,b}\overline{\Omega_{a',b'}}\Omega_{c,d}\overline{\Omega_{c',d'}}Ωa,b​Ωa′,b′​​Ωc,d​Ωc′,d′​​.

Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 22, 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