On the quantum chromatic number of a graph (Q1010645): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Importer (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Peter J. Cameron / rank
Normal rank
 
Property / author
 
Property / author: Peter J. Cameron / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: quant-ph/0608016 / rank
 
Normal rank

Latest revision as of 19:32, 18 April 2024

scientific article
Language Label Description Also known as
English
On the quantum chromatic number of a graph
scientific article

    Statements

    On the quantum chromatic number of a graph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    7 April 2009
    0 references
    Summary: We investigate the notion of quantum chromatic number of a graph, which is the minimal number of colors necessary in a protocol on 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 quantum chromatic number by looking at random graphs. Finally, we show that there can be no separation between classical and quantum chromatic number if the latter is 2, nor if it is 3 in a restricted quantum model; on the other hand, we exhibit a graph on 18 vertices and 44 edges with chromatic number 5 and quantum chromatic number 14.
    0 references
    quantum chromatic number
    0 references
    chromatic number
    0 references
    clique number
    0 references
    separated provers
    0 references
    random graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references