Quantum graph homomorphisms via operator systems

DOI10.1016/J.LAA.2016.02.019zbMATH Open1353.46041arXiv1505.00483OpenAlexW2963287525MaRDI QIDQ254876FDOQ254876

Authors: Carlos M. Ortiz, Vern I. Paulsen 

Publication date: 8 March 2016

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: We explore the concept of a graph homomorphism through the lens of C${}^{\ast }$-algebras and operator systems. We start by studying the various notions of a quantum graph homomorphism and examine how they are related to each other. We then define and study a C${}^{\ast }$-algebra that encodes all the information about these homomorphisms and establish a connection between computational complexity and the representation of these algebras. We use this C${}^{\ast }$-algebra to define a new quantum chromatic number and establish some basic properties of this number. We then suggest a way of studying these quantum graph homomorphisms using certain completely positive maps and describe their structure. Finally, we use these completely positive maps to define the notion of a "quantum" core of a graph.

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

Recommendations

• Quantum homomorphisms
• Quantum chromatic numbers via operator systems
• Quantum symmetries of graph \(C^\ast\)-algebras
• Graph homomorphisms for quantum players
• The quantum-to-classical graph homomorphism game

zbMATH Keywords

entangled gamesgraph homomorphismsnon-localityoperator systems

Mathematics Subject Classification ID

General theory of (C^*)-algebras (46L05) Operator spaces and completely bounded maps (46L07) Operator spaces (= matricially normed spaces) (47L25)

Cites Work

• Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
• Classification of injective factors. Cases \(\mathrm{II}_1\), \(\mathrm{II}_\infty\), \(\mathrm{III}_\lambda\), \(\lambda\neq 1\)
• Synchronous correlation matrices and Connes' embedding conjecture
• Zero-Error Communication via Quantum Channels, Noncommutative Graphs, and a Quantum Lovász Number
• On the Shannon capacity of a graph
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (19)

• Quantum graphs as quantum relations
• Bisynchronous games and factorizable maps
• Quantum and non-signalling graph isomorphisms
• Connectivity for quantum graphs
• Synchronous linear constraint system games
• Transitive nonlocal games
• Quantum symmetry of graph C∗-algebras associated with connected graphs
• Spectral bounds for the quantum chromatic number of quantum graphs
• Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
• A compositional approach to quantum functions
• Positively factorizable maps
• Title not available (Why is that?)
• Bigalois extensions and the graph isomorphism game
• \(\mathrm{MIP}^* = \mathrm{RE}\): a negative resolution to Connes' embedding problem and Tsirelson's problem
• Discrete quantum structures. II: Examples
• Quantum graphs: different perspectives, homomorphisms and quantum automorphisms
• Perfect strategies for non-local games
• Quantum no-signalling correlations and non-local games
• Graph isomorphism: physical resources, optimization models, and algebraic characterizations

This page was built for publication: Quantum graph homomorphisms via operator systems

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