Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Measuring an ideal EPR pair yields a perfect secret common bit

Open
QAlgorithms.Papers.Independent.Intakethird100.P06.idealEpr_perfectSecretBit

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let Alice and Bob be qubits, let EEE be any Hilbert space held by Eve, and let ωABE\omega_{ABE}ωABE​ be any normalized positive trace-class density with exact marginal PΦP_\PhiPΦ​, where Φ=(∣00⟩+∣11⟩)/2\Phi=(|00\rangle+|11\rangle)/\sqrt{2}Φ=(∣00⟩+∣11⟩)/2​. Both parties measure in the displayed 0/10/10/1 basis. Let ωEab=⟨ab∣ω∣ab⟩\omega_E^{ab}=\langle ab|\omega|ab\rangleωEab​=⟨ab∣ω∣ab⟩ be the unnormalized Eve block for outcomes a,ba,ba,b, and let τE=Tr⁡ABω\tau_E=\operatorname{Tr}_{AB}\omegaτE​=TrAB​ω. Then τE\tau_EτE​ is normalized and

ωEab={12τE,a=b,0,a≠b.\omega_E^{ab}=\begin{cases}\tfrac12\tau_E,&a=b,\\0,&a\ne b.\end{cases}ωEab​={21​τE​,0,​a=b,a=b.​

Consequently the outcomes 000000 and 111111 each have probability 1/21/21/2, the outcomes 010101 and 101010 have probability zero, and the common bit is exactly independent of Eve. Eve need not purify ω\omegaω, and her Hilbert dimension is unrestricted.

The operator identity captures perfect secrecy against every Eve measurement. It concerns a single ideal pair; it does not assert a noisy-protocol security theorem or a key rate.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P06
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakethird100.P06

open scoped BigOperators

open QAlgorithms.Papers.Independent.Dependency50.P33 (NuclearExpansion)

open QAlgorithms.Papers.Independent.Frontier18.P09 (partialTraceRightCoeff)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- Section II, arXiv:quant-ph/0307120v1, PDF p.6, using the exact state
(1) on p.5: both basis measurements give the same uniform bit independent of
Eve. The full unnormalized operator blocks encode secrecy against every Eve
measurement, in arbitrary Hilbert dimension, even when omega is mixed.
No noisy-protocol or asymptotic key-rate claim is made. -/
theorem idealEpr_perfectSecretBit {E : Type}
    (omega : Matrix ((Opinion × Opinion) × E) ((Opinion × Opinion) × E) ℂ)
    (hstate : IsCoordinateDensity omega) (hepr : partialTraceRightCoeff omega = eprDensity) :
    IsCoordinateDensity (traceLeft omega) ∧
      ∀ a b : Opinion, eveBlock omega a b =
        if a = b then (1 / 2 : ℂ) • traceLeft omega else 0 := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P06

end
Source
Is Entanglement Monogamous?, arXiv:quant-ph/0307120v1, PDF p. 6, Section II, unnumbered: measuring an ideal EPR pair gives a perfect secret common bit
Read-back

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

Let BBB be the two-element set of one-bit strings, let EEE be any type, and let ω\omegaω be a complex matrix indexed by (B×B)×E(B\times B)\times E(B×B)×E. Write R(a,b),(a′,b′)=1/2R_{(a,b),(a',b')}=1/2R(a,b),(a′,b′)​=1/2 when a=ba=ba=b and a′=b′a'=b'a′=b′, and zero otherwise. Assume that ω\omegaω admits an expansion ωij=∑nun(i)vn(j)‾\omega_{ij}=\sum_nu_n(i)\overline{v_n(j)}ωij​=∑n​un​(i)vn​(j)​ with un,vn∈ℓ2((B×B)×E;C)u_n,v_n\in\ell^2((B\times B)\times E;\mathbb C)un​,vn​∈ℓ2((B×B)×E;C) and summable ∑n∥un∥2∥vn∥2\sum_n\|u_n\|_2\|v_n\|_2∑n​∥un​∥2​∥vn​∥2​, that every finite quadratic form ∑i,j∈Fz(i)‾ωijz(j)\sum_{i,j\in F}\overline{z(i)}\omega_{ij}z(j)∑i,j∈F​z(i)​ωij​z(j) is real and nonnegative for every finite FFF and every complex function zzz, and that its real diagonal is summable with sum 111. Assume also that ∑e∈E′ω((a,b),e),((a′,b′),e)=R(a,b),(a′,b′)\sum'_{e\in E}\omega_{((a,b),e),((a',b'),e)}=R_{(a,b),(a',b')}∑e∈E′​ω((a,b),e),((a′,b′),e)​=R(a,b),(a′,b′)​ for every a,b,a′,b′a,b,a',b'a,b,a′,b′, using the total infinite-sum convention of zero for a nonsummable family. Define τe,f=∑a,b∈Bω((a,b),e),((a,b),f)\tau_{e,f}=\sum_{a,b\in B}\omega_{((a,b),e),((a,b),f)}τe,f​=∑a,b∈B​ω((a,b),e),((a,b),f)​. Then τ\tauτ admits an expansion τe,f=∑nrn(e)sn(f)‾\tau_{e,f}=\sum_nr_n(e)\overline{s_n(f)}τe,f​=∑n​rn​(e)sn​(f)​ with rn,sn∈ℓ2(E;C)r_n,s_n\in\ell^2(E;\mathbb C)rn​,sn​∈ℓ2(E;C) and summable ∑n∥rn∥2∥sn∥2\sum_n\|r_n\|_2\|s_n\|_2∑n​∥rn​∥2​∥sn​∥2​, all its finite quadratic forms are real and nonnegative, and its real diagonal is summable with sum 111; moreover, for every a,b∈Ba,b\in Ba,b∈B, the matrix with entries ω((a,b),e),((a,b),f)\omega_{((a,b),e),((a,b),f)}ω((a,b),e),((a,b),f)​ equals 12τ\tfrac12\tau21​τ if a=ba=ba=b and equals the zero matrix otherwise. No finiteness or countability assumption is imposed on EEE; for empty EEE, the assumed diagonal sum of ω\omegaω is impossible.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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