Training variational quantum circuits with CoVaR: covariance root finding with classical shadows

Abstract

Exploiting near-term quantum computers and achieving practical value is a considerable and exciting challenge. Most prominent candidates as variational algorithms typically aim to find the ground state of a Hamiltonian by minimising a single classical (energy) surface which is sampled from by a quantum computer. Here we introduce a method we call CoVaR, an alternative means to exploit the power of variational circuits: We find eigenstates by finding joint roots of a polynomially growing number of properties of the quantum state as covariance functions between the Hamiltonian and an operator pool of our choice. The most remarkable feature of our CoVaR approach is that it allows us to fully exploit the extremely powerful classical shadow techniques, i.e., we simultaneously estimate a very large number $>10^4-10^7$ of covariances. We randomly select covariances and estimate analytical derivatives at each iteration applying a stochastic Levenberg-Marquardt step via a large but tractable linear system of equations that we solve with a classical computer. We prove that the cost in quantum resources per iteration is comparable to a standard gradient estimation, however, we observe in numerical simulations a very significant improvement by many orders of magnitude in convergence speed. CoVaR is directly analogous to stochastic gradient-based optimisations of paramount importance to classical machine learning while we also offload significant but tractable work onto the classical processor.

arXiv comment25 pages, 15 figures

References in corpus (53)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• A variational eigenvalue solver on a quantum processor
• Variational Quantum Algorithms
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Ising formulations of many NP problems
• Many body localization and thermalization in quantum statistical mechanics
• Barren plateaus in quantum neural network training landscapes
• Noisy intermediate-scale quantum (NISQ) algorithms
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Strong quantum computational advantage using a superconducting quantum processor
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Evaluating analytic gradients on quantum hardware
• Many-body localization edge in the random-field Heisenberg chain
• The Variational Quantum Eigensolver: a review of methods and best practices
• Quantum Phases of Matter on a 256-Atom Programmable Quantum Simulator
• Elucidating Reaction Mechanisms on Quantum Computers
• Efficient variational quantum simulator incorporating active error minimisation
• Self-Verifying Variational Quantum Simulation of the Lattice Schwinger Model
• Toward the first quantum simulation with quantum speedup
• Variational ansatz-based quantum simulation of imaginary time evolution
• Hybrid quantum-classical algorithms and quantum error mitigation
• Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States
• Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
• Quantum Natural Gradient
• Variational Quantum Computation of Excited States
• Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
• Training variational quantum algorithms is NP-hard
• Quantum-assisted quantum compiling
• Quantum walks on a programmable two-dimensional 62-qubit superconducting processor
• General parameter-shift rules for quantum gradients
• Quantum Approximate Optimization of the Long-Range Ising Model with a Trapped-Ion Quantum Simulator
• QuEST and High Performance Simulation of Quantum Computers
• Virtual Distillation for Quantum Error Mitigation
• Stochastic gradient descent for hybrid quantum-classical optimization
• Efficient estimation of Pauli observables by derandomization
• Noise Resilience of Variational Quantum Compiling
• Efficient quantum measurement of Pauli operators in the presence of finite sampling error
• Fermionic partial tomography via classical shadows
• Estimating the gradient and higher-order derivatives on quantum hardware
• Determining a local Hamiltonian from a single eigenstate
• Exponential Error Suppression for Near-Term Quantum Devices
• A Compact Fermion to Qubit Mapping
• Magnetotransport of dirty-limit van Hove singularity quasiparticles
• Computational inverse method for constructing spaces of quantum models from wave functions
• The Dominant Eigenvector of a Noisy Quantum State
• Measurement cost of metric-aware variational quantum algorithms
• Robust quantum compilation and circuit optimisation via energy minimisation
• Quantum Analytic Descent
• Generalized quantum circuit differentiation rules
• Programmable networks for quantum algorithms
• QuESTlink -- Mathematica embiggened by a hardware-optimised quantum emulator
• On the Significance of the Quantum Mechanical Covariance Matrix

Cited by in corpus (16)

• The Variational Quantum Eigensolver: a review of methods and best practices
• Shallow shadows: Expectation estimation using low-depth random Clifford circuits
• Quantum natural gradient generalised to noisy and non-unitary circuits
• Quantum Error Mitigated Classical Shadows
• Probabilistic Interpolation of Quantum Rotation Angles
• Measurement optimization of variational quantum simulation by classical shadow and derandomization
• Algorithmic Shadow Spectroscopy
• Can shallow quantum circuits scramble local noise into global white noise?
• Exploring ab initio machine synthesis of quantum circuits
• Sparse Probabilistic Synthesis of Quantum Operations
• Biased Estimator Channels for Classical Shadows
• Exponential distillation of dominant eigenproperties
• Covariance-based method for eigenstate factorization and generalized singlets
• Molecular resonance identification in complex absorbing potentials via integrated quantum computing and high-throughput computing
• Hamiltonian-reconstruction distance as a success metric for the Variational Quantum Eigensolver
• Classical Shadows with Improved Median-of-Means Estimation