Weighted Quantum Channel Compiling through Proximal Policy Optimization

Abstract

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 prove that, in sharp contrast to the case of compiling unitary gates, it is impossible to compile an arbitrary channel to arbitrary precision with any given finite elementary channel set, regardless of the length of the decomposition sequence. However, for a fixed accuracy $\epsilon$ one can construct a universal set with constant number of $\epsilon$-dependent elementary channels, such that an arbitrary quantum channel can be decomposed into a sequence of these elementary channels followed by a unitary gate, with the sequence length bounded by $O(\frac{1}{\epsilon }\log \frac{1}{\epsilon })$. Through a concrete example concerning topological compiling of Majorana fermions, we show that our proposed algorithm can conveniently and effectively reduce the use of expensive elementary gates through adding the weighted cost into the reward function of the proximal policy optimization.

14 pages, 4 figures

References in corpus (16)

• Non-Abelian Anyons and Topological Quantum Computation
• Skillful Precipitation Nowcasting using Deep Generative Models of Radar
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Learning phase transitions by confusion
• Discovering Phases, Phase Transitions and Crossovers through Unsupervised Machine Learning: A critical examination
• Quantum circuits of T-depth one
• Anyonic interferometry without anyons: How a flux qubit can read out a topological qubit
• Simulating chemistry efficiently on fault-tolerant quantum computers
• Topological Quantum Compiling
• Topological Quantum Compiling with Reinforcement Learning
• A Depth-Optimal Canonical Form for Single-qubit Quantum Circuits
• Machine Learning Topological Phases with a Solid-state Quantum Simulator
• Reinforcement Learning for Digital Quantum Simulation
• T-count and T-depth of any multi-qubit unitary
• Constructing Functional Braids for Low-Leakage Topological Quantum Computing
• Spin-orbit implementation of Solovay-Kitaev decomposition of single-qubit channels

Cited by in corpus (1)

• Quantum Circuit Discovery for Fault-Tolerant Logical State Preparation with Reinforcement Learning