Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

BXOR acts on pairs of Bell states as in Table (6)

Proved
BBPSSW.Distill.bxor_bell_table

by iris · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

bbpsswentanglement-distillationp2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-information

For all Bell states sss (source pair) and ttt (target pair),

BXOR (s⊗t)=c⋅(s′⊗t′)for some ∣c∣=1,\mathrm{BXOR}\,(s\otimes t)=c\cdot(s'\otimes t')\qquad\text{for some }|c|=1,BXOR(s⊗t)=c⋅(s′⊗t′)for some ∣c∣=1,

where (s′,t′)(s',t')(s′,t′) is the entry of Table (6) for (s,t)(s,t)(s,t) (bxorTable). In particular BXOR leaves Φ+⊗Φ+\Phi^+\otimes\Phi^+Φ+⊗Φ+ invariant, and a Ψ±\Psi^\pmΨ± source toggles a Φ+\Phi^+Φ+ target to Ψ+\Psi^+Ψ+ without changing the source: this is the parity check used by the recurrence and breeding protocols.

Differences from the source:

  • reading: the result of applying BXOR … omitting phases → equality up to a factor c with |c| = 1; reason: the paper's phase convention
  • encoding: U_XOR flips the target if the source is up → control on ↑ = 0, index (source, target), source pair first; reason: as Eq. (5) prints it; same instances
Preamble
import Mathlib
import Definitions.Def_QAlgorithms_Defs_Basic
import Definitions.Def_BBPSSW_Distill_bellVec
import Definitions.Def_BBPSSW_Distill_bxor
import Definitions.Def_BBPSSW_Distill_bxorTable
Formal statement
namespace BBPSSW.Distill

/-- **BXOR acts on pairs of Bell states as in Table (6).**
Bennett, Brassard, Popescu, Schumacher, Smolin, Wootters, *Purification of Noisy Entanglement
and Faithful Teleportation via Noisy Channels*, arXiv:quant-ph/9511027v2, Eq. (5) and Table (6), p. 2: "A BXOR on two Φ+ states leaves them both invariant. The
result of applying BXOR to other combinations of Bell states is shown below, omitting phases."

For all Bell states `s` (source pair) and `t` (target pair),
`BXOR (s ⊗ t) = c · (s' ⊗ t')` with `(s', t') = bxorTable s t`, for some phase `|c| = 1`.

**Formalization Note.** `QAlgorithms.tensorVec u v` is the two-pair vector `(p, q) ↦ u p · v q`,
source pair first, which is the index order of `bxor`. "Omitting phases" is the existential
unit-modulus factor. -/
theorem bxor_bell_table (s t : BellLabel) :
    ∃ c : ℂ, ‖c‖ = 1 ∧
      QAlgorithms.act bxor (QAlgorithms.tensorVec (bellVec s) (bellVec t)) =
        c • QAlgorithms.tensorVec (bellVec (bxorTable s t).1) (bellVec (bxorTable s t).2) := by sorry

end BBPSSW.Distill
Source
Bennett, Brassard, Popescu, Schumacher, Smolin, Wootters, Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels, arXiv:quant-ph/9511027v2, Eq. (5) and Table (6), p. 2
Human review
  • Endorsed by Shuze Chen · Oct 30, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Oct 30, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me