Connectivity for quantum graphs
From MaRDI portal
operator systemsquantum information theoryquantum graphsorthogonal representationsnon-commutative graphs
Measures of information, entropy (94A17) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40) Operator spaces (= matricially normed spaces) (47L25) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Functional analysis techniques applied to functions of several complex variables (32A70) Channel models (including quantum) in information and communication theory (94A40)
Abstract: In quantum information theory there is a construction for quantum channels, appropriately called a quantum graph, that generalizes the confusability graph construction for classical channels in classical information theory. In this paper, we provide a definition of connectedness for quantum graphs that generalizes the classical definition. This is used to prove a quantum version of a particular case of the classical tree-packing theorem from graph theory. Generalizations for the related notions of -connectedness and of orthogonal representation are also proposed for quantum graphs, and it is shown that orthogonal representations have the same implications for connectedness as they do in the classical case.
Recommendations
Cites work
- scientific article; zbMATH DE number 5899289 (Why is no real title available?)
- A ``quantum Ramsey theorem for operator systems
- A von Neumann algebra approach to quantum metrics
- Better short-seed quantum-proof extractors
- Chromatic numbers, Sabidussi's theorem and Hedetniemi's conjecture for non-commutative graphs
- Completely positive linear maps on complex matrices
- Completely positive maps of order zero
- Complexity and Capacity Bounds for Quantum Channels
- Edge-Disjoint Spanning Trees of Finite Graphs
- Expander graphs and their applications
- On the Problem of Decomposing a Graph into n Connected Factors
- Orthogonal representations and connectivity of graphs
- Quantum Zero-Error Source-Channel Coding and Non-Commutative Graph Theory
- Quantum graph homomorphisms via operator systems
- Quantum relations
- Superactivation of the Asymptotic Zero-Error Classical Capacity of a Quantum Channel
- Synchronous correlation matrices and Connes' embedding conjecture
- The \(\chi^2\)-divergence and mixing times of quantum Markov processes
- The ``quantum Turán problem for operator systems
- The nuclear dimension of \(C^{*}\)-algebras
- Zero-Error Communication via Quantum Channels, Noncommutative Graphs, and a Quantum Lovász Number
Cited in
(11)- Quantum graphs as quantum relations
- scientific article; zbMATH DE number 7651032 (Why is no real title available?)
- Algebraic connectedness and bipartiteness of quantum graphs
- Connections between graphs and matrix spaces
- Asymptotic dimension and coarse embeddings in the quantum setting
- Spectral gap for quantum graphs and their edge connectivity
- Every connected graph is a query graph
- Exclusivity structures and graph representatives of local complementation orbits
- Classification of quantum graphs on M2 and their quantum automorphism groups
- Confusability graphs for symmetric sets of quantum states
- Quantum graphs: different perspectives, homomorphisms and quantum automorphisms
This page was built for publication: Connectivity for quantum graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2226415)
