## Optimal Performance of a Quantum Network

Research output: Working paper

Date | Published - 5 Jan 2016 |
---|

Original language | English |
---|

We show that the most general protocol of quantum communication between two end-points of a quantum network with arbitrary topology can be reduced to an ensemble of Choi matrices subject to local operations and classical communication. This is found by using a teleportation-based technique which applies to a wide range of quantum channels both in discrete- and continuous-variable settings, including lossy channels, quantum-limited amplifiers, dephasing and erasure channels. Thanks to this reduction, we compute the optimal rates (capacities) at which two end-points of a quantum network can transmit quantum information, distil entanglement, or distribute secret keys. These capacities are all bounded or equal to a single quantity, that we call the entanglement flux of the quantum network. As a particular case, we derive these optimal rates for the basic paradigm of a linear chain of quantum repeaters. Thus our results establish the ultimate rates for repeater-based and network-assisted quantum communications under the most relevant models of noise and decoherence.

Establishes optimal rates for network quantum communications, from linear chains of quantum repeaters to quantum networks with arbitrary topology. Comments are welcome! Soon to be updated to include broadband capacities

- quant-ph, cond-mat.other, math-ph, math.MP, physics.optics

## Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations