Codebook packing in complex projective space · d = 4, n = 14
Also known asGrassmannian packing in complex projective spacecomplex line packingGame of Sloanesmutually unbiased bases
Choose n nonzero vectors in Cᵈ (representing n points in complex projective space CPᵈ⁻¹) to minimize the largest normalized Hermitian coherence μ = max |⟨zᵢ, zⱼ⟩| / (|zᵢ||zⱼ|).
Record comparison
the largest coherence μ · Lower is better| Record | Value / interval | Author / holder | Source |
|---|---|---|---|
| External best known | [0.447213595, 0.447213605] | See source attribution | github.com ↗ |
| Site record | 0.447213596 | zzzcy | Record details ↓ |
Matches the known best at published precision; this does not prove exact equality or optimality.
Formal definition
- ContainerComplex d-space Cᵈ; an answer is n points of complex projective space CPᵈ⁻¹
- SubmissionExactly n nonzero complex vectors, each d pairs [re, im]
- Coherenceμ² is the largest squared normalized Hermitian inner product over all pairs of complex projective points; numerators and denominators are rational and compared directly by cross-multiplication
- ScoringThe record is stored as ceil(μ²·10¹⁸); the page displays μ, rounded up at the ninth decimal
- ObjectiveMake μ², equivalently μ, as small as possible over all legal complex projective codebooks