Topological Quantum Compiling with Reinforcement Learning

Abstract

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 algorithm based on deep reinforcement learning that compiles an arbitrary single-qubit gate into a sequence of elementary gates from a finite universal set. It generates near-optimal gate sequences with given accuracy and is generally applicable to various scenarios, independent of the hardware-feasible universal set and free from using ancillary qubits. For concreteness, we apply this algorithm to the case of topological compiling of Fibonacci anyons and obtain near-optimal braiding sequences for arbitrary single-qubit unitaries. Our algorithm may carry over to other challenging quantum discrete problems, thus opening up a new avenue for intriguing applications of deep learning in quantum physics.

6 pages, 5 figures; Supplementary Material: 4 pages, 7 figures

References in corpus (13)

• Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift
• Non-Abelian Anyons and Topological Quantum Computation
• Learning phase transitions by confusion
• Discovering Phases, Phase Transitions and Crossovers through Unsupervised Machine Learning: A critical examination
• Quantum circuits of T-depth one
• Machine learning meets quantum physics
• Simulating chemistry efficiently on fault-tolerant quantum computers
• Topological Quantum Compiling
• A Depth-Optimal Canonical Form for Single-qubit Quantum Circuits
• Machine Learning Topological Phases with a Solid-state Quantum Simulator
• An Introduction to Cartan's KAK Decomposition for QC Programmers
• Constructing Functional Braids for Low-Leakage Topological Quantum Computing
• An efficient quantum algorithm for generative machine learning

Cited by in corpus (43)

• Noisy intermediate-scale quantum (NISQ) algorithms
• Artificial Intelligence and Machine Learning for Quantum Technologies
• Transformer Quantum State: A Multi-Purpose Model for Quantum Many-Body Problems
• Optimized compiler for Distributed Quantum Computing
• Realizing a deep reinforcement learning agent discovering real-time feedback control strategies for a quantum system
• Markovian Quantum Neuroevolution for Machine Learning
• The Presence and Absence of Barren Plateaus in Tensor-network Based Machine Learning
• Reinforcement Learning for Digital Quantum Simulation
• Self-Correcting Quantum Many-Body Control using Reinforcement Learning with Tensor Networks
• Variational quantum compiling with double Q-learning
• Quantum Architecture Search with Meta-learning
• Universal Adversarial Examples and Perturbations for Quantum Classifiers
• Fibonacci anyons versus Majorana fermions
• Quantum circuit synthesis with diffusion models
• GSQAS: Graph Self-supervised Quantum Architecture Search
• Detection of entangled states supported by reinforcement learning
• Hybrid discrete-continuous compilation of trapped-ion quantum circuits with deep reinforcement learning
• Machine Learning for Estimation and Control of Quantum Systems
• Preparing Schrödinger cat states in a microwave cavity using a neural network
• Entropy Regularized Reinforcement Learning Using Large Deviation Theory
• Quantum teleportation using Ising anyons
• An RNN-policy gradient approach for quantum architecture search
• Quantum continual learning of quantum data realizing knowledge backward transfer
• Cavity-Heisenberg spin-$j$ chain quantum battery and reinforcement learning optimization
• Efficient and quantum-adaptive machine learning with fermion neural networks
• Assisted quantum simulation of open quantum systems
• Kernel-Function Based Quantum Algorithms for Finite Temperature Quantum Simulation
• Quantum Circuit Discovery for Fault-Tolerant Logical State Preparation with Reinforcement Learning
• A Rubik's Cube inspired approach to Clifford synthesis
• Topological quantum compilation of two-qubit gates
• Adaptive Random Quantum Eigensolver
• Topological quantum compilation of metaplectic anyons based on the genetic optimized algorithms
• Weighted Quantum Channel Compiling through Proximal Policy Optimization
• Graph Neural Networks for Parameterized Quantum Circuits Expressibility Estimation
• Quantum Compiling by Deep Reinforcement Learning
• A* Search Without Expansions: Learning Heuristic Functions with Deep Q-Networks
• Genetic algorithm enhanced Solovay-Kitaev algorithm for quantum compiling of Fibonacci anyons
• Estimating the degree of non-Markovianity using variational quantum circuits
• High-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization
• Modularized and Scalable Compilation for Double Quantum Dot Quatum Computing
• The ZX-calculus as a Language for Topological Quantum Computation
• The construction of a universal quantum gate set for the SU(2)k (k=5,6,7) anyon models via genetic optimized algorithm
• Approximate quantum gates compiling with self-navigation algorithm