pith. sign in

arxiv: 2606.10872 · v1 · pith:643IKEGHnew · submitted 2026-06-09 · 🪐 quant-ph

Quantum Colorings of Spheres

Olivier Lalonde This is my paper

Pith reviewed 2026-06-27 12:52 UTC · model grok-4.3

classification 🪐 quant-ph
keywords quantum coloringsphereClifford algebraHadamard matrixquantum chromatic numberremote state preparationorthogonal representationcode space
0
0 comments X

The pith

The real sphere S^{n-1} admits a rank-one quantum n-coloring if and only if n is 2, 4 or 8.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proves an equivalence between the existence of quantum n-colorings of the real sphere S^{n-1} and the existence of maximal code spaces for Clifford-algebraic errors with a clean ancilla. This equivalence implies that real spheres are quantumly n-colorable when n equals 2 or a multiple of 4, provided a Hadamard matrix of order n exists. It further shows that rank-one quantum n-colorings exist exactly for n in {2,4,8}, settling a conjecture by Zeng and Zhang. The work also demonstrates that complex spheres have quantum chromatic number strictly larger than their dimension except in the two-dimensional case. As a consequence, catalytic zero-error remote state preparation protocols exist for real m-qubit states using m bits of communication and m ebits.

Core claim

The existence of a quantum n-coloring construction for the real sphere S^{n-1} is equivalent to the existence of a maximal code space for Clifford-algebraic errors given a clean ancilla. This equivalence yields that S^{n-1} admits a rank-one quantum n-coloring precisely when n belongs to {2,4,8}. For the general case, if S^{n-1} is quantumly n-colorable then n=2 or n is a multiple of 4, and the converse holds whenever a Hadamard matrix of order n exists.

What carries the argument

The equivalence between the quantum coloring construction for spheres and the existence of a maximal code space for Clifford-algebraic errors given a clean ancilla.

If this is right

  • S^{n-1} admits a rank-one quantum n-coloring precisely for n in {2,4,8}.
  • Assuming the Hadamard conjecture, the CMNSW construction extends exactly to dimensions n=2 or n a multiple of 4.
  • Complex spheres S^{n-1} have quantum chromatic number strictly bigger than n except for n=2.
  • Catalytic zero-error remote state preparation protocols exist for all real m-qubit states using m bits of communication and consuming m ebits.
  • Real and complex orthogonal ranks are distinct.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The representation-theoretic methods developed for the Clifford error code spaces could apply to classifying other quantum error-correcting constructions.
  • The separation between real and complex orthogonal ranks suggests that quantum chromatic number calculations for graphs may depend on the field in ways not previously quantified.
  • The catalytic protocols may generalize to approximate or noisy versions of remote state preparation tasks.

Load-bearing premise

The equivalence between the existence of the quantum coloring construction and the existence of a maximal code space for Clifford-algebraic errors given a clean ancilla holds in both directions.

What would settle it

Discovery of a dimension n that is a multiple of 4 without a Hadamard matrix of order n, yet where the real sphere S^{n-1} still admits a quantum n-coloring, or discovery of a rank-one quantum n-coloring for some n outside {2,4,8}.

Figures

Figures reproduced from arXiv: 2606.10872 by Olivier Lalonde.

Figure 1
Figure 1. Figure 1: The graph G19. The graph6 representation of this graph is RxLAKA@AgYAWDGO?O?@??A?W@@OC@ . Theorem 1.3. [BE51] If a graph G is such that χ(G) < ∞, then there exists S ⊆ V (G) with |S| < ∞ and χ(G[S]) = χ(G). Declare a monotonic graph parameter f to have the de Bruijn-Erd˝os property if the analogous state￾ment holds for it. It is of interest to know which quantum graph parameters have this property. This is… view at source ↗
Figure 2
Figure 2. Figure 2: The exact remote state preparation protocol proving corollary [PITH_FULL_IMAGE:figures/full_fig_p007_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: An alternative representation of the graph [PITH_FULL_IMAGE:figures/full_fig_p023_3.png] view at source ↗
read the original abstract

Cameron, Montanaro, Newman, Severini and Winter gave a construction which shows that, for $n \in \{2,4,8\}$, any graph $G$ which admits a real $n$-dimensional orthogonal representation is quantumly $n$-colorable. This result can be recast as the statement that the real sphere $S^{n-1}$ is quantumly $n$-colorable for these values of $n$. We investigate possible extensions of their construction. We first show that their hypothesis that the orthogonal representation be real-valued is required by proving that there is no analogue of this for the complex spheres, which all have quantum chromatic number strictly bigger than the dimension except in two dimensions. We also provide candidate finitary witnesses of this and show for the first time that the real and complex orthogonal ranks are distinct as a byproduct. For the real case, we show that if $S^{n-1}$ is quantumly $n$-colorable, then either $n=2$ or $n$ is a multiple of 4, and show that the converse holds whenever a Hadamard matrix of order $n$ exists. Hence, assuming the Hadamard conjecture, this completely classifies the dimensions to which the CMNSW construction can be extended. Our method of proof involves showing the equivalence between the existence of such a construction and the existence of a maximal code space for Clifford-algebraic errors given a clean ancilla, and we believe that the representation-theoretic techniques we use for tackling the latter problem could be of independent interest. It also follows from this equivalence that $S^{n-1}$ admits a rank-one quantum $n$-coloring if and only if $n \in \{2,4,8\}$, thereby settling a conjecture of Zeng and Zhang, as does the fact that for all $m \geq 1$, there exists a catalytic zero-error remote state preparation protocol for real $m$-qubit states with $m$ bits of communication and which consumes $m$ ebits.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 2 minor

Summary. The manuscript extends the CMNSW construction by showing that the real sphere S^{n-1} admits a quantum n-coloring if and only if n=2 or n is a multiple of 4 (assuming the Hadamard conjecture), via an equivalence to the existence of maximal code spaces for Clifford-algebraic errors with a clean ancilla. It proves that complex spheres have quantum chromatic number strictly larger than the dimension except for n=2, provides finitary witnesses distinguishing real and complex orthogonal ranks, shows that rank-one quantum n-colorings exist precisely for n in {2,4,8} (settling a conjecture of Zeng and Zhang), and derives a catalytic zero-error remote state preparation protocol for real m-qubit states using m bits of communication and m ebits.

Significance. If the central equivalence holds, the results classify the dimensions to which the CMNSW construction extends, settle an open conjecture on rank-one colorings, introduce a new remote state preparation protocol, and provide representation-theoretic techniques for analyzing Clifford code spaces that may have independent interest. The separation between real and complex orthogonal ranks is a byproduct of independent value.

major comments (1)
  1. [Abstract (method of proof paragraph)] Abstract (paragraph on method of proof): The bidirectional equivalence between existence of the quantum n-coloring construction for S^{n-1} and existence of a maximal code space for Clifford-algebraic errors given a clean ancilla is load-bearing for both the necessity direction of the classification (n multiple of 4) and the rank-one coloring iff statement. Both directions of this equivalence must be stated and proved explicitly; failure of either direction would collapse the necessity claim and the settled conjecture even if the Hadamard sufficiency direction remains intact.
minor comments (2)
  1. [Abstract] Abstract: The phrase 'candidate finitary witnesses of this' (referring to the complex-sphere claim) is vague; the main text should explicitly define or construct these witnesses and state which claim they support.
  2. [Abstract] The manuscript states that the representation-theoretic techniques 'could be of independent interest'; this is an opinion that can be removed or supported with a concrete example of another problem to which they apply.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading and for highlighting the importance of the equivalence. We address the major comment below.

read point-by-point responses

  1. Referee: [Abstract (method of proof paragraph)] Abstract (paragraph on method of proof): The bidirectional equivalence between existence of the quantum n-coloring construction for S^{n-1} and existence of a maximal code space for Clifford-algebraic errors given a clean ancilla is load-bearing for both the necessity direction of the classification (n multiple of 4) and the rank-one coloring iff statement. Both directions of this equivalence must be stated and proved explicitly; failure of either direction would collapse the necessity claim and the settled conjecture even if the Hadamard sufficiency direction remains intact.

    Authors: We agree that the bidirectional equivalence is central and load-bearing for the necessity claim and the rank-one coloring result. The full manuscript already establishes both directions explicitly: one direction shows that a quantum n-coloring of S^{n-1} implies a maximal Clifford code space with clean ancilla, while the converse shows that such a code space yields the coloring construction (detailed in Sections 3 and 4, with the representation-theoretic arguments). However, to address the referee's concern about explicit statement in the abstract, we will revise the method-of-proof paragraph to state both directions of the equivalence clearly and concisely. revision: yes

Circularity Check

0 steps flagged

No circularity: central claims reduce to proven equivalences with external Clifford algebras and Hadamard matrices.

full rationale

The paper derives the classification of real spheres S^{n-1} that admit quantum n-colorings by establishing (via representation theory) a bidirectional equivalence to the existence of maximal code spaces for Clifford-algebraic errors with clean ancilla. This equivalence is not self-definitional or fitted; it connects the coloring construction to independent algebraic objects. The Hadamard conjecture is treated as an external assumption, not derived internally. The rank-one coloring result (only for n in {2,4,8}) follows directly from the same equivalence. No load-bearing self-citations, no ansatzes smuggled via prior work, and no renaming of known results as new derivations. The derivation is self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claims rest on standard properties of Clifford algebras and orthogonal representations (standard_math) together with the external Hadamard conjecture as a domain assumption for the full classification. No free parameters or invented entities are introduced.

axioms (2)
  • standard math Standard algebraic properties of Clifford algebras and their representations
    Invoked to establish the equivalence between quantum colorings and maximal code spaces for Clifford-algebraic errors.
  • domain assumption Existence of Hadamard matrices of order n whenever n is a multiple of 4 (Hadamard conjecture)
    Used to obtain the converse direction and the complete classification under the conjecture.

pith-pipeline@v0.9.1-grok · 5897 in / 1617 out tokens · 29080 ms · 2026-06-27T12:52:09.617789+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

58 extracted references · 19 canonical work pages

  1. [1]

    Electronic Research Archive , volume =

    Yulong Tian and Jinli Xu , title =. Electronic Research Archive , volume =. 2025 , doi =

    2025

  2. [2]

    Proceedings of the

    Viktor Galliard and Stefan Wolf , title =. Proceedings of the. 2002 , doi =

    2002

  3. [3]

    Nachrichten von der Gesellschaft der Wissenschaften zu G

    Adolf Hurwitz , title =. Nachrichten von der Gesellschaft der Wissenschaften zu G

  4. [4]

    Physical Review A , volume =

    Bei Zeng and Peng Zhang , title =. Physical Review A , volume =. 2002 , month = jan, publisher =. doi:10.1103/PhysRevA.65.022316 , url =

    work page doi:10.1103/physreva.65.022316 2002

  5. [5]

    Putnam , title =

    Ian F. Putnam , title =. 2019 , month = jan, howpublished =

    2019

  6. [6]

    The Quarterly Journal of Mathematics , volume =

    Angel Kumchev , title =. The Quarterly Journal of Mathematics , volume =. 2002 , doi =

    2002

  7. [7]

    Journal of Combinatorial Designs , volume =

    Hadi Kharaghani and Behruz Tayfeh-Rezaie , title =. Journal of Combinatorial Designs , volume =. 2005 , doi =

    2005

  8. [8]

    Godsil and Joseph Zaks , title =

    Chris D. Godsil and Joseph Zaks , title =. 2012 , eprint =

    2012

  9. [9]

    2024 , eprint =

    Chris Godsil and Mariia Sobchuk , title =. 2024 , eprint =

    2024

  10. [10]

    Cameron and Ashley Montanaro and Michael W

    Peter J. Cameron and Ashley Montanaro and Michael W. Newman and Simone Severini and Andreas Winter , title =. Electronic Journal of Combinatorics , volume =. 2007 , url =

    2007

  11. [11]

    Paulsen and Ivan G

    Vern I. Paulsen and Ivan G. Todorov , title =. The Quarterly Journal of Mathematics , volume =. 2015 , doi =

    2015

  12. [12]

    Physical Review Letters , volume =

    Gilles Brassard and Richard Cleve and Alain Tapp , title =. Physical Review Letters , volume =. 1999 , month = aug, publisher =. doi:10.1103/PhysRevLett.83.1874 , url =

    work page doi:10.1103/physrevlett.83.1874 1999

  13. [13]

    Harris , title =

    Samuel J. Harris , title =. Annales Henri Poincar. 2024 , doi =

    2024

  14. [14]

    Proceedings of the 2026 Annual

    Lorenzo Ciardo , title =. Proceedings of the 2026 Annual. 2026 , doi =

    2026

  15. [15]

    Bennett and David P

    Charles H. Bennett and David P. DiVincenzo and Peter W. Shor and John A. Smolin and Barbara M. Terhal and William K. Wootters , title =. Physical Review Letters , volume =. 2001 , month = jul, publisher =. doi:10.1103/PhysRevLett.87.077902 , url =

    work page doi:10.1103/physrevlett.87.077902 2001

  16. [16]

    Consequences and Limits of Nonlocal Strategies , booktitle =

    Richard Cleve and Peter H. Consequences and Limits of Nonlocal Strategies , booktitle =. 2004 , doi =

    2004

  17. [17]

    Wigner , title =

    Pascual Jordan and Eugene P. Wigner , title =. Zeitschrift f. 1928 , doi =

    1928

  18. [18]

    Bulletin of the London Mathematical Society , volume =

    Mark Pankov and Thomas Vetterlein , title =. Bulletin of the London Mathematical Society , volume =. 2021 , doi =

    2021

  19. [19]

    Physical Review A , volume =

    Hoi-Kwong Lo , title =. Physical Review A , volume =. 2000 , month = jun, publisher =. doi:10.1103/PhysRevA.62.012313 , url =

    work page doi:10.1103/physreva.62.012313 2000

  20. [20]

    Electronic Proceedings in Theoretical Computer Science , volume =

    Sander Uijlen and Bas Westerbaan , title =. Electronic Proceedings in Theoretical Computer Science , volume =. 2014 , month = dec, publisher =. doi:10.4204/EPTCS.172.11 , url =

    work page doi:10.4204/eptcs.172.11 2014

  21. [21]

    2026 , eprint =

    Srijita Kundu and Olivier Lalonde , title =. 2026 , eprint =

    2026

  22. [22]

    Physical Review Letters , volume =

    Emanuel Knill and Raymond Laflamme and Lorenza Viola , title =. Physical Review Letters , volume =. 2000 , month = mar, publisher =. doi:10.1103/PhysRevLett.84.2525 , url =

    work page doi:10.1103/physrevlett.84.2525 2000

  23. [23]

    Linear Algebra and its Applications , volume =

    Victor Lomonosov and Peter Rosenthal , title =. Linear Algebra and its Applications , volume =. 2004 , doi =

    2004

  24. [24]

    H. Blaine. Spin Geometry , series =. 1989 , isbn =

    1989

  25. [25]

    Leung and Peter W

    Debbie W. Leung and Peter W. Shor , title =. Physical Review Letters , volume =. 2003 , month = mar, publisher =. doi:10.1103/PhysRevLett.90.127905 , url =

    work page doi:10.1103/physrevlett.90.127905 2003

  26. [26]

    Journal of Mathematical Physics , volume =

    William Slofstra , title =. Journal of Mathematical Physics , volume =. 2011 , month = oct, publisher =. doi:10.1063/1.3652924 , url =

    work page doi:10.1063/1.3652924 2011

  27. [27]

    Quantum homomorphisms , journal =

    Laura Man. Quantum homomorphisms , journal =. 2016 , month = may, publisher =. doi:10.1016/j.jctb.2015.12.009 , url =

    work page doi:10.1016/j.jctb.2015.12.009 2016

  28. [28]

    Teleporting an unknown quantum state via dual classical and Einstein Podolsky Rosen channels,

    Charles H. Bennett and Gilles Brassard and Claude Cr. Teleporting an unknown quantum state via dual classical and. Physical Review Letters , volume =. 1993 , month = mar, publisher =. doi:10.1103/PhysRevLett.70.1895 , url =

    work page doi:10.1103/physrevlett.70.1895 1993

  29. [29]

    Godsil and Michael W

    Chris D. Godsil and Michael W. Newman , title =. Journal of Combinatorial Theory, Series B , volume =. 2008 , doi =

    2008

  30. [30]

    Russian Mathematical Surveys , volume =

    Andrei Mikhailovich Raigorodskii , title =. Russian Mathematical Surveys , volume =. 1999 , doi =

    1999

  31. [31]

    Electronic Journal of Combinatorics , volume =

    Olivier Lalonde , title =. Electronic Journal of Combinatorics , volume =. 2025 , doi =

    2025

  32. [32]

    Physical Review A , volume =

    Arun Kumar Pati , title =. Physical Review A , volume =. 2000 , month = jan, publisher =. doi:10.1103/PhysRevA.61.022308 , url =

    work page doi:10.1103/physreva.61.022308 2000

  33. [33]

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences , volume =

    David Avis and Jun Hasegawa and Yosuke Kikuchi and Yuuya Sasaki , title =. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences , volume =. 2006 , month = may, publisher =. doi:10.1093/ietfec/e89-a.5.1378 , url =

    work page doi:10.1093/ietfec/e89-a.5.1378 2006

  34. [34]

    2015 , isbn =

    Sheldon Axler , title =. 2015 , isbn =. doi:10.1007/978-3-319-11080-6 , url =

    work page doi:10.1007/978-3-319-11080-6 2015

  35. [35]

    Gottschalk , title =

    Walter H. Gottschalk , title =. Proceedings of the American Mathematical Society , volume =. 1951 , doi =

    1951

  36. [36]

    IEEE Transactions on Information Theory , volume =

    Giannicola Scarpa and Simone Severini , title =. IEEE Transactions on Information Theory , volume =. 2012 , month = apr, publisher =. doi:10.1109/TIT.2011.2178018 , url =

    work page doi:10.1109/tit.2011.2178018 2012

  37. [37]

    de Bruijn and Paul Erd

    Nicolaas G. de Bruijn and Paul Erd. A Colour Problem for Infinite Graphs and a Problem in the Theory of Relations , journal =. 1951 , doi =

    1951

  38. [38]

    Simmons , title =

    Gustavus J. Simmons , title =. Journal of the Australian Mathematical Society , volume =. 1976 , doi =

    1976

  39. [39]

    William Helton and Kyle P

    J. William Helton and Kyle P. Meyer and Vern I. Paulsen and Matthew Satriano , title =. New York Journal of Mathematics , volume =. 2019 , url =

    2019

  40. [40]

    Holmsen and Seunghun Lee , title =

    Andreas F. Holmsen and Seunghun Lee , title =. Mathematika , volume =. 2016 , month = jan, publisher =. doi:10.1112/S0025579315000303 , url =

    work page doi:10.1112/s0025579315000303 2016

  41. [41]

    Oddities of Quantum Colorings , journal =

    Laura Man. Oddities of Quantum Colorings , journal =. 2016 , doi =

    2016

  42. [42]

    Geometric Graphs with Exponential Chromatic Number and Arbitrary Girth , journal =

    Matija Buci. Geometric Graphs with Exponential Chromatic Number and Arbitrary Girth , journal =. 2025 , doi =

    2025

  43. [43]

    Combinatorica , volume =

    Ferdinand Ihringer and Hajime Tanaka , title =. Combinatorica , volume =. 2019 , month = nov, publisher =. doi:10.1007/s00493-019-4134-9 , url =

    work page doi:10.1007/s00493-019-4134-9 2019

  44. [44]

    Combinatorica , volume =

    Peter Frankl , title =. Combinatorica , volume =. 1986 , doi =

    1986

  45. [45]

    Discrete Mathematics , volume =

    Roman Prosanov , title =. Discrete Mathematics , volume =. 2018 , issn =. doi:10.1016/j.disc.2018.07.014 , url =

    work page doi:10.1016/j.disc.2018.07.014 2018

  46. [46]

    Proceedings of the 2003

    Viktor Galliard and Alain Tapp and Stefan Wolf , title =. Proceedings of the 2003. 2003 , doi =

    2003

  47. [47]

    Forum of Mathematics, Pi , volume =

    William Slofstra , title =. Forum of Mathematics, Pi , volume =. 2019 , doi =

    2019

  48. [48]

    Journal of the American Mathematical Society , volume =

    William Slofstra , title =. Journal of the American Mathematical Society , volume =. 2019 , month = sep, publisher =. doi:10.1090/jams/929 , url =

    work page doi:10.1090/jams/929 2019

  49. [49]

    2013 , eprint =

    Zhengfeng Ji , title =. 2013 , eprint =

    2013

  50. [50]

    Communications of the ACM , volume =

    Zhengfeng Ji and Anand Natarajan and Thomas Vidick and John Wright and Henry Yuen , title =. Communications of the ACM , volume =. 2021 , doi =

    2021

  51. [51]

    Anton T. Than and Jim Furches and Debopriyo Biswas and Sarah Chehade and Kathleen Hamilton and Bahaa Harraz and Xingxin Liu and De Luo and Keqin Yan and Yichao Yu and Vivian Ni Zhang and Liudmila A. Zhukas and Alaina M. Green and Alexander Kozhanov and Christopher Monroe and Crystal Noel and Carlos Ortiz Marrero and Norbert M. Linke , title =. 2026 , eprint =

    2026

  52. [52]

    Quantum pseudo-telepathy

    Gilles Brassard and Anne Broadbent and Alain Tapp , title =. Foundations of Physics , volume =. 2005 , month = nov, publisher =. doi:10.1007/s10701-005-7353-4 , url =

    work page doi:10.1007/s10701-005-7353-4 2005

  53. [53]

    Quantum Science and Technology , volume =

    Jim Furches and Sarah Chehade and Kathleen Hamilton and Nathan Wiebe and Carlos Ortiz Marrero , title =. Quantum Science and Technology , volume =. 2025 , doi =

    2025

  54. [54]

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences , volume =

    David Avis and Jun Hasegawa and Yosuke Kikuchi and Yuuya Sasaki , title =. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences , volume =. 2006 , doi =

    2006

  55. [55]

    L. On the. IEEE Transactions on Information Theory , volume =. 1979 , doi =

    1979

  56. [56]

    Forbidden intersections , journal =

    Peter Frankl and Vojt. Forbidden intersections , journal =. 1987 , doi =

    1987

  57. [57]

    Raymond E. A. C. Paley , title =. Journal of Mathematics and Physics , volume =. 1933 , doi =

    1933

  58. [58]

    1951 , note =

    Tarski, Alfred , title =. 1951 , note =

    1951