Quantum capacities for entanglement networks

Shawn X. Cui; Zhengfeng Ji; Nengkun Yu; Bei Zeng

doi:10.1109/ISIT.2016.7541586

Quantum capacities for entanglement networks

Shawn X. Cui
, Zhengfeng Ji
, Nengkun Yu
, Bei Zeng

Computer Science

University of California at Santa Barbara
University of Technology Sydney
University of Waterloo
University of Guelph
Canadian Institute for Advanced Research

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

We discuss quantum capacities for two types of entanglement networks: Q for the quantum repeater network with free classical communication, and R for the tensor network as the rank of the linear operation represented by the tensor network. We find that Q always equals R in the regularized case for the same network graph. However, the relationships between the corresponding one-shot capacities Q₁ and R₁ are more complicated, and the min-cut upper bound is in general not achievable. We show that the tensor network can be viewed as a stochastic protocol with the quantum repeater network, such that R₁ is a natural upper bound of Q₁. We analyze the possible gap between R₁ and Q₁ for certain networks, and compare them with the one-shot classical capacity of the corresponding classical network.

Original language	English
Title of host publication	Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1685-1689
Number of pages	5
ISBN (Electronic)	9781509018062
DOIs	https://doi.org/10.1109/ISIT.2016.7541586
State	Published - Aug 10 2016
Event	2016 IEEE International Symposium on Information Theory, ISIT 2016 - Barcelona, Spain Duration: Jul 10 2016 → Jul 15 2016

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2016-August
ISSN (Print)	2157-8095

Conference

Conference	2016 IEEE International Symposium on Information Theory, ISIT 2016
Country/Territory	Spain
City	Barcelona
Period	07/10/16 → 07/15/16

Keywords

entanglement network
network coding
quantum capacity
tensor network

Access to Document

10.1109/ISIT.2016.7541586

Cite this

Cui, S. X., Ji, Z., Yu, N., & Zeng, B. (2016). Quantum capacities for entanglement networks. In Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory (pp. 1685-1689). Article 7541586 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2016-August). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2016.7541586

@inproceedings{168d9335384c4bca869c0fee71df4229,

title = "Quantum capacities for entanglement networks",

abstract = "We discuss quantum capacities for two types of entanglement networks: Q for the quantum repeater network with free classical communication, and R for the tensor network as the rank of the linear operation represented by the tensor network. We find that Q always equals R in the regularized case for the same network graph. However, the relationships between the corresponding one-shot capacities Q1 and R1 are more complicated, and the min-cut upper bound is in general not achievable. We show that the tensor network can be viewed as a stochastic protocol with the quantum repeater network, such that R1 is a natural upper bound of Q1. We analyze the possible gap between R1 and Q1 for certain networks, and compare them with the one-shot classical capacity of the corresponding classical network.",

keywords = "entanglement network, network coding, quantum capacity, tensor network",

author = "Cui, \{Shawn X.\} and Zhengfeng Ji and Nengkun Yu and Bei Zeng",

note = "Publisher Copyright: {\textcopyright} 2016 IEEE.; 2016 IEEE International Symposium on Information Theory, ISIT 2016 ; Conference date: 10-07-2016 Through 15-07-2016",

year = "2016",

month = aug,

day = "10",

doi = "10.1109/ISIT.2016.7541586",

language = "English",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "1685--1689",

booktitle = "Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory",

}

Cui, SX, Ji, Z, Yu, N & Zeng, B 2016, Quantum capacities for entanglement networks. in Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory., 7541586, IEEE International Symposium on Information Theory - Proceedings, vol. 2016-August, Institute of Electrical and Electronics Engineers Inc., pp. 1685-1689, 2016 IEEE International Symposium on Information Theory, ISIT 2016, Barcelona, Spain, 07/10/16. https://doi.org/10.1109/ISIT.2016.7541586

Quantum capacities for entanglement networks. / Cui, Shawn X.; Ji, Zhengfeng; Yu, Nengkun et al.
Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory. Institute of Electrical and Electronics Engineers Inc., 2016. p. 1685-1689 7541586 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2016-August).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Quantum capacities for entanglement networks

AU - Cui, Shawn X.

AU - Ji, Zhengfeng

AU - Yu, Nengkun

AU - Zeng, Bei

PY - 2016/8/10

Y1 - 2016/8/10

N2 - We discuss quantum capacities for two types of entanglement networks: Q for the quantum repeater network with free classical communication, and R for the tensor network as the rank of the linear operation represented by the tensor network. We find that Q always equals R in the regularized case for the same network graph. However, the relationships between the corresponding one-shot capacities Q1 and R1 are more complicated, and the min-cut upper bound is in general not achievable. We show that the tensor network can be viewed as a stochastic protocol with the quantum repeater network, such that R1 is a natural upper bound of Q1. We analyze the possible gap between R1 and Q1 for certain networks, and compare them with the one-shot classical capacity of the corresponding classical network.

AB - We discuss quantum capacities for two types of entanglement networks: Q for the quantum repeater network with free classical communication, and R for the tensor network as the rank of the linear operation represented by the tensor network. We find that Q always equals R in the regularized case for the same network graph. However, the relationships between the corresponding one-shot capacities Q1 and R1 are more complicated, and the min-cut upper bound is in general not achievable. We show that the tensor network can be viewed as a stochastic protocol with the quantum repeater network, such that R1 is a natural upper bound of Q1. We analyze the possible gap between R1 and Q1 for certain networks, and compare them with the one-shot classical capacity of the corresponding classical network.

KW - entanglement network

KW - network coding

KW - quantum capacity

KW - tensor network

UR - https://www.scopus.com/pages/publications/84985993532

U2 - 10.1109/ISIT.2016.7541586

DO - 10.1109/ISIT.2016.7541586

M3 - Conference contribution

AN - SCOPUS:84985993532

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1685

EP - 1689

BT - Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2016 IEEE International Symposium on Information Theory, ISIT 2016

Y2 - 10 July 2016 through 15 July 2016

ER -

Quantum capacities for entanglement networks

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this