On the quantum chromatic number of a graph

Electronic Journal of Combinatorics

Volumn 14, Issue 1 R, 2007, Pages

  Cameron, Peter J ^a   Montanaro, Ashley ^b   Newman, Michael W ^a   Severini, Simone ^c   Winter, Andreas ^b  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

^b UNIVERSITY OF BRISTOL   (United Kingdom)

^c UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 36749042516     PISSN: None     EISSN: 10778926     Source Type: Journal    
DOI: 10.37236/999     Document Type: Article

References (25)

1. D. Avis, J. Hasegawa, Y. Kikuchi and Y. Sasaki, "A quantum protocol to win the graph colouring game on all Hadamard graphs", arXiv.org:quant-ph/0509047 (2005).
2. S. Basu, R. Pollack and M. F. Roy, Algorithms in Real Algebraic Geometry, Algorithms and Computation in Mathematics, vol. 10, Springer (2006).
3. B. Bollobás, Random Graphs, 2nd ed., Cambridge University Press (2001).
4. G. Brassard, A. Broadbent and A. Tapp, "Quantum Pseudo- Telepathy", Found. Physics, vol. 35, no. 11, pp. 1877-1907 (2005); arXiv.org:quant-ph/0407221
5. G. Brassard, R. Cleve and A. Tapp, "Cost of Exactly Simulating Quantum Entanglement with Classical Communication", Phys. Rev. Lett., vol. 83, no. 9, pp. 1874-1877 (1999).
6. H. Buhrman, R. Cleve, J. Watrous and R. de Wolf, "Quantum Fingerprinting", Phys. Rev. Lett., vol. 87, no. 16, 167902 (2001).
7. H. Buhrman, R. Cleve and A. Wigderson, in Proc. 30th STOC, ACM, New York, pp. 63-68 (1998).
8. P. J. Cameron, Permutation groups, London Mathematical Society Student Texts, vol. 45, Cambridge University Press, Cambridge, 1999.
9. R. Cleve, P. Høyer, B. Toner and J. Watrous, "Consequences and limits of nonlocal strategies", in Proc. 19th IEEE Annual Conference on Computational Complexity, pp. 236-249 (2004).
10. H.-D. Ebbinghaus, H. Hermes, F. Hirzebruch, M. Koecher, K. Mainzer, J. Neukirch, A. Prestel, R. Remmert, Numbers, Springer Verlag, Graduate Texts in Mathematics (1996).
11. P. Frankl and V. Rödl, "Forbidden Intersections", Trans. Amer. Math. Soc., vol. 300, no. 1, pp. 259-286 (1987).
12. V. Galliard and S. Wolf, "Pseudo-telepathy, entanglement, and graph colorings", in Proc. ISIT 2002, p. 101 (2002).
13. V. Galliard, A. Tapp and S. Wolf, "The impossibility of pseudotelepathy without quantum entanglement", in Proc. ISIT 2003, p. 457 (2003).
14. C. D. Godsil and M. W. Newman, "Colouring an Orthogonality Graph", to appear in SIAM J. Disc. Math.; arXiv.org:math.C0/0509151 (2005).
15. C. D. Godsil, "Interesting Graphs and their Colourings", http://quoll.uwaterloo.ca/pstuff/index.html (2003).
16. P. Hayden, D. W. Leung, P. W. Shor, A. Winter, "Randomizing quantum states: Constructions and applications", Commun. Math. Phys., vol. 250, pp. 371-391 (2004).
17. F. Juhasz, "The asymptotic behaviour of the Lovász theta function for random graphs", Combinatorica, vol. 2, no. 2, pp. 153-155 (1982);
18. A. Coja-Oghlan, "The Lovász Number of Random Graphs", Comb. Prob. and Comput., vol. 14, pp. 439-465 (2005).
19. G. Lindblad, "A general no-cloning theorem", Lett. Math. Phys., vol. 47, no. 2, pp. 189-196 (1999).
20. L. Lovasz, "On the Shannon Capacity of a Graph", IEEE Trans. Inf. Theory, vol. 25, no. 1, pp. 1-7 (1978).
21. M. W. Newman, Independent Sets and Eigenspaces, PhD thesis, Waterloo, Canada (2005).
22. O. Ore, "Theory of Graphs", American Mathematical Society, American Mathematical Society Colloquium Publications, Vol. XXXVIII (1962).
23. A. Peres, Quantum Theory: Concepts and Methods, Kluwer Academic Publishers, 1993.
24. S. Severini, "On the digraph of a unitary matrix", SIAM J. Matrix Analysis App., vol. 25, no. 1, pp. 295-300 (2003).
25. R. de Wolf, Quantum Computing and Communication Complexity, PhD thesis, Amsterdam (2001).