Quantum capacities for entanglement networks

Cui, SX; Ji, Z; Yu, N; Zeng, B

Quantum capacities for entanglement networks

Cui, SX Ji, Z

Yu, N

Zeng, B

Permalink

Publication Type:: Conference Proceeding
Citation:: IEEE International Symposium on Information Theory - Proceedings, 2016, 2016-August pp. 1685 - 1689
Issue Date:: 2016-08-10

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Accepted ManuscriptAdobe PDF (633.94 kB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Cui, SX	en_US
dc.contributor.author	Ji, Z https://orcid.org/0000-0002-7659-3178	en_US
dc.contributor.author	Yu, N https://orcid.org/0000-0003-1188-3032	en_US
dc.contributor.author	Zeng, B	en_US
dc.date.issued	2016-08-10	en_US
dc.identifier.citation	IEEE International Symposium on Information Theory - Proceedings, 2016, 2016-August pp. 1685 - 1689	en_US
dc.identifier.isbn	9781509018062	en_US
dc.identifier.issn	2157-8095	en_US
dc.identifier.uri	http://hdl.handle.net/10453/92899
dc.description.abstract	© 2016 IEEE. 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.	en_US
dc.relation.ispartof	IEEE International Symposium on Information Theory - Proceedings	en_US
dc.relation.isbasedon	10.1109/ISIT.2016.7541586	en_US
dc.title	Quantum capacities for entanglement networks	en_US
dc.type	Conference Proceeding
utslib.citation.volume	2016-August	en_US
utslib.for	0802 Computation Theory and Mathematics	en_US
utslib.for	0801 Artificial Intelligence and Image Processing	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Strength - QSI - Centre for Quantum Software and Information
utslib.copyright.status	open_access
pubs.publication-status	Published	en_US
pubs.volume	2016-August	en_US

Abstract:

© 2016 IEEE. 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.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/92899