Spectral lower bounds for the quantum chromatic number of a graph. II

DOI10.37236/9295zbMath1454.05041arXiv1910.07336OpenAlexW3111458298MaRDI QIDQ2215470

Parisa Darbari, Clive Elphick, Paweł Wocjan

Publication date: 13 December 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.07336

zbMATH Keywords

quantum informationspectral bounds

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Related Items (2)

The cross-product conjecture for width two posets ⋮ Spectral upper bound on the quantum k-independence number of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Quantum homomorphisms
• Spectra of graphs
• Spreads in strongly regular graphs
• 5-chromatic strongly regular graphs
• On the quantum chromatic number of a graph
• Interlacing eigenvalues and graphs
• Colouring the normalized Laplacian
• Spectral lower bounds for the quantum chromatic number of a graph

This page was built for publication: Spectral lower bounds for the quantum chromatic number of a graph. II