Graph-Theoretic Approach to Quantum Correlations

Adán Cabello, Simone Severini, and Andreas Winter
Phys. Rev. Lett. 112, 040401 – Published 27 January 2014

Abstract

Correlations in Bell and noncontextuality inequalities can be expressed as a positive linear combination of probabilities of events. Exclusive events can be represented as adjacent vertices of a graph, so correlations can be associated to a subgraph. We show that the maximum value of the correlations for classical, quantum, and more general theories is the independence number, the Lovász number, and the fractional packing number of this subgraph, respectively. We also show that, for any graph, there is always a correlation experiment such that the set of quantum probabilities is exactly the Grötschel-Lovász-Schrijver theta body. This identifies these combinatorial notions as fundamental physical objects and provides a method for singling out experiments with quantum correlations on demand.

  • Figure
  • Received 20 August 2013

DOI:https://doi.org/10.1103/PhysRevLett.112.040401

© 2014 American Physical Society

Authors & Affiliations

Adán Cabello1,*, Simone Severini2,†, and Andreas Winter3,‡

  • 1Departamento de Física Aplicada II, Universidad de Sevilla, E-41012 Sevilla, Spain
  • 2Department of Computer Science, and Department of Physics and Astronomy, University College London, WC1E 6BT London, United Kingdom
  • 3ICREA and Física Teòrica: Informació i Fenomens Quàntics, Universitat Autònoma de Barcelona, E-08193 Bellaterra (Barcelona), Spain

  • *adan@us.es
  • simoseve@gmail.com
  • andreas.winter@uab.cat

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 112, Iss. 4 — 31 January 2014

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review Letters

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×