Covariant quantum combinatorics with applications to zero-error communication

DOI10.1007/S00220-023-04898-0MaRDI QIDQ6202450zbMATH OpenFDO

Authors Dominic Verdon

Publication date 26 February 2024

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

Copyright license Creative Commons Attribution 4.0 International

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

Mathematics Subject Classification ID

Foundations, quantum information and its processing, quantum axioms, and philosophy (81Pxx) Selfadjoint operator algebras ((C^*)-algebras, von Neumann ((W^*)-) algebras, etc.) (46Lxx) Categorical structures (18Dxx)

Abstract: We develop the theory of quantum (a.k.a. noncommutative) relations and quantum (a.k.a. noncommutative) graphs in the finite-dimensional covariant setting, where all systems (finite-dimensional $C^{\ast }$-algebras) carry an action of a compact quantum group $G$, and all channels (completely positive maps preserving the canonical $G$-invariant state) are covariant with respect to the $G$-actions. We motivate our definitions by applications to zero-error quantum communication theory with a symmetry constraint. Some key results are the following: 1) We give a necessary and sufficient condition for a covariant quantum relation to be the underlying relation of a covariant channel. 2) We show that every quantum confusability graph with a $G$-action (which we call a quantum $G$-graph) arises as the confusability graph of a covariant channel. 3) We show that a covariant channel is reversible precisely when its confusability $G$-graph is discrete. 4) When $G$ is quasitriangular (this includes all compact groups), we show that covariant zero-error source-channel coding schemes are classified by covariant homomorphisms between confusability $G$-graphs.

Recommendations

• Quantum graphs as quantum relations
• Quantum channels with quantum group symmetry
• Quantum Zero-Error Information Theory
• Structure of irreducibly covariant quantum channels for finite groups
• Optimal covariant quantum networks

Cites work

• scientific article; zbMATH DE number 822677 (Why is no real title available?)
• $Q$-systems and compact $W^*$-algebra objects
• 2-Dimensional Categories
• A compositional approach to quantum functions
• A covariant Stinespring theorem
• Biunitary constructions in quantum information
• Categorical quantum mechanics
• Categorically Morita equivalent compact quantum groups
• Categories for Quantum Theory
• Compact quantum groups and their representation categories
• Completely bounded homomorphisms of the Fourier algebra revisited
• Completely positive linear maps on complex matrices
• Higher semantics of quantum protocols
• Invertible quantum operations and perfect encryption of quantum states
• Limits in dagger categories
• Module categories, weak Hopf algebras and modular invariants
• Operator algebras in rigid \(\mathrm{C}^\ast\)-tensor categories
• Positive Functions on C ∗ -Algebras
• Q-system completion for \(C^\ast 2\)-categories
• Quantum Zero-Error Source-Channel Coding and Non-Commutative Graph Theory
• Quantum computation and quantum information. 10th anniversary edition
• Quantum sets
• Quantum symmetry groups of finite spaces
• Realization of rigid \(C^\ast \)-bicategories as bimodules over type \(\mathrm{II}_1\) von Neumann algebras
• Reference frames, superselection rules, and quantum information
• Reversibility conditions for quantum operations
• Reversibility of a quantum channel: general conditions and their applications to bosonic linear channels
• Structure of irreducibly covariant quantum channels for finite groups
• Temperley-Lieb quantum channels
• The Morita theory of quantum graph isomorphisms
• Torsion-freeness for fusion rings and tensor \(\mathrm C^*\)-categories
• Zero-Error Communication via Quantum Channels, Noncommutative Graphs, and a Quantum Lovász Number

Cited in

(2)

• Entanglement-invertible channels
• A universal framework for entanglement detection under group symmetry

This page was built for publication: Covariant quantum combinatorics with applications to zero-error communication

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