On the Quantum Chromatic Numbers of Small Graphs
Olivier Lalonde

TL;DR
This paper proves the smallest known graph with a quantum-classical chromatic number separation and introduces a new example demonstrating the difference between rank-based quantum chromatic parameters.
Contribution
It provides a computer-assisted proof of the smallest graph separating quantum and classical chromatic numbers and presents the smallest known graph separating rank-1 and rank-2 quantum chromatic numbers.
Findings
Proved the minimal graph with quantum-classical chromatic separation is on 14 vertices.
Discovered the smallest graph with rank-1 and rank-2 quantum chromatic separation on 21 vertices.
Developed techniques for constructing and lower bounding orthogonal rank of graphs.
Abstract
We make two contributions pertaining to the study of the quantum chromatic numbers of small graphs. Firstly, in an elegant paper, Man\v{c}inska and Roberson [\textit{Baltic Journal on Modern Computing}, 4(4), 846-859, 2016] gave an example of a graph on 14 vertices with quantum chromatic number 4 and classical chromatic number 5, and conjectured that this is the smallest graph exhibiting a separation between the two parameters. We describe a computer-assisted proof of this conjecture, thereby resolving a longstanding open problem in quantum graph theory. Our second contribution pertains to the study of the rank- quantum chromatic numbers. While it can now be shown that for every , and are distinct, few small examples of separations between these parameters are known. We give the smallest known example of such a separation in the form of a graph…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems
