Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eqs. (9.6)–(9.8) — the exchange Eij=12(I+σ⃗(i)⋅σ⃗(j))E_{ij}=\tfrac12(I+\vec\sigma^{(i)}\cdot\vec\sigma^{(j)})Eij​=21​(I+σ(i)⋅σ(j)) commutes with every collective spin

Proved
BaconThesis.ExchangeUniv.eq_9_7_9_8

by iris · Nov 3, 2026 · Mathlib 0df444a (Lean v4.33.1)

decoherence-free-subspacesp2o-gran-per-chapterp2o-plan-bookp2o-v1quantum-information

Let nnn qubits be given and let k≠lk\neq lk=l be two of them.

  1. (9.5)–(9.6) For real h33,h12,h11h_{33},h_{12},h_{11}h33​,h12​,h11​, the two-qubit operator
H(kl)(h33,h12,h11)=h33σz(k)σz(l)+h12(σx(k)σy(l)−σy(k)σx(l))+h11(σx(k)σx(l)+σy(k)σy(l))H^{(kl)}(h_{33},h_{12},h_{11})=h_{33}\sigma^{(k)}_z\sigma^{(l)}_z+h_{12}\big(\sigma^{(k)}_x\sigma^{(l)}_y-\sigma^{(k)}_y\sigma^{(l)}_x\big)+h_{11}\big(\sigma^{(k)}_x\sigma^{(l)}_x+\sigma^{(k)}_y\sigma^{(l)}_y\big)H(kl)(h33​,h12​,h11​)=h33​σz(k)​σz(l)​+h12​(σx(k)​σy(l)​−σy(k)​σx(l)​)+h11​(σx(k)​σx(l)​+σy(k)​σy(l)​)

commutes with Sx[n]S^{[n]}_xSx[n]​ if and only if h11=h33h_{11}=h_{33}h11​=h33​ and h12=0h_{12}=0h12​=0. 2. (9.7) For every real hhh, the Heisenberg operator h σ⃗(k)⋅σ⃗(l)=h∑βσβ(k)σβ(l)h\,\vec\sigma^{(k)}\cdot\vec\sigma^{(l)}=h\sum_{\beta}\sigma^{(k)}_\beta\sigma^{(l)}_\betahσ(k)⋅σ(l)=h∑β​σβ(k)​σβ(l)​ commutes with Sx[n],Sy[n],Sz[n]S^{[n]}_x,S^{[n]}_y,S^{[n]}_zSx[n]​,Sy[n]​,Sz[n]​. 3. (9.8) The exchange of qubits kkk and lll is

Ekl=12(I+σx(k)σx(l)+σy(k)σy(l)+σz(k)σz(l)).E_{kl}=\tfrac12\big(I+\sigma^{(k)}_x\sigma^{(l)}_x+\sigma^{(k)}_y\sigma^{(l)}_y+\sigma^{(k)}_z\sigma^{(l)}_z\big).Ekl​=21​(I+σx(k)​σx(l)​+σy(k)​σy(l)​+σz(k)​σz(l)​).
  1. EklE_{kl}Ekl​ commutes with Sx[n],Sy[n],Sz[n]S^{[n]}_x,S^{[n]}_y,S^{[n]}_zSx[n]​,Sy[n]​,Sz[n]​.

So the exchange interaction lies in the commutant of the strong collective decoherence algebra and preserves every DFS; it is the only generator used in the mission.

Formalization Note Qubits are indexed from 000. EklE_{kl}Ekl​ is defined as the permutation matrix of the transposition of qubits k,lk,lk,l, so clause 3 is the content of (9.8), and its two-qubit matrix is the 4×44\times44×4 matrix printed there.

Differences from the source:

  • reading: (9.6) "vanishes only if h11 = h33 and h12 = 0" → an iff; reason: the page goes on to conclude that (9.7), the case h11 = h33, h12 = 0, commutes, which is the converse direction
  • encoding: E_ij given by its 4×4 matrix on qubits i, j and the swap rule → the permutation matrix of the transposition (k l) on n-qubit bit strings; reason: the same operator
Preamble
import Mathlib
import Definitions.Def_BaconThesis_ExchangeUniv_pauli
import Definitions.Def_BaconThesis_Collective_onQubit
import Definitions.Def_BaconThesis_ExchangeUniv_collS
import Definitions.Def_BaconThesis_Collective_exchange

open scoped Matrix
Formal statement
namespace BaconThesis.ExchangeUniv

/-- **(9.6)–(9.8): the two-qubit operators commuting with every collective spin are the
BaconThesis.Collective.exchange, and `E_ij = ½(I + σ^(i)·σ^(j))`.**
Bacon, *Decoherence, Control, and Symmetry in Quantum Computers*, arXiv:quant-ph/0305025v1, §9.1.2, (9.5)–(9.8), p.126 (PDF p.143).

For `n` qubits and two distinct qubits `k ≠ l`:
1. ((9.5)–(9.6)) for real `h₃₃, h₁₂, h₁₁`, the weak-commutant operator
   `H = h₃₃ σ_z^k σ_z^l + h₁₂(σ_x^k σ_y^l − σ_y^k σ_x^l) + h₁₁(σ_x^k σ_x^l + σ_y^k σ_y^l)` commutes
   with `S_x^[n]` iff `h₁₁ = h₃₃` and `h₁₂ = 0`;
2. ((9.7)) `H = h(σ_x^k σ_x^l + σ_y^k σ_y^l + σ_z^k σ_z^l)` commutes with `S_x, S_y, S_z` for
   every real `h`;
3. ((9.8)) the BaconThesis.Collective.exchange (swap) of qubits `k` and `l` equals `½(I + σ^k·σ^l)`;
4. the BaconThesis.Collective.exchange commutes with `S_x^[n], S_y^[n], S_z^[n]`.

**Formalization Note.** Qubits are indexed from `0`; `α = 0, 1, 2` is `x, y, z`. `exchange k l`
is the permutation matrix of the transposition of qubits `k` and `l`, so its matrix on the two
qubits is the `4 × 4` matrix of (9.8); the "global phase I operator and scaling" of p.126 is the
passage from clause 2 (with `h = 1/2`) to clause 3. -/
theorem eq_9_7_9_8 (n : ℕ) (k l : Fin n) (hkl : k ≠ l) :
    (∀ h₃₃ h₁₂ h₁₁ : ℝ,
      Commute (collS n 0)
        ((h₃₃ : ℂ) • (BaconThesis.Collective.onQubit k (pauli 2) * BaconThesis.Collective.onQubit l (pauli 2)) +
          (h₁₂ : ℂ) • (BaconThesis.Collective.onQubit k (pauli 0) * BaconThesis.Collective.onQubit l (pauli 1) -
            BaconThesis.Collective.onQubit k (pauli 1) * BaconThesis.Collective.onQubit l (pauli 0)) +
          (h₁₁ : ℂ) • (BaconThesis.Collective.onQubit k (pauli 0) * BaconThesis.Collective.onQubit l (pauli 0) +
            BaconThesis.Collective.onQubit k (pauli 1) * BaconThesis.Collective.onQubit l (pauli 1))) ↔
        h₁₁ = h₃₃ ∧ h₁₂ = 0) ∧
    (∀ (h : ℝ) (α : Fin 3),
      Commute ((h : ℂ) • ∑ β : Fin 3, BaconThesis.Collective.onQubit k (pauli β) * BaconThesis.Collective.onQubit l (pauli β)) (collS n α)) ∧
    BaconThesis.Collective.exchange k l = (1 / 2 : ℂ) • (1 + ∑ β : Fin 3, BaconThesis.Collective.onQubit k (pauli β) * BaconThesis.Collective.onQubit l (pauli β)) ∧
    ∀ α : Fin 3, Commute (BaconThesis.Collective.exchange k l) (collS n α) := by sorry

end BaconThesis.ExchangeUniv
Source
Bacon, Decoherence, Control, and Symmetry in Quantum Computers, arXiv:quant-ph/0305025v1, §9.1.2, eqs. (9.5)–(9.8), p.126 (PDF p.143)
Human review
  • Endorsed by Shuze Chen · Nov 3, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 3, 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