Ben Toner

According to our database, Ben Toner authored at least 6 papers between 2007 and 2011.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2011

Entangled Games Are Hard to Approximate.

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

SIAM J. Comput., 2011

2010

Unique Games with Entangled Provers Are Easy.

Julia Kempe, Oded Regev, Ben Toner

SIAM J. Comput., 2010

2009

Simulating Quantum Correlations with Finite Communication.

Oded Regev, Ben Toner

SIAM J. Comput., 2009

2008

Nonclassicality without entanglement enables bit commitment.

Howard Barnum, Oscar C. O. Dahlsten, Matthew Leifer, Ben Toner

Proceedings of the 2008 IEEE Information Theory Workshop, 2008

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

Andrew C. Doherty, Yeong-Cherng Liang, Ben Toner, Stephanie Wehner

Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, 2008

2007

The Unique Games Conjecture with Entangled Provers is False.

Julia Kempe, Oded Regev, Ben Toner

Proceedings of the Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007, 2007