Near-optimal and explicit Bell inequality violations

Harry Buhrman, Oded Regev, Giannicola Scarpa, Ronald De Wolf

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Bell inequality violations correspond to behavior of entangled quantum systems that cannot be simulated classically. We give two new two-player games with Bell inequality violations that are stronger, fully explicit, and arguably simpler than earlier work. The first game is based on the Hidden Matching problem of quantum communication complexity, introduced by Bar-Yossef, Jayram, and Kerenidis. This game can be won with probability 1 by a quantum strategy using a maximally entangled state with local dimension n (e.g., log n EPR-pairs), while we show that the winning probability of any classical strategy differs from 1/2 by at most O(log n√n). The second game is based on the integrality gap for Unique Games by Khot and Vishnoi and the quantum rounding procedure of Kempe, Regev, and Toner. Here n-dimensional entanglement allows to win the game with probability 1/(log n)2, while the best winning probability without entanglement is 1/n. This near-linear ratio ("Bell inequality violation") is near-optimal, both in terms of the local dimension of the entangled state, and in terms of the number of possible outputs of the two players.

Original languageEnglish (US)
Title of host publicationProceedings - 26th Annual IEEE Conference on Computational Complexity, CCC 2011
Pages157-166
Number of pages10
DOIs
StatePublished - 2011
Event26th Annual IEEE Conference on Computational Complexity, CCC 2011 - San Jose, CA, United States
Duration: Jun 8 2011Jun 10 2011

Other

Other26th Annual IEEE Conference on Computational Complexity, CCC 2011
CountryUnited States
CitySan Jose, CA
Period6/8/116/10/11

Fingerprint

Bell's Inequality
Game
Local Dimension
Entangled State
Quantum communication
Entanglement
Paramagnetic resonance
Quantum Communication
Integrality
Communication Complexity
Rounding
Matching Problem
Quantum Systems
n-dimensional
Output

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Computational Mathematics

Cite this

Buhrman, H., Regev, O., Scarpa, G., & De Wolf, R. (2011). Near-optimal and explicit Bell inequality violations. In Proceedings - 26th Annual IEEE Conference on Computational Complexity, CCC 2011 (pp. 157-166). [5959805] https://doi.org/10.1109/CCC.2011.30

Near-optimal and explicit Bell inequality violations. / Buhrman, Harry; Regev, Oded; Scarpa, Giannicola; De Wolf, Ronald.

Proceedings - 26th Annual IEEE Conference on Computational Complexity, CCC 2011. 2011. p. 157-166 5959805.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Buhrman, H, Regev, O, Scarpa, G & De Wolf, R 2011, Near-optimal and explicit Bell inequality violations. in Proceedings - 26th Annual IEEE Conference on Computational Complexity, CCC 2011., 5959805, pp. 157-166, 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, CA, United States, 6/8/11. https://doi.org/10.1109/CCC.2011.30
Buhrman H, Regev O, Scarpa G, De Wolf R. Near-optimal and explicit Bell inequality violations. In Proceedings - 26th Annual IEEE Conference on Computational Complexity, CCC 2011. 2011. p. 157-166. 5959805 https://doi.org/10.1109/CCC.2011.30
Buhrman, Harry ; Regev, Oded ; Scarpa, Giannicola ; De Wolf, Ronald. / Near-optimal and explicit Bell inequality violations. Proceedings - 26th Annual IEEE Conference on Computational Complexity, CCC 2011. 2011. pp. 157-166
@inproceedings{b9c37b547bcc4fe59630c095f458953f,
title = "Near-optimal and explicit Bell inequality violations",
abstract = "Bell inequality violations correspond to behavior of entangled quantum systems that cannot be simulated classically. We give two new two-player games with Bell inequality violations that are stronger, fully explicit, and arguably simpler than earlier work. The first game is based on the Hidden Matching problem of quantum communication complexity, introduced by Bar-Yossef, Jayram, and Kerenidis. This game can be won with probability 1 by a quantum strategy using a maximally entangled state with local dimension n (e.g., log n EPR-pairs), while we show that the winning probability of any classical strategy differs from 1/2 by at most O(log n√n). The second game is based on the integrality gap for Unique Games by Khot and Vishnoi and the quantum rounding procedure of Kempe, Regev, and Toner. Here n-dimensional entanglement allows to win the game with probability 1/(log n)2, while the best winning probability without entanglement is 1/n. This near-linear ratio ({"}Bell inequality violation{"}) is near-optimal, both in terms of the local dimension of the entangled state, and in terms of the number of possible outputs of the two players.",
author = "Harry Buhrman and Oded Regev and Giannicola Scarpa and {De Wolf}, Ronald",
year = "2011",
doi = "10.1109/CCC.2011.30",
language = "English (US)",
isbn = "9780769544113",
pages = "157--166",
booktitle = "Proceedings - 26th Annual IEEE Conference on Computational Complexity, CCC 2011",

}

TY - GEN

T1 - Near-optimal and explicit Bell inequality violations

AU - Buhrman, Harry

AU - Regev, Oded

AU - Scarpa, Giannicola

AU - De Wolf, Ronald

PY - 2011

Y1 - 2011

N2 - Bell inequality violations correspond to behavior of entangled quantum systems that cannot be simulated classically. We give two new two-player games with Bell inequality violations that are stronger, fully explicit, and arguably simpler than earlier work. The first game is based on the Hidden Matching problem of quantum communication complexity, introduced by Bar-Yossef, Jayram, and Kerenidis. This game can be won with probability 1 by a quantum strategy using a maximally entangled state with local dimension n (e.g., log n EPR-pairs), while we show that the winning probability of any classical strategy differs from 1/2 by at most O(log n√n). The second game is based on the integrality gap for Unique Games by Khot and Vishnoi and the quantum rounding procedure of Kempe, Regev, and Toner. Here n-dimensional entanglement allows to win the game with probability 1/(log n)2, while the best winning probability without entanglement is 1/n. This near-linear ratio ("Bell inequality violation") is near-optimal, both in terms of the local dimension of the entangled state, and in terms of the number of possible outputs of the two players.

AB - Bell inequality violations correspond to behavior of entangled quantum systems that cannot be simulated classically. We give two new two-player games with Bell inequality violations that are stronger, fully explicit, and arguably simpler than earlier work. The first game is based on the Hidden Matching problem of quantum communication complexity, introduced by Bar-Yossef, Jayram, and Kerenidis. This game can be won with probability 1 by a quantum strategy using a maximally entangled state with local dimension n (e.g., log n EPR-pairs), while we show that the winning probability of any classical strategy differs from 1/2 by at most O(log n√n). The second game is based on the integrality gap for Unique Games by Khot and Vishnoi and the quantum rounding procedure of Kempe, Regev, and Toner. Here n-dimensional entanglement allows to win the game with probability 1/(log n)2, while the best winning probability without entanglement is 1/n. This near-linear ratio ("Bell inequality violation") is near-optimal, both in terms of the local dimension of the entangled state, and in terms of the number of possible outputs of the two players.

UR - http://www.scopus.com/inward/record.url?scp=80051954966&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80051954966&partnerID=8YFLogxK

U2 - 10.1109/CCC.2011.30

DO - 10.1109/CCC.2011.30

M3 - Conference contribution

SN - 9780769544113

SP - 157

EP - 166

BT - Proceedings - 26th Annual IEEE Conference on Computational Complexity, CCC 2011

ER -