Policy Gradient Approach to Compilation of Variational Quantum Circuits
arXiv:2111.10227 · doi:10.22331/q-2022-09-08-797
Abstract
We propose a method for finding approximate compilations of quantum unitary transformations, based on techniques from policy gradient reinforcement learning. The choice of a stochastic policy allows us to rephrase the optimization problem in terms of probability distributions, rather than variational gates. In this framework, the optimal configuration is found by optimizing over distribution parameters, rather than over free angles. We show numerically that this approach can be more competitive than gradient-free methods, for a comparable amount of resources, both for noiseless and noisy circuits. Another interesting feature of this approach to variational compilation is that it does not need a separate register and long-range interactions to estimate the end-point fidelity, which is an improvement over methods which rely on the Hilbert-Schmidt test. We expect these techniques to be relevant for training variational circuits in other contexts.
arXiv comment17 pages, 6 figures
References in corpus (44)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Variational Inference: A Review for Statisticians
- Barren plateaus in quantum neural network training landscapes
- Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
- Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
- Hyperbolic Geometry of Complex Networks
- Evaluating analytic gradients on quantum hardware
- Noise-Induced Barren Plateaus in Variational Quantum Algorithms
- Scalable Quantum Simulation of Molecular Energies
- Quantum algorithms for quantum chemistry and quantum materials science
- Quantum Computation as Geometry
- Robust determination of molecular spectra on a quantum processor
- Quantum advantage with shallow circuits
- An initialization strategy for addressing barren plateaus in parametrized quantum circuits
- Fidelity benchmarks for two-qubit gates in silicon
- Quantum-assisted quantum compiling
- Layerwise learning for quantum neural networks
- Obstacles to State Preparation and Variational Optimization from Symmetry Protection
- Fast quantum logic gates with trapped-ion qubits
- Effect of barren plateaus on gradient-free optimization
- Reinforcement Learning with Neural Networks for Quantum Feedback
- Silicon qubit fidelities approaching incoherent noise limits via pulse engineering
- Noise Resilience of Variational Quantum Compiling
- Quantum Supremacy through the Quantum Approximate Optimization Algorithm
- Optimizing Quantum Error Correction Codes with Reinforcement Learning
- Large gradients via correlation in random parameterized quantum circuits
- Quantum advantage with noisy shallow circuits in 3D
- Barren plateaus preclude learning scramblers
- Efficient Discrete Approximations of Quantum Gates
- Hybrid quantum-classical algorithms for approximate graph coloring
- On the Universality of the Quantum Approximate Optimization Algorithm
- Reinforcement Learning for Many-Body Ground-State Preparation Inspired by Counterdiabatic Driving
- Quantum approximate optimization is computationally universal
- Quantum POMDPs
- Deep Reinforcement Learning for Quantum State Preparation with Weak Nonlinear Measurements
- Classical and Quantum Bounded Depth Approximation Algorithms
- Variational quantum compiling with double Q-learning
- Learning Unitaries by Gradient Descent
- Policy Gradient based Quantum Approximate Optimization Algorithm
- Implementation of Measurement Reduction for the Variational Quantum Eigensolver
- Quantum Observables for continuous control of the Quantum Approximate Optimization Algorithm via Reinforcement Learning
- Quantum Computational Advantage via 60-Qubit 24-Cycle Random Circuit Sampling
- The Solovay-Kitaev algorithm