[Jump to code hierarchy]

Complex projective space code

Alternative Names: \(\mathbb{C}P^N\) code, Packing in \(\mathbb{C}P^N\).

Description

Encodes \(K\) states (codewords) into a complex projective space \(\mathbb{C}P^N\), the space of lines in a complex vector space. The space for \(N=2\) is called the complex projective plane.

Notes

Review and tables of packings in complex projective space [1].

Cousins

  • Finite-dimensional quantum error-correcting code— Pure quantum states in an \((N+1)\)-dimensional Hilbert space are parameterized by points in the complex projective space \(\mathbb{C}P^N\). As such, (classical) complex projective codes can be associated with subsets of pure quantum states.
  • \(t\)-design— Pure quantum states in an \((N+1)\)-dimensional Hilbert space are parameterized by points in the complex projective space \(\mathbb{C}P^N\). As such, complex projective designs are designs on the space of pure quantum states [2–4]. Symmetric informationally complete quantum measurements (SIC-POVMs) [2,5] and mutually unbiased bases (MUBs) [6–12] are important examples of such designs.
  • Kerdock code— Kerdock codes correspond to cluster states, and the corresponding Clifford-group automorphisms of this set form a particular group [13] that is a unitary 2-design on \(U(2^n)\) [14]. As such, cluster states form complex projective on 2-designs \(\mathbb{C}P^{2^n}\). These are useful in matrix-vector multiplication [15].
  • Clifford group— Stabilizer states on \(n\) qubits form 3-designs on complex projective spaces \(\mathbb{C}P^{2^n}\) [16]. The Clifford group is a unitary 2-design [17] and a 3-design [20,21][18; Thm. 1.6(B)][19; pg. 191] on \(U(2^n)\). The \([[2m,2m-2,2]]\) code when \(2m\) is a multiple of four obstructs the Clifford group from being a 4-design [22].
  • Hessian polyhedron code— The (antipodal pairs of) points of the (double) Hessian polyhedron correspond to the 27 lines on a smooth cubic surface in \(\mathbb{C}P^3\) [23–26].
  • \(3_{21}\) polytope code— Antipodal pairs of points of the \(3_{21}\) polytope code correspond to the 28 bitangent lines of a general quartic plane curve in the complex project plane [23–26].
  • Witting polytope code— Antipodal pairs of points of the Witting polytope code correspond to the 120 tritangent planes of a canonical sextic curve in \(\mathbb{C}P^3\) [23–26].
  • Cluster-state code— Kerdock codes correspond to cluster states, and the corresponding Clifford-group automorphisms of this set form a particular group [13] that is a unitary 2-design on \(U(2^n)\) [14]. As such, cluster states form complex projective 2-designs on \(\mathbb{C}P^{2^n-1}\). These are useful in matrix-vector multiplication [15].
  • Qubit stabilizer code— Stabilizer states on \(n\) qubits form complex projective 3-designs, but not 4-designs, on \(\mathbb{C}P^{2^n-1}\) [16]. The Clifford group is a unitary 2-design [17] and a 3-design [20,21][18; Thm. 1.6(B)][19; pg. 191] on \(U(2^n)\).
  • Modular-qudit stabilizer code— Stabilizer states on \(n\) prime-dimensional qudits form complex projective 2-designs on \(\mathbb{C}P^{p^n-1}\) [16].
  • Galois-qudit stabilizer code— Stabilizer states on \(n\) Galois qubits form 2-designs on complex projective spaces \(\mathbb{C}P^{p^{mn}}\) [27].

Member of code lists

Primary Hierarchy

Parents
Compact two-point homogeneous spaces \(G/H\) reduce to complex projective spaces for \(G = SU(D+1)\) and \(H = U(D)\) [28; Ch. 9][29; Table 1].
Complex projective spaces \(\mathbb{C}P^N\) are complex Grassmannians \(G/H\) for \(G = U(N+1)\) and \(H = U(N)\times U(1)\).
Complex projective space code

References

  1. [1]

    J. Jasper, E. J. King, and D. G. Mixon, “Game of Sloanes: Best known packings in complex projective space”, (2019) arXiv:1907.07848

  2. [2]

    J. M. Renes, R. Blume-Kohout, A. J. Scott, and C. M. Caves, “Symmetric informationally complete quantum measurements”, Journal of Mathematical Physics 45, 2171 (2004) arXiv:quant-ph/0310075 DOI

  3. [3]

    A. Ambainis and J. Emerson, “Quantum t-designs: t-wise independence in the quantum world”, (2007) arXiv:quant-ph/0701126

  4. [4]

    I. Bengtsson and K. Życzkowski, Geometry of Quantum States (Cambridge University Press, 2017) DOI

  5. [5]

    G. Zauner, “Grundzüge einer nichtkommutativen Designtheorie”, PhD thesis, University of Vienna, 1999

  6. [6]

    H. Barnum, “Information-disturbance tradeoff in quantum measurement on the uniform ensemble and on the mutually unbiased bases”, (2002) arXiv:quant-ph/0205155

  7. [7]

    A. Klappenecker and M. Roetteler, “Constructions of Mutually Unbiased Bases”, (2003) arXiv:quant-ph/0309120

  8. [8]

    A. Klappenecker and M. Roetteler, “Mutually Unbiased Bases are Complex Projective 2-Designs”, (2005) arXiv:quant-ph/0502031

  9. [9]

    A. J. Scott, “Optimizing quantum process tomography with unitary2-designs”, Journal of Physics A: Mathematical and Theoretical 41, 055308 (2008) arXiv:0711.1017 DOI

  10. [10]

    T. DURT, B.-G. ENGLERT, I. BENGTSSON, and K. ŻYCZKOWSKI, “ON MUTUALLY UNBIASED BASES”, International Journal of Quantum Information 08, 535 (2010) arXiv:1004.3348 DOI

  11. [11]

    H. Zhu, “Mutually unbiased bases as minimal Clifford covariant 2-designs”, Physical Review A 91, (2015) arXiv:1505.01123 DOI

  12. [12]

    D. McNulty and S. Weigert, “Mutually Unbiased Bases in Composite Dimensions – A Review”, Quantum 10, 2051 (2026) arXiv:2410.23997 DOI

  13. [13]

    A. Calderbank, P. Cameron, W. Kantor, and J. Seidel, “Z\({}_{4}\) -Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line-Sets”, Proceedings of the London Mathematical Society 75, 436 (1997) DOI

  14. [14]

    T. Can, N. Rengaswamy, R. Calderbank, and H. D. Pfister, “Kerdock Codes Determine Unitary 2-Designs”, IEEE Transactions on Information Theory 66, 6104 (2020) arXiv:1904.07842 DOI

  15. [15]

    T. Fuchs, D. Gross, F. Krahmer, R. Kueng, and D. G. Mixon, “Sketching with Kerdock’s crayons: Fast sparsifying transforms for arbitrary linear maps”, (2021) arXiv:2105.05879

  16. [16]

    R. Kueng and D. Gross, “Qubit stabilizer states are complex projective 3-designs”, (2015) arXiv:1510.02767

  17. [17]

    D. P. DiVincenzo, D. W. Leung, and B. M. Terhal, “Quantum data hiding”, IEEE Transactions on Information Theory 48, 580 (2002) arXiv:quant-ph/0103098 DOI

  18. [18]

    R. M. Guralnick and P. H. Tiep, “Decompositions of Small Tensor Powers and Larsen’s Conjecture”, (2005) arXiv:math/0502080

  19. [19]

    Self-Dual Codes and Invariant Theory (Springer-Verlag, 2006) DOI

  20. [20]

    H. Zhu, “Multiqubit Clifford groups are unitary 3-designs”, Physical Review A 96, (2017) arXiv:1510.02619 DOI

  21. [21]

    Z. Webb, “The Clifford group forms a unitary 3-design”, (2016) arXiv:1510.02769

  22. [22]

    H. Zhu, R. Kueng, M. Grassl, and D. Gross, “The Clifford group fails gracefully to be a unitary 4-design”, (2016) arXiv:1609.08172

  23. [23]

    P. du Val, “On the Directrices of a Set of Points in a Plane”, Proceedings of the London Mathematical Society s2-35, 23 (1933) DOI

  24. [24]

    V. I. Arnold, “Symplectization, complexification and mathematical trinities”, The Arnoldfest, 23-37 (1999)

  25. [25]

    H. Cohn and A. Kumar, “Universally optimal distribution of points on spheres”, Journal of the American Mathematical Society 20, 99 (2006) arXiv:math/0607446 DOI

  26. [26]

    Y.-H. He and J. McKay, “Sporadic and Exceptional”, (2015) arXiv:1505.06742

  27. [27]

    H. F. Chau, “Unconditionally Secure Key Distribution in Higher Dimensions by Depolarization”, IEEE Transactions on Information Theory 51, 1451 (2005) arXiv:quant-ph/0405016 DOI

  28. [28]

    J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups (Springer New York, 1999) DOI

  29. [29]

    C. Bachoc, D. C. Gijswijt, A. Schrijver, and F. Vallentin, “Invariant Semidefinite Programs”, International Series in Operations Research & Management Science 219 (2011) arXiv:1007.2905 DOI

Page edit log

Your contribution is welcome!

on github.com (edit & pull request)

— see instructions

Zoo Code ID: complex_projective

Cite as:
“Complex projective space code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/complex_projective, arXiv:2606.11484
BibTeX:
@incollection{eczoo_complex_projective,
title={Complex projective space code},
booktitle={The Error Correction Zoo},
year={2026},
editor={Albert, Victor V. and Faist, Philippe},
eprint={2606.11484},
doi={10.48550/arXiv.2606.11484},
url={https://errorcorrectionzoo.org/c/complex_projective}
}
Share via:
Twitter | Mastodon |  | E-mail
Permanent link:
https://errorcorrectionzoo.org/c/complex_projective

Cite as:

“Complex projective space code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/complex_projective, arXiv:2606.11484

Github: https://github.com/errorcorrectionzoo/eczoo_data/edit/main/codes/classical/homogeneous/symmetric/2pt_homogeneous/complex_projective.yml.