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.

arXiv comment14 pages, 4 figures

References in corpus (59)

• Quantum Computing in the NISQ era and beyond
• Non-Abelian Anyons and Topological Quantum Computation
• Anyons in an exactly solved model and beyond
• Quantum Simulation
• Solving the Quantum Many-Body Problem with Artificial Neural Networks
• QuTiP: An open-source Python framework for the dynamics of open quantum systems
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Machine learning phases of matter
• Fermionic quantum computation
• Skillful Precipitation Nowcasting using Deep Generative Models of Radar
• Hamiltonian Simulation by Qubitization
• Many-body quantum state tomography with neural networks
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Learning phase transitions by confusion
• Discovering Phase Transitions with Unsupervised Learning
• Quantum control theory and applications: A survey
• Unsupervised learning of phase transitions: from principal component analysis to variational autoencoders
• A Theory of Trotter Error
• Machine learning quantum phases of matter beyond the fermion sign problem
• Discovering Phases, Phase Transitions and Crossovers through Unsupervised Machine Learning: A critical examination
• Reconstructing quantum states with generative models
• Dividing Quantum Channels
• Quantum Loop Topography for Machine Learning
• Machine Learning Phases of Strongly Correlated Fermions
• Universal Quantum Computation with the nu=5/2 Fractional Quantum Hall State
• Quantum circuits of T-depth one
• Quantum Circuits for Isometries
• Braid Topologies for Quantum Computation
• Anyonic interferometry without anyons: How a flux qubit can read out a topological qubit
• Machine Learning in Electronic Quantum Matter Imaging Experiments
• A dissipative quantum Church-Turing theorem
• Simulating chemistry efficiently on fault-tolerant quantum computers
• Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits
• Efficient Discrete Approximations of Quantum Gates
• Machine Learning ${\mathbb{Z}}_2$ Quantum Spin Liquids with Quasi-particle Statistics
• Asymptotically Optimal Topological Quantum Compiling
• Topological Quantum Compiling
• Topological Quantum Compiling with Reinforcement Learning
• Efficient Decomposition of Single-Qubit Gates into $V$ Basis Circuits
• A Depth-Optimal Canonical Form for Single-qubit Quantum Circuits
• Machine Learning Bell Nonlocality in Quantum Many-body Systems
• Machine Learning Topological Phases with a Solid-state Quantum Simulator
• Quantum Channel Construction with Circuit Quantum Electrodynamics
• Solovay-Kitaev Decomposition Strategy for Single-Qubit Channels
• Parametrizations of density matrices
• Reinforcement Learning for Digital Quantum Simulation
• Quantum simulation of quantum channels in nuclear magnetic resonance
• T-count and T-depth of any multi-qubit unitary
• Experimental quantum channel simulation
• Simulation of single-qubit open quantum systems
• Quantum Circuits for Quantum Channels
• A universal set of qubit quantum channels
• Constructing Functional Braids for Low-Leakage Topological Quantum Computing
• Quantum circuit design for accurate simulation of qudit channels
• Optimising the Solovay-Kitaev algorithm
• Quantum hashing with the icosahedral group
• Quantum compiling with diffusive sets of gates
• Systematically generated two-qubit anyon braids
• 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