Southwest Quantum Information and Technology

Practical figures of merit and thresholds for entanglement distribution in quantum networks

Presenting Author: Sumeet Khatri, Louisiana State University
Contributing Author(s): Corey T. Matyas, Aliza U. Siddiqui, Jonathan P. Dowling

Before global-scale quantum networks become operational, it is important to consider how to evaluate their performance so that they can be built to achieve the desired performance. We propose two practical figures of merit for the performance of a quantum network: the average connection time and the average largest entanglement cluster size. These quantities are based on the generation of elementary links in a quantum network, which is a crucial initial requirement that must be met before any long-range entanglement distribution can be achieved and is inherently probabilistic with current implementations. We obtain bounds on these figures of merit for a particular class of quantum repeater protocols consisting of repeat-until-success elementary link generation followed by joining measurements at intermediate nodes that extend the entanglement range. Our results lead to requirements on quantum memory coherence times, requirements on repeater chain lengths in order to surpass the repeaterless rate limit, and requirements on other aspects of quantum network implementations. These requirements are based solely on the inherently probabilistic nature of elementary link generation in quantum networks, and they apply to networks with arbitrary topology.

Read this article online: https://journals.aps.org/prresearch/abstract/10.1103/PhysRevResearch.1.023032, https://arxiv.org/abs/1905.06881

(Session 9b : Sunday from 3:45pm - 4:15pm)