Deterministic quantum non-locality and graph colorings

DOI10.1016/j.tcs.2012.12.013zbMath1283.68266OpenAlexW2039194906MaRDI QIDQ387022

Alain Tapp, Viktor Galliard, Stefan Wolf

Publication date: 11 December 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.12.013

zbMATH Keywords

entanglementcommunication complexitynon-local correlations

Mathematics Subject Classification ID

Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15) Quantum coherence, entanglement, quantum correlations (81P40) Theory of computing (68Q99) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Cites Work

• Unnamed Item
• Unnamed Item
• The complete intersection theorem for systems of finite sets
• On the quantum chromatic number of a graph
• A note on the stability number of an orthogonality graph
• Coloring an Orthogonality Graph
• Forbidden Intersections

This page was built for publication: Deterministic quantum non-locality and graph colorings