Physical total-spin decomposition of the signal sum
OpenQAlgorithms.Papers.Independent.Intakenext100.P53.total_spin_decompositionLet and be integers. Alice and Bob have ordered -dimensional ports, and the input register has dimension . Write and . Put , , and . A resource filter gives and obeys . Alice measures ; Bob selects the reported port and discards the others. Entanglement fidelities are tested against a normalized reference-input singlet, with no correction on the selected port.
Let be the spectral projector of the physical complementary-register squared angular momentum onto eigenvalue , and define
Then . Each is supported on the actual total-spin- sector of and commutes with the total component. For , , hence its trace is zero. Only with the physical parity can occur. Impossible sectors have zero projectors; at the complement is the one-dimensional spin-zero vacuum. This is total-spin block diagonality, without an additional claim for general .
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P53
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P53
open scoped Classical ComplexConjugate ComplexOrder Matrix Matrix.Norms.L2Operator
-- Accepted generic matrix and positive-operator interfaces. The support is the
-- orthogonal range projection; all uses below are on positive physical rho.
open QAlgorithms.Papers.Independent.Information100.P21 (Op)
open QAlgorithms.Papers.Independent.Information100.P07 (support)
open QAlgorithms.Papers.Independent.Next46.P39 (inverseSqrt)
/-- PDF p.2, Eqs.(7)-(8): full physical spin decomposition. The vacuum
complement at N=1 has spin zero. No S_A block diagonality is claimed for d>2. -/
theorem total_spin_decomposition (d N : ℕ) (hd : 2 ≤ d) (hN : 1 ≤ N) :
pbtRho d N = ∑ t ∈ Finset.range ((N - 1) * (d - 1) + 1), rhoSpinBlock d N t ∧
(∀ t : ℕ,
casimirProjector (totalCasimir d N) t * rhoSpinBlock d N t = rhoSpinBlock d N t ∧
rhoSpinBlock d N t * casimirProjector (totalCasimir d N) t = rhoSpinBlock d N t ∧
totalComponent d N (quditSpinZ d) * rhoSpinBlock d N t =
rhoSpinBlock d N t * totalComponent d N (quditSpinZ d)) ∧
(∀ t u : ℕ, t ≠ u → rhoSpinBlock d N t * rhoSpinBlock d N u = 0 ∧
Matrix.trace (rhoSpinBlock d N t * rhoSpinBlock d N u) = 0) ∧
(∀ t : ℕ, (N - 1) * (d - 1) < t ∨ t % 2 ≠ ((N - 1) * (d - 1)) % 2 →
rhoSpinBlock d N t = 0) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P53
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all natural numbers satisfying and , consider . Let have entry from to if and , and entry zero otherwise. Define , if and zero otherwise, , , and , with identities on unaffected sites. Write , using continuous functional calculus, and put , , , and . With , the theorem asserts all of the following:
The trace equality is an equality of complex numbers. The hypotheses include , when .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.