Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2112.01726 · Linear Algebra and its Applications

Spectral bounds for the quantum chromatic number of quantum graphs

Priyanga Ganesan

Published Jun 8, 2023• 13 citations
arXivHTMLPDF
DOI
10.1016/j.laa.2023.06.007

Related papers

Spectral lower bounds for the quantum chromatic number of a graph

Clive H. Elphick, Paweł Wocjan

arXiv:1805.08334•Journal of Combinatorial Theory Series A•Jul 3, 2019•11 citations

Klasyczne i kwantowe grafy Knesera

Igor Chełstowski

We present a construction of quantum Kneser graphs, which yields classical Kneser graphs in the commutative case.We also generalize this construction to obtain quantum versions of generalized Kneser graphs, such as Johnson graphs.We discuss several basic properties of the constructed quantum graphs, such as their reflexivity and regularity.Then, we investigate their quantum chromatic numbers and establish upper bounds on them by constructing explicit colorings.We also investigate spectral lower bounds on quantum chromatic numbers for several examples and formulate a conjecture about their asymptotic behavior.Lastly, we present an alternate approach to quantization of Kneser graphs and a few results obtained for the quantum Mycielski construction.

•Jan 1, 2026•0 citations

Spectral fluctuations of quantum graphs

Z. Pluhař, Hans A. Weidenmüller

AIP conference proceedings•Jan 1, 2014•0 citations

Quantum chromatic number of products of quantum graphs

Rolando de Santiago, A. Meenakshi McNamara

In this article, we define the Cartesian, Categorical, and Lexicographic, and Strong products of quantum graphs. We provide bounds on the quantum chromatic number of these products in terms of the quantum chromatic number of the factors. To adequately describe bounds on the lexicographic product of quantum graphs, we provide a notion of a quantum b-fold chromatic number for quantum graphs.

arXiv:2408.11911•Journal of Mathematical Physics•Dec 1, 2025•3 citations

On the properties of simple quantum graphs

Pavel Hejčík

•Jan 1, 2008•0 citations

Quantum graphs special section

Waves in Random Media•Jan 1, 2004•0 citations
We present a construction of quantum Kneser graphs, which yields classical Kneser graphs in the commutative case.We also generalize this construction to obtain quantum versions of generalized Kneser graphs, such as Johnson graphs.We discuss several basic properties of the constructed quantum graphs, such as their reflexivity and regularity.Then, we investigate their quantum chromatic numbers and establish upper bounds on them by constructing explicit colorings.We also investigate spectral lower bounds on quantum chromatic numbers for several examples and formulate a conjecture about their asymptotic behavior.Lastly, we present an alternate approach to quantization of Kneser graphs and a few results obtained for the quantum Mycielski construction.