Ben Toner

Simulating Quantum Correlations with Finite Communication

Oded Regev, Ben Toner, O. Regev, 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

Unique Games with Entangled Provers are Easy

Julia Kempe, Oded Regev, Ben Toner, 2008, FOCS.

The Quantum Moment Problem and Bounds on Entangled Multi-prover Games

Stephanie Wehner, Andrew C. Doherty, Yeong-Cherng Liang, 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.

Unique Games with Entangled Provers are Easy

Julia Kempe, Oded Regev, Ben Toner, 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

Simulating Quantum Correlations with Finite Communication

Oded Regev, Ben Toner, 2007, FOCS.

Nonclassicality without entanglement enables bit commitment

Howard Barnum, Matthew Leifer, Oscar C. O. Dahlsten, 2008, 2008 IEEE Information Theory Workshop.

Entangled Games Are Hard to Approximate

Keiji Matsumoto, Julia Kempe, Thomas Vidick, 2011, SIAM J. Comput..

The Unique Games Conjecture with Entangled Provers is False

Julia Kempe, Oded Regev, Ben Toner, 2007, Algebraic Methods in Computational Complexity.

Entangled Games are Hard to Approximate

Keiji Matsumoto, Julia Kempe, Thomas Vidick, 2007, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

Finite de Finetti theorem for conditional probability distributions describing physical theories

Matthias Christandl, Ben Toner, M. Christandl, 2007, 0712.0916.