Complexity and capacity bounds for quantum channels

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

Research output: Contribution to journalArticle

81 Downloads (Pure)

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 Lovasz theta number
Original languageEnglish
Article number8355678
Pages (from-to)6917-6928
Number of pages12
JournalIEEE Transactions on Information Theory
Volume64
Issue number10
Early online date07 May 2018
DOIs
Publication statusPublished - 01 Oct 2018

Fingerprint

Channel capacity
Hilbert spaces

Cite this

Levene, Rupert H. ; Paulsen, Vern I. ; Todorov, Ivan G. / Complexity and capacity bounds for quantum channels. In: IEEE Transactions on Information Theory. 2018 ; Vol. 64, No. 10. pp. 6917-6928.
@article{c255a08d69ea430a8db2ee12f2523b0f,
title = "Complexity and capacity bounds for quantum channels",
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 Lovasz theta number",
author = "Levene, {Rupert H.} and Paulsen, {Vern I.} and Todorov, {Ivan G.}",
year = "2018",
month = "10",
day = "1",
doi = "10.1109/TIT.2018.2833466",
language = "English",
volume = "64",
pages = "6917--6928",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "10",

}

Complexity and capacity bounds for quantum channels. / Levene, Rupert H.; Paulsen, Vern I.; Todorov, Ivan G.

In: IEEE Transactions on Information Theory, Vol. 64, No. 10, 8355678, 01.10.2018, p. 6917-6928.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Complexity and capacity bounds for quantum channels

AU - Levene, Rupert H.

AU - Paulsen, Vern I.

AU - Todorov, Ivan G.

PY - 2018/10/1

Y1 - 2018/10/1

N2 - 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 Lovasz theta number

AB - 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 Lovasz theta number

U2 - 10.1109/TIT.2018.2833466

DO - 10.1109/TIT.2018.2833466

M3 - Article

VL - 64

SP - 6917

EP - 6928

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 10

M1 - 8355678

ER -