2016/02/01 by Shawn X Cui, Shawn X. Cui, Zhengfeng Ji +6 · 1 voice · 1 citation
Computer Science · Physics and Astronomy · #Quantum Information and Cryptography #Quantum Computing Algorithms and Architecture #Quantum many-body systems
paper · pdf · doi:10.48550/arxiv.1602.00401
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 samenetwork 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.