Optimizing Quantum Variational Circuits with Deep Reinforcement Learning

Abstract

Quantum Machine Learning (QML) is considered to be one of the most promising applications of near term quantum devices. However, the optimization of quantum machine learning models presents numerous challenges arising from the imperfections of hardware and the fundamental obstacles in navigating an exponentially scaling Hilbert space. In this work, we evaluate the potential of contemporary methods in deep reinforcement learning to augment gradient based optimization routines in quantum variational circuits. We find that reinforcement learning augmented optimizers consistently outperform gradient descent in noisy environments. All code and pretrained weights are available to replicate the results or deploy the models at: https://github.com/lockwo/rl_qvc_opt.

References in corpus (13)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• A Quantum Approximate Optimization Algorithm
• Strong quantum computational advantage using a superconducting quantum processor
• Unsupervised Machine Learning on a Hybrid Quantum Computer
• Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
• Resolving catastrophic error bursts from cosmic rays in large arrays of superconducting qubits
• Leveraging Secondary Storage to Simulate Deep 54-qubit Sycamore Circuits
• Experimental Deep Reinforcement Learning for Error-Robust Gateset Design on a Superconducting Quantum Computer
• Classical Simulation of Quantum Supremacy Circuits
• Quantum circuit optimization with deep reinforcement learning
• Simulating the Sycamore quantum supremacy circuits
• Maximum Entropy RL (Provably) Solves Some Robust RL Problems
• FLIP: A flexible initializer for arbitrarily-sized parametrized quantum circuits