On the Quantum Chromatic Number of a Graph

@article{Cameron2006OnTQ,
  title={On the Quantum Chromatic Number of a Graph},
  author={Peter J. Cameron and Ashley Montanaro and Michael W. Newman and Simone Severini and Andreas J. Winter},
  journal={Electr. J. Comb.},
  year={2006},
  volume={14}
}
  • Peter J. Cameron, Ashley Montanaro, +2 authors Andreas J. Winter
  • Published 2006
  • Mathematics, Physics, Computer Science
  • Electr. J. Comb.
  • We investigate the notion of quantum chromatic number of a graph, which is the minimal number of colours necessary in a protocol in which two separated provers can convince a referee that they have a colouring of the graph. After discussing this notion from first principles, we go on to establish relations with the clique number and orthogonal representations of the graph. We also prove several general facts about this graph parameter and find large separations between the clique number and the… CONTINUE READING

    Figures and Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 81 CITATIONS

    Spectral lower bounds for the quantum chromatic number of a graph

    VIEW 2 EXCERPTS
    CITES BACKGROUND

    Oddities of Quantum Colorings

    VIEW 9 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Quantum indpendence and chromatic numbers

    VIEW 7 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Sabidussi versus Hedetniemi for three variations of the chromatic number

    VIEW 5 EXCERPTS
    CITES BACKGROUND

    FILTER CITATIONS BY YEAR

    2008
    2020

    CITATION STATISTICS

    • 14 Highly Influenced Citations

    • Averaged 8 Citations per year from 2018 through 2020

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 26 REFERENCES