Analytical Performance Estimations for Quantum Repeater Network Scenarios

Abstract

Quantum repeater chains will form the backbone of future quantum networks that distribute entanglement between network nodes. Therefore, it is important to understand the entanglement distribution performance of quantum repeater chains, especially their throughput and latency. By using Markov chains to model the stochastic dynamics in quantum repeater chains, we offer analytical estimations for long-run throughput and on-demand latency of continuous entanglement distribution. We first study single-link entanglement generation using general multiheralded protocols. We then model entanglement distribution with entanglement swapping over two links, using either a single- or a double-heralded entanglement generation protocol. We also demonstrate how the two-link results offer insights into the performance of general $2^k$-link nested repeater chains. Our results enrich the quantitative understanding of quantum repeater network performance, especially the dependence on system parameters. The analytical formulae themselves are valuable reference resources for the quantum networking community. They can serve as benchmarks for quantum network simulation validation or as examples of quantum network dynamics modeling using the Markov chain formalism.

References in corpus (28)

• The Quantum Internet
• Fundamental Limits of Repeaterless Quantum Communications
• General Benchmarks for Quantum Repeaters
• Heralded entanglement between solid-state qubits separated by 3 meters
• An Elementary Quantum Network of Single Atoms in Optical Cavities
• Realization of a multi-node quantum network of remote solid-state qubits
• Efficient high-fidelity quantum computation using matter qubits and linear optics
• Deterministic delivery of remote entanglement on a quantum network
• Quantum Internet: Networking Challenges in Distributed Quantum Computing
• Entanglement Distillation between Solid-State Quantum Network Nodes
• Qubit teleportation between non-neighboring nodes in a quantum network
• End-to-end capacities of a quantum communication network
• Entanglement of Nanophotonic Quantum Memory Nodes in a Telecom Network
• NetSquid, a NETwork Simulator for QUantum Information using Discrete events
• Towards a Distributed Quantum Computing Ecosystem
• A multinode quantum network over a metropolitan area
• SeQUeNCe: A Customizable Discrete-Event Simulator of Quantum Networks
• On the waiting time in quantum repeaters with probabilistic entanglement swapping
• Experimental demonstration of entanglement delivery using a quantum network stack
• Optimal entanglement swapping in quantum repeaters
• Improved analytical bounds on delivery times of long-distance entanglement
• Quantum repeater architecture with hierarchically optimized memory buffer times
• A Throughput Optimal Scheduling Policy for a Quantum Switch
• Statistical analysis of quantum entangled network generation
• Performance metrics for the continuous distribution of entanglement in multi-user quantum networks
• Entanglement Distribution in Quantum Repeater with Purification and Optimized Buffer Time
• Adaptive, Continuous Entanglement Generation for Quantum Networks
• Entanglement buffering with two quantum memories

Cited by in corpus (3)

• Cross-Validating Quantum Network Simulators
• Quantum Advantage in Distributed Sensing with Noisy Quantum Networks
• Provable Optimality of the Square-Tooth Atomic Frequency Comb Quantum Memory