Journal article

ENTANGLED GAMES ARE HARD TO APPROXIMATE

Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, Thomas Vidick

SIAM Journal on Computing | SIAM PUBLICATIONS | Published : 2011

University of Melbourne Researchers

Grants

Awarded by IST directorate


Awarded by Ministry of Internal Affairs and Communications of Japan


Awarded by National Science Foundation


Awarded by NWO VICI


Funding Acknowledgements

School of Computer Science, Tel Aviv University, Tel Aviv, Israel (kempe@post.tau.ac.il). This work was partly done while this author was at LRI, Univ. de Paris-Sud, Orsay. This author's work was partially supported by the European Commission under the Integrated Project Qubit Applications (QAP) funded by the IST directorate as contract 015848, by an Alon Fellowship of the Israeli Higher Council of Academic Research, by a grant of the Israeli Science Foundation, by an ERC Starting Researcher grant, and by a grant from the Wolfson Family Charitable Trust. Support by Michel Cukierman is also gratefully acknowledged.Principles of Informatics Research Division, National Institute of Informatics, Tokyo, Japan (hirotada@nii.ac.jp, keiji@nii.ac.jp). The work of these authors was supported by the Strategic Information and Communications R&D Promotion Programme 031303020 of the Ministry of Internal Affairs and Communications of Japan.School of Physics, The University of Melbourne, Victoria, Australia (bentoner@bentoner.com). This work was partly done while this author was at Caltech, Pasadena, and at CWI, Amsterdam. This author's work was supported by the National Science Foundation under grants PHY-0456720 and CCF-0524828, by EU project QAP, by NWO VICI project 639-023-302, and by the Dutch BSIK/BRICKS project.