Eq. (C.8) —
ProvedBaconThesis.Collective.eq_C_8p2o-gran-per-chapterp2o-plan-bookp2o-strengthenedp2o-v1quantum-informationrepresentation-theory
For qubits, the total angular momentum is a combination of exchange operators and the identity:
the sum running over ordered pairs of distinct qubits, with the exchange (swap) of qubits and . For this reads , with eigenvalue on the triplet and on the singlet.
Consequently is a Hamiltonian available to an exchange-only quantum computer, which the universality proof of Appendix C uses.
Differences from the source:
- encoding: k qubits, Σ_{i≠j=1}^k → n qubits (the variable is named n), double sum over i and j ∈ univ.erase i (ordered pairs); reason: S^[k] is the collective operator on k qubits ((8.31)); renaming the variable changes nothing
- generalization: k ≥ 1 qubits → every n ∈ ℕ, including 0; reason: at 0 qubits both sides are 0 on a one-dimensional space; for n ≥ 1 it is the book's statement
Preamble
import Mathlib import Definitions.Def_BBPSSW_Distill_pauli import Definitions.Def_BaconThesis_Collective_onQubit import Definitions.Def_BaconThesis_Collective_collS import Definitions.Def_BaconThesis_Collective_totalS2 import Definitions.Def_BaconThesis_Collective_exchange open scoped Matrix
Formal statement
namespace BaconThesis.Collective
/-- **(C.8): `(S^[k])² = k(1 − k/4) I + ½ Σ_{i≠j} E_ij`.**
Bacon, *Decoherence, Control, and Symmetry in Quantum Computers*, arXiv:quant-ph/0305025v1, Appendix C, (C.8), p.248 (PDF p.265): "(ii) Every `(S^[k])²` can be written as a sum of
exchange operators and the identity operation. … so that:
`(S^[k])² = k(1 − k/4) I + ½ Σ_{i≠j=1}^k E_ij`."
For every number of qubits `k` (here `n`), the total angular momentum `(S^[n])²` equals
`n(1 − n/4) I + ½ Σ_{i ≠ j} E_ij`, the sum running over ordered pairs of distinct qubits.
**Formalization Note.** `S^[k]` is the collective operator on `k` qubits ((8.31)), so the
statement for every `n` is the book's statement for every `k`. Qubits are indexed from `0`; the
double sum `Σ_{i≠j}` is over ordered pairs (`j ∈ univ.erase i`). -/
theorem eq_C_8 (n : ℕ) :
totalS2 n =
((n : ℂ) * (1 - (n : ℂ) / 4)) • (1 : Matrix (Fin n → Fin 2) (Fin n → Fin 2) ℂ) +
(1 / 2 : ℂ) • ∑ i : Fin n, ∑ j ∈ Finset.univ.erase i, exchange i j := by sorry
end BaconThesis.Collective
Source
Bacon, Decoherence, Control, and Symmetry in Quantum Computers, arXiv:quant-ph/0305025v1, Appendix C, (C.8), p.248 (PDF p.265)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.