Antipodal spin coefficients and isometric embeddings
OpenQAlgorithms.Papers.Independent.Intakenext100.P65.binomial_spinEmbeddingsLet be integers, , , and let an integer count physical qubits. On spin labels , set . The usual spin-x matrix satisfies
The following three basis maps preserve inner products of all coefficient vectors: in one oscillator; in two oscillators; and , where the Dicke vector is the normalized equal sum of -qubit words of the indicated weight. The first image of is precisely the single-mode binomial codeword. The other images supply the two-mode and permutation-invariant descriptions. The two-mode total photon number is , so its physical Schwinger spin is , distinct from the coefficient spin .
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P65
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P65
open MeasureTheory Filter
open QAlgorithms.Papers.Independent.Frontier18.P14 (displacementEntry)
open QAlgorithms.Papers.Independent.Dependency50.P40 (outputFirstChoi)
open scoped ComplexConjugate Matrix Topology
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
/-- PDF pp.14--15 (6.11)--(6.16): antipodal eigenvectors and their three isometric
coefficient embeddings. The physical Schwinger spin is (S+1)M/2; the transported
coefficient spin is M/2. Neither is silently substituted for the other.
Printed (6.16): 2J-(S+1)m; changed to (S+1)(2J-m), following the
preceding basis map and Fig.7(a), to retain fixed total occupation. -/
theorem binomial_spinEmbeddings (N S K : ℕ) (hK : (S + 1) * (N + 1) ≤ K) :
(∀ mu : Fin 2, (spinX (N + 1)).mulVec (antipodal (N + 1) mu) =
((-1 : ℂ) ^ mu.val * ((N + 1 : ℕ) : ℂ) / 2) • antipodal (N + 1) mu ∧
embedOne (N + 1) S (antipodal (N + 1) mu) = binomialCodeCoordinates N S mu) ∧
(∀ v w : Fin (N + 2) → ℂ,
fockInner (embedOne (N + 1) S v) (embedOne (N + 1) S w) = ∑ m, conj (v m) * w m) ∧
(∀ v w : Fin (N + 2) → ℂ,
(∑' n : ℕ × ℕ, conj (embedTwo (N + 1) S v n) * embedTwo (N + 1) S w n) =
∑ m, conj (v m) * w m) ∧
(∀ v w : Fin (N + 2) → ℂ,
(∑ x : Fin K → Fin 2, conj (embedDicke (N + 1) S K v x) * embedDicke (N + 1) S K w x) =
∑ m, conj (v m) * w m) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P65
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all natural numbers satisfying , put and define, for and ,
Let be the complex matrix indexed by whose entries are
For a coefficient vector , define
Then, for each , , and equals the sequence that is zero unless is divisible by and , and otherwise has value
Moreover, for every pair of complex vectors indexed by ,
Here and are included, while the hypothesis forces .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.