Policies for elementary links in a quantum network

Abstract

Distributing entanglement over long distances is one of the central tasks in quantum networks. An important problem, especially for near-term quantum networks, is to develop optimal entanglement distribution protocols that take into account the limitations of current and near-term hardware, such as quantum memories with limited coherence time. We address this problem by initiating the study of quantum network protocols for entanglement distribution using the theory of decision processes, such that optimal protocols (referred to as policies in the context of decision processes) can be found using dynamic programming or reinforcement learning algorithms. As a first step, in this work we focus exclusively on the elementary link level. We start by defining a quantum decision process for elementary links, along with figures of merit for evaluating policies. We then provide two algorithms for determining policies, one of which we prove to be optimal (with respect to fidelity and success probability) among all policies. Then we show that the previously-studied memory-cutoff protocol can be phrased as a policy within our decision process framework, allowing us to obtain several new fundamental results about it. The conceptual developments and results of this work pave the way for the systematic study of the fundamental limitations of near-term quantum networks, and the requirements for physically realizing them.

17+38 pages, 5 figures. Minor changes; accepted for publication in Quantum

References in corpus (31)

• The Quantum Internet
• Quantum cryptography: Public key distribution and coin tossing
• An Elementary Quantum Network of Single Atoms in Optical Cavities
• Realization of a multi-node quantum network of remote solid-state qubits
• Quantum Repeaters with Photon Pair Sources and Multi-Mode Memories
• Quantum-enhanced machine learning
• Quantum Circuits Architecture
• Towards a global quantum network
• Long term performance of the SwissQuantum quantum key distribution network in a field environment
• Multiplexed Memory-Insensitive Quantum Repeaters
• Field and long-term demonstration of a wide area quantum key distribution network
• NetSquid, a NETwork Simulator for QUantum Information using Discrete events
• Long-Distance Entanglement Distribution with Single-Photon Sources
• System Design for a Long-Line Quantum Repeater
• Quantum repeaters with imperfect memories: cost and scalability
• Space-borne quantum memories for global quantum communication
• Entanglement Distribution in a Quantum Network, a Multi-Commodity Flow-Based Approach
• Entanglement over global distances via quantum repeaters with satellite links
• QuNetSim: A Software Framework for Quantum Networks
• On the role of memory errors in quantum repeaters
• Rate analysis for a hybrid quantum repeater
• Optimal approach to quantum communication using dynamic programming
• Quantum POMDPs
• Resource requirements for efficient quantum communication using all-photonic graph states generated from a few matter qubits
• Quantum repeaters in space
• Optimising repeater schemes for the quantum internet
• Efficient computation of the waiting time and fidelity in quantum repeater chains
• Quantum Proofs
• Versatile relative entropy bounds for quantum networks
• Optimizing Entanglement Generation and Distribution Using Genetic Algorithms
• Semihierarchical quantum repeaters based on moderate lifetime quantum memories

Cited by in corpus (17)

• Tools for quantum network design
• Simulating quantum repeater strategies for multiple satellites
• Fast and reliable entanglement distribution with quantum repeaters: principles for improving protocols using reinforcement learning
• Deep reinforcement learning for key distribution based on quantum repeaters
• Entanglement Distribution in the Quantum Internet: Knowing when to Stop!
• On the design and analysis of near-term quantum network protocols using Markov decision processes
• ReQuSim: Faithfully simulating near-term quantum repeaters
• No-Go Theorems for Universal Entanglement Purification
• Reducing classical communication costs in multiplexed quantum repeaters using hardware-aware quasi-local policies
• Modeling the performance and bandwidth of single-atom adiabatic quantum memories
• Asymmetric node placement in fiber-based quantum networks
• Research progress of artificial intelligence empowered quantum communication and quantum sensing systems
• Quantum Advantage in Distributed Sensing with Noisy Quantum Networks
• Surrogate-guided optimization in quantum networks
• Provable Optimality of the Square-Tooth Atomic Frequency Comb Quantum Memory
• Boosting end-to-end entanglement fidelity in quantum repeater networks via hybridized strategies
• A resource- and computationally-efficient protocol for multipartite entanglement distribution in Bell-pair networks