Policies for elementary links in a quantum network

2020-07-07 · Sumeet Khatri

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.

📄 PDF Abstract BibTeX arXiv:2007.03193

Code (0)

등록된 구현이 없습니다.

Sample Complexity of Learning Parametric Quantum Circuits

2021-07-19 · Haoyuan Cai, Qi Ye, Dong-Ling Deng

Quantum computers hold unprecedented potentials for machine learning applications. Here, we prove that physical quantum circuits are PAC (probably approximately correct) learnable on a quantum computer via empirical risk…

BIG-bench Machine Learning Quantum Machine Learning

Solving the Schrodinger equation with genetic algorithms: a practical approach

2022-10-27 · Rafael Lahoz-Beltra

The Schrodinger equation is one of the most important equations in physics and chemistry and can be solved in the simplest cases by computer numerical methods. Since the beginning of the 70s of the last century the compu…

Stochastic Optimization

Weighted Quantum Channel Compiling through Proximal Policy Optimization

2021-11-03 · Weiyuan Gong, Si Jiang, Dong-Ling Deng

We propose a general and systematic strategy to compile arbitrary quantum channels without using ancillary qubits, based on proximal policy optimization -- a powerful deep reinforcement learning algorithm. We rigorously …

Deep Reinforcement Learning

Topological Quantum Compiling with Reinforcement Learning

2020-04-09 · Yuan-Hang Zhang, Pei-Lin Zheng, Yi Zhang, Dong-Ling Deng

Quantum compiling, a process that decomposes the quantum algorithm into a series of hardware-compatible commands or elementary gates, is of fundamental importance for quantum computing. We introduce an efficient algorith…

Deep Reinforcement Learning reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)

Optimal quantum dataset for learning a unitary transformation

2022-03-01 · Zhan Yu, Xuanqiang Zhao, Benchi Zhao, Xin Wang

Unitary transformations formulate the time evolution of quantum states. How to learn a unitary transformation efficiently is a fundamental problem in quantum machine learning. The most natural and leading strategy is to …

Quantum Machine Learning