Quantum Capacities for Entanglement Networks
arXiv:1602.00401
Abstract
We discuss quantum capacities for two types of entanglement networks: for the quantum repeater network with free classical communication, and for the tensor network as the rank of the linear operation represented by the tensor network. We find that always equals in the regularized case for the samenetwork graph. However, the relationships between the corresponding one-shot capacities and 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 is a natural upper bound of . We analyze the possible gap between and for certain networks, and compare them with the one-shot classical capacity of the corresponding classical network.
References in corpus (12)
- The Quantum Internet
- Holographic Derivation of Entanglement Entropy from AdS/CFT
- Three qubits can be entangled in two inequivalent ways
- Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
- Causality & holographic entanglement entropy
- Measurement-based quantum computation beyond the one-way model
- Entanglement of assistance and multipartite state distillation
- Quantum network communication -- the butterfly and beyond
- Quantum Network Coding
- Perfect Quantum Network Communication Protocol Based on Classical Network Coding
- Quantum network coding for quantum repeaters
- Quantum Max-flow/Min-cut