Quantum capacities for entanglement networks

Publication Type:
Conference Proceeding
IEEE International Symposium on Information Theory - Proceedings, 2016, 2016-August pp. 1685 - 1689
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
1602.00401.pdfAccepted Manuscript633.94 kB
Adobe PDF
© 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: