Document Open Access Logo

Graph Homomorphisms for Quantum Players

Authors Laura Mancinska, David Roberson

PDF
Thumbnail PDF

File

LIPIcs.TQC.2014.212.pdf
  • Filesize: 304 kB
  • 5 pages

Document Identifiers

Author Details

Laura Mancinska
David Roberson

Cite AsGet BibTex

Laura Mancinska and David Roberson. Graph Homomorphisms for Quantum Players. In 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 27, pp. 212-216, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
https://doi.org/10.4230/LIPIcs.TQC.2014.212

Abstract

A homomorphism from a graph X to a graph Y is an adjacency preserving mapping f:V(X) -> V(Y). We consider a nonlocal game in which Alice and Bob are trying to convince a verifier with certainty that a graph X admits a homomorphism to Y. This is a generalization of the well-studied graph coloring game. Via systematic study of quantum homomorphisms we prove new results for graph coloring. Most importantly, we show that the Lovász theta number of the complement lower bounds the quantum chromatic number, which itself is not known to be computable. We also show that other quantum graph parameters, such as quantum independence number, can differ from their classical counterparts. Finally, we show that quantum homomorphisms closely relate to zero-error channel capacity. In particular, we use quantum homomorphisms to construct graphs for which entanglement-assistance increases their one-shot zero-error capacity.
Keywords
  • graph homomorphism
  • nonlocal game
  • Lovász theta
  • quantum chromatic number
  • entanglement

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. David Avis, Jun Hasegawa, Yosuke Kikuchi, and Yuuya Sasaki. A quantum protocol to win the graph colouring game on all hadamard graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci., E89-A(5):1378-1381, 2006. Google Scholar
  2. Salman Beigi. Entanglement-assisted zero-error capacity is upper-bounded by the Lovász theta function. Phys. Rev. A, 82:10303-10306, 2010. Google Scholar
  3. Jop Briët, Harry Buhrman, and Dion Gijswijt. Violating the shannon capacity of metric graphs with entanglement. Proceedings of the National Academy of Sciences, 110(48):19227-19232, 2013. Google Scholar
  4. Jop Briët, Harry Buhrman, Monique Laurent, and Giannicola Scarpa. Zero-error souce-channel coding with entanglement. arXiv:1308.4283, 2013. Google Scholar
  5. Peter J. Cameron, Ashley Montanaro, Michael W. Newman, Simone Severini, and Andreas Winter. On the quantum chromatic number of a graph. Electr. J. Comb., 14(1), 2007. Google Scholar
  6. Richard Cleve, Peter Hoyer, Ben Toner, and John Watrous. Consequences and limits of nonlocal strategies. In 19th IEEE Annual Conference on Computational Complexity, pages 236-249, 2004. Google Scholar
  7. Toby S. Cubitt, Debbie Leung, William Matthews, and Andreas Winter. Improving zero-error classical communication with entanglement. Phys. Rev. Lett., 104:230503, Jun 2010. Google Scholar
  8. Runyao Duan, Simone Severini, and Andreas Winter. Zero-error communication via quantum channels and a quantum Lovász ϑ function. In IEEE International Symposium on Information Theory, pages 64-68, 2011. Google Scholar
  9. Junya Fukawa, Hiroshi Imai, and François Le Gall. Quantum coloring games via symmetric SAT games. In Asian Conference on Quantum Information Science (AQIS'11), 2011. Google Scholar
  10. Viktor Galliard and Stefan Wolf. Pseudo-telepathy, entanglement, and graph colorings. In IEEE International Symposium on Information Theory, page 101, 2002. Google Scholar
  11. Chris Godsil and Michael W. Newman. Coloring an orthogonality graph. SIAM J. Discret. Math., 22(2):683-692, 2008. Google Scholar
  12. Geňa Hahn and Claude Tardif. Graph homomorphisms: structure and symmetry. In Graph symmetry, volume 497 of NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., pages 107-166. Kluwer Acad. Publ., 1997. Google Scholar
  13. Pavol Hell and Jaroslav Nešetřil. Graphs and homomorphisms. Oxford University Press, 2004. Google Scholar
  14. Debbie Leung, Laura Mančinska, William Matthews, Maris Ozols, and Aidan Roy. Entanglement can increase asymptotic rates of zero-error classical communication over classical channels. Commun. Math. Phys., 311:97-111, 2012. Google Scholar
  15. László Lovász. On the Shannon capacity of a graph. IEEE Trans. Inform. Theory, 25(1):1-7, 1979. Google Scholar
  16. Laura Mančinska, Giannicola Scarpa, and Simone Severini. New separations in zero-error channel capacity through projective Kochen-Specker sets and quantum coloring. IEEE Transactions on Information Theory, 59(6):4025-4032, 2013. Google Scholar
  17. Giannicola Scarpa and Simone Severini. Kochen-Specker sets and the rank-1 quantum chromatic number. IEEE Trans. Inform. Theory, 58(4):2524-2529, 2012. Google Scholar
  18. Claude E. Shannon. The zero error capacity of a noisy channel. IRE Transactions on Information Theory, 2(3):8-19, 1956. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact