Eqs. (D.5)–(D.7) — the coefficients , of the maximal- T-state
ProvedBaconThesis.ExchangeUniv.eq_D_5_D_7angular-momentumdecoherence-free-subspacesp2o-gran-per-chapterp2o-plan-bookp2o-strengthenedp2o-v1quantum-information
Let and let be a unit vector of qubits with
where ; so is a maximal- state of total spin . Put and, appending one qubit,
Then, with :
- (D.6) if and only if ;
- (D.7) and if and only if there is a phase , , with
These are the coefficients of the maximal- T-state of , the input to the TT, BT, TB, BB states used in the inductive proof.
Formalization Note The appended qubit is the last one; spin up is . The relative phase of is that of the raising formula used on the page.
Differences from the source:
- generalization: |T₊⟩ the path state |J_1, …, J_{n−2}, J + 1/2; m = J + 1/2⟩ → any unit vector with S_z eigenvalue J + 1/2 annihilated by S_+; reason: the page's computation uses only these properties; specializes to the path states
- reading: "Application of S+ to Eq. (D.5) thus yields α + √(2J+1)β = 0" and "up to an arbitrary phase choice, α = …, β = …" → two iff statements, with the phase c, |c| = 1; reason: the page derives the coefficients from S_+|ψ⟩ = 0 and normalization, and the phase is the stated freedom
Preamble
import Mathlib import Definitions.Def_BaconThesis_ExchangeUniv_collS open scoped Matrix
Formal statement
namespace BaconThesis.ExchangeUniv
/-- **(D.5)–(D.7): the coefficients of the maximal-`m` T-state.**
Bacon, *Decoherence, Control, and Symmetry in Quantum Computers*, arXiv:quant-ph/0305025v1, Appendix D.1, (D.4)–(D.7), p.255 (PDF p.272).
Let `n = m + 1`, `J ≥ 0`, and let `|T₊⟩` be a unit vector of `m` qubits of total spin
`J + 1/2` with maximal `m`-value: `S_z^[m]|T₊⟩ = (J + ½)|T₊⟩` and `S_+^[m]|T₊⟩ = 0`, where
`S_± = S_x ± iS_y`. Put `|T₋⟩ = (2J + 1)^{−1/2} S_−^[m]|T₊⟩` (the state `|…, J + ½; J − ½⟩`) and
`|ψ⟩ = α|T₊⟩|½, −½⟩ + β|T₋⟩|½, ½⟩` (D.5), with the last qubit appended. Then
1. (D.6) `S_+^[n]|ψ⟩ = 0` iff `α + √(2J+1) β = 0`;
2. (D.7) `S_+^[n]|ψ⟩ = 0` and `⟨ψ|ψ⟩ = 1` iff, up to a phase `c` with `|c| = 1`,
`α = −c√((2J+1)/(2J+2))` and `β = c/√(2J+2)`.
**Formalization Note.** The `n`-qubit basis is `Fin (m+1) → Fin 2`; the appended qubit is
`Fin.last m` and `Fin.init x` is the string of the first `m` qubits. Spin up `|½, ½⟩` is `|0⟩`
(`σ_z|0⟩ = |0⟩`), spin down is `|1⟩`. The relative phase of `|T₋⟩` is the one of the raising
formula `J_+|j, m⟩ = [j(j+1) − m(m+1)]^{1/2}|j, m+1⟩` used on p.255. `|T₊⟩` may be any such
highest-weight vector (the book's is one with a given path `J₁, …, J_{n−2}`). -/
theorem eq_D_5_D_7 (m : ℕ) (J : ℝ) (hJ : 0 ≤ J) (Tp : (Fin m → Fin 2) → ℂ)
(hz : collS m 2 *ᵥ Tp = ((J + 1 / 2 : ℝ) : ℂ) • Tp)
(hup : (collS m 0 + Complex.I • collS m 1) *ᵥ Tp = 0)
(hnorm : star Tp ⬝ᵥ Tp = 1) (α β : ℂ) :
let Tm : (Fin m → Fin 2) → ℂ :=
(((Real.sqrt (2 * J + 1))⁻¹ : ℝ) : ℂ) • ((collS m 0 - Complex.I • collS m 1) *ᵥ Tp)
let ψ : (Fin (m + 1) → Fin 2) → ℂ := fun x =>
if x (Fin.last m) = 1 then α * Tp (Fin.init x) else β * Tm (Fin.init x)
((collS (m + 1) 0 + Complex.I • collS (m + 1) 1) *ᵥ ψ = 0 ↔
α + (Real.sqrt (2 * J + 1) : ℂ) * β = 0) ∧
((collS (m + 1) 0 + Complex.I • collS (m + 1) 1) *ᵥ ψ = 0 ∧ star ψ ⬝ᵥ ψ = 1 ↔
∃ c : ℂ, ‖c‖ = 1 ∧
α = c * (-(Real.sqrt ((2 * J + 1) / (2 * J + 2)) : ℂ)) ∧
β = c * ((1 / Real.sqrt (2 * J + 2) : ℝ) : ℂ)) := by sorry
end BaconThesis.ExchangeUniv
Source
Bacon, Decoherence, Control, and Symmetry in Quantum Computers, arXiv:quant-ph/0305025v1, Appendix D.1, eqs. (D.4)–(D.7), p.255 (PDF p.272)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.