Complexity and Capacity Bounds for Quantum Channels

DOI10.1109/TIT.2018.2833466MaRDI QIDQ4682960zbMATH OpenOpenAlexFDO

Authors Rupert H. Levene, Vern I. Paulsen, Ivan G. Todorov

Publication date 19 September 2018

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Measures of information, entropy (94A17) Channel models (including quantum) in information and communication theory (94A40)

Abstract: We generalise some well-known graph parameters to operator systems by considering their underlying quantum channels. In particular, we introduce the quantum complexity as the dimension of the smallest co-domain Hilbert space a quantum channel requires to realise a given operator system as its non-commutative confusability graph. We describe quantum complexity as a generalised minimum semidefinite rank and, in the case of a graph operator system, as a quantum intersection number. The quantum complexity and a closely related quantum version of orthogonal rank turn out to be upper bounds for the Shannon zero-error capacity of a quantum channel, and we construct examples for which these bounds beat the best previously known general upper bound for the capacity of quantum channels, given by the quantum Lov'asz theta number.

Cited in

(19)

• The quantum dynamic capacity formula of a quantum channel
• Sandwich theorems and capacity bounds for non-commutative graphs
• Information theoretic parameters of noncommutative graphs and convex corners
• Joint numerical ranges and commutativity of matrices
• Connectivity for quantum graphs
• A repeated yielding model under periodic perturbation
• New Separations in Zero-Error Channel Capacity Through Projective Kochen–Specker Sets and Quantum Coloring
• Pulsating strings from two-dimensional CFT on (T^4)^N/S(N)
• Quantum channels and representation theory
• A note on quantum entropy inequalities and channel capacities
• The capacity of the quantum multiple-access channel
• Quantum Channel Capacities per Unit Cost
• A lower bound on the quantum capacity of channels with correlated errors
• Trade-off relations for operation entropy of complementary quantum channels
• Volume of the space of qubit-qubit channels and state transformations under random quantum channels
• Spinning strings: \(\lambda\)-deformation and non-abelian T-dual limit
• Statistical phase-space complexity of continuous-variable quantum channels
• The complexity of relating quantum channels to master equations
• An action variable of the sine-Gordon model

This page was built for publication: Complexity and Capacity Bounds for Quantum Channels

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