The Unique Games Conjecture with Entangled Provers is False. - Julia Kempe; Oded Regev 001; Ben Toner (Algebraic Methods in Computational Complexity, 2007)

The Quantum Moment Problem and Bounds on Entangled Multi-prover Games. - Andrew C. Doherty; Yeong-Cherng Liang; Ben Toner; Stephanie Wehner (CCC, 2008)

Nonclassicality without entanglement enables bit commitment. - Howard Barnum; Oscar C. O. Dahlsten; Matthew Leifer; Ben Toner (ITW, 2008)

Simulating Quantum Correlations with Finite Communication. - Oded Regev 001; Ben Toner (SIAM J. Comput., 2009)

Unique Games with Entangled Provers Are Easy. - Julia Kempe; Oded Regev 001; Ben Toner (SIAM J. Comput., 2010)

Entangled Games Are Hard to Approximate. - Julia Kempe; Hirotada Kobayashi; Keiji Matsumoto; Ben Toner; Thomas Vidick (SIAM J. Comput., 2011)