Multigraph approach to quantum non-locality

DOI10.1088/1751-8113/47/42/424021MaRDI QIDQ2929176zbMATH OpenOpenAlexFDO

Authors Rafael Rabelo, Cristhiano Duarte, Antonio J. López-Tarrida, Adán Cabello, Marcelo Terra Cunha

Publication date 11 November 2014

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1407.5340

zbMATH Keywords

foundations of quantum theoryquantum contextualityquantum non-locality

Mathematics Subject Classification ID

Graph theory (05C99) General and philosophical questions in quantum theory (81P05) Contextuality in quantum theory (81P13) Quantum measurement theory, state operations, state preparations (81P15) Quantum coherence, entanglement, quantum correlations (81P40) Feynman integrals and graphs; applications of algebraic topology and algebraic geometry (81Q30) Commutation relations and statistics as related to quantum mechanics (general) (81S05)

Abstract: Non-contextuality (NC) and Bell inequalities can be expressed as bounds $Omega$ for positive linear combinations $S$ of probabilities of events, $SleqOmega$. Exclusive events in $S$ can be represented as adjacent vertices of a graph called the exclusivity graph of $S$. In the case that events correspond to the outcomes of quantum projective measurements, quantum probabilities are intimately related to the Gr"otschel-Lov'asz-Schrijver theta body of the exclusivity graph. Then, one can easily compute an upper bound to the maximum quantum violation of any NC or Bell inequality by optimizing $S$ over the theta body and calculating the Lov'asz number of the corresponding exclusivity graph. In some cases, this upper bound is tight and gives the exact maximum quantum violation. However, in general, this is not the case. The reason is that the exclusivity graph does not distinguish among the different ways exclusivity can occur in Bell-inequality (and similar) scenarios. An interesting question is whether there is a graph-theoretical concept which accounts for this problem. Here we show that, for any given $N$-partite Bell inequality, an edge-coloured multigraph composed of $N$ single-colour graphs can be used to encode the relationships of exclusivity between each party's parts of the events. Then, the maximum quantum violation of the Bell inequality is exactly given by a refinement of the Lov'asz number that applies to these edge-coloured multigraphs. We show how to calculate upper bounds for this number using a hierarchy of semi-definite programs and calculate upper bounds for $I_3$, $I_{3322}$ and the three bipartite Bell inequalities whose exclusivity graph is a pentagon. The multigraph-theoretical approach introduced here may remove some obstacles in the program of explaining quantum correlations from first principles.

Recommendations

• On graph approaches to contextuality and their role in quantum theory
• A combinatorial approach to nonlocality and contextuality
• Local quasi hidden variable modelling and violations of Bell-type inequalities by a multipartite quantum state
• Linear game non-contextuality and Bell inequalities -- a graph-theoretic approach
• Exclusivity structures and graph representatives of local complementation orbits

Cited in

(9)

• Vector representations of graphs and distinguishing quantum product states with one-way LOCC
• A note of Bell inequalities for graph states
• Multi-pulse edge-localized states on quantum graphs
• Non-locality and entanglement in multi-qubit systems from a unified framework
• Small violations of Bell inequalities for multipartite pure random states
• Necessary conditions for extended noncontextuality in general sets of random variables
• Positivstellensätze for quantum multigraphs
• Quantum violations of \(N\)-qubit Svetlichny's inequalities are tightly bound by the exclusivity principle
• Exclusivity structures and graph representatives of local complementation orbits

This page was built for publication: Multigraph approach to quantum non-locality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2929176)