Exclusivity structures and graph representatives of local complementation orbits

DOI10.1063/1.4813438MaRDI QIDQ5407615zbMATH OpenOpenAlexWikidataFDO

Authors Adán Cabello, Matthew G. Parker, G. Scarpa, Simone Severini

Publication date 7 April 2014

Published in Journal of Mathematical Physics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Clifford algebras, spinors (15A66) Quantum coherence, entanglement, quantum correlations (81P40) Quantum computation (81P68) Quantum coding (general) (81P70) Phase-space methods including Wigner distributions, etc. applied to problems in quantum mechanics (81S30)

Abstract: We describe a construction that maps any connected graph G on three or more vertices into a larger graph, H(G), whose independence number is strictly smaller than its Lov'asz number which is equal to its fractional packing number. The vertices of H(G) represent all possible events consistent with the stabilizer group of the graph state associated with G, and exclusive events are adjacent. Mathematically, the graph H(G) corresponds to the orbit of G under local complementation. Physically, the construction translates into graph-theoretic terms the connection between a graph state and a Bell inequality maximally violated by quantum mechanics. In the context of zero-error information theory, the construction suggests a protocol achieving the maximum rate of entanglement-assisted capacity, a quantum mechanical analogue of the Shannon capacity, for each H(G). The violation of the Bell inequality is expressed by the one-shot version of this capacity being strictly larger than the independence number. Finally, given the correspondence between graphs and exclusivity structures, we are able to compute the independence number for certain infinite families of graphs with the use of quantum non-locality, therefore highlighting an application of quantum theory in the proof of a purely combinatorial statement.

Recommendations

• Multigraph approach to quantum non-locality
• Violating the Shannon capacity of metric graphs with entanglement
• Quantum homomorphisms
• Graph homomorphisms for quantum players
• Connectivity for quantum graphs

Cites work

• Entanglement in eight-qubit graph states
• Extreme quantum entanglement in a superposition of macroscopically distinct states
• Fast evaluation, weights and nonlinearity of rotation-symmetric functions
• Graphic presentations of isotropic systems
• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 5666686 (Why is no real title available?)
• scientific article; zbMATH DE number 1131873 (Why is no real title available?)
• scientific article; zbMATH DE number 3257167 (Why is no real title available?)
• Multiparty entanglement in graph states
• New Separations in Zero-Error Channel Capacity Through Projective Kochen–Specker Sets and Quantum Coloring
• On the classification of all self-dual additive codes over \(\text{GF}(4)\) of length up to 12
• On the Shannon capacity of a graph
• Quantum Error Correction and Orthogonal Geometry
• The interlace polynomial of a graph
• The Uniqueness of the $\mathrm{L}_2$ Association Scheme
• Violating the Shannon capacity of metric graphs with entanglement
• Zero-Error Communication via Quantum Channels, Noncommutative Graphs, and a Quantum Lovász Number
• Zero-error information theory

Cited in

(3)

• Multigraph approach to quantum non-locality
• A bonding model of entanglement for N-qubit graph states
• Tight upper bounds on color reversal by local inversions

This page was built for publication: Exclusivity structures and graph representatives of local complementation orbits

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