From bell inequalities to tsirelson's theorem

David Avis, Sonoko Moriyama, Masaki Owari

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)

Abstract

The first part of this paper contains an introduction to Bell inequalities and Tsirelson's theorem for the non-specialist. The next part gives an explicit optimum construction for the "hard" part of Tsirelson's theorem. In the final part we describe how upper bounds on the maximal quantum violation of Bell inequalities can be obtained by an extension of Tsirelson's theorem, and survey very recent results on how exact bounds may be obtained by solving an infinite series of semidefinite programs.

Original languageEnglish
Pages (from-to)1254-1267
Number of pages14
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE92-A
Issue number5
DOIs
Publication statusPublished - 2009 Jan 1

Keywords

  • Bell inequality
  • Non-local games
  • Quantum computation
  • Quantum correlation
  • Quantum information

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'From bell inequalities to tsirelson's theorem'. Together they form a unique fingerprint.

Cite this