Benjamin Toner

dblp:50/2483 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2004
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Quantum computing and quantum information · 43% Mathematical optimization · 38% Computational complexity · 19%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information › quantum foundations
bell inequalities
0.012004
Consequences and Limits of Nonlocal Strategies · CCC 2004
Mathematical optimization
integer programming
0.012004
Consequences and Limits of Nonlocal Strategies · CCC 2004
Mathematical optimization › integer programming
multi-prover interactive proofs
0.012004
Consequences and Limits of Nonlocal Strategies · CCC 2004
Quantum computing and quantum information › quantum foundations
quantum nonlocality
0.012004
Consequences and Limits of Nonlocal Strategies · CCC 2004
Computational complexity
soundness
0.012004
Consequences and Limits of Nonlocal Strategies · CCC 2004
Quantum computing and quantum information
quantum entanglement
0.012004
Consequences and Limits of Nonlocal Strategies · CCC 2004

Methods — techniques the papers use, named apart from their topics

semidefinite programming · 0.0
YearPublicationVenuePosition
2004 Consequences and Limits of Nonlocal Strategies
abstract
This paper investigates various aspects of the nonlocal effects that can arise when entangled quantum information is shared between two parties. A natural framework for studying nonlocality is that of cooperative games with incomplete information, where two cooperating players may share entanglement. Here, nonlocality can be quantified in terms of the values of such games. We review some examples of non-locality and show that it can profoundly affect the soundness of two-prover interactive proof systems. We then establish limits on nonlocal behavior by upper-bounding the values of several of these games. These upper bounds can be regarded as generalizations of the so-called Tsirelson inequality. We also investigate the amount of entanglement required by optimal and nearly optimal quantum strategies.
Richard Cleve, Peter Høyer, Benjamin Toner, John Watrous
CCC3