354 citations · 375 across the 3 of their papers we have counts for
3 papers · 1 filter
Nonclassicality without entanglement enables bit commitment
Howard Barnum, Oscar C. O. Dahlsten, Matthew Leifer +1
We investigate the existence of secure bit commitment protocols in the convex framework for probabilistic theories. The framework makes only minimal assumptions, and can be used to…
Entangled games are hard to approximate
Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto +2
We establish the first hardness results for the problem of computing the value of one-round games played by a verifier and a team of provers who can share quantum entanglement. In…
The Communication Cost of Simulating Bell Correlations
B. F. Toner, D. Bacon
What classical resources are required to simulate quantum correlations? For the simplest and most important case of local projective measurements on an entangled Bell pair state, w…