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.

25 pages, 15 figures

References in corpus (21)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Variational Quantum Algorithms
• Many body localization and thermalization in quantum statistical mechanics
• Noisy intermediate-scale quantum (NISQ) algorithms
• Strong quantum computational advantage using a superconducting quantum processor
• 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
• Hybrid quantum-classical algorithms and quantum error mitigation
• Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
• Training variational quantum algorithms is NP-hard
• Quantum walks on a programmable two-dimensional 62-qubit superconducting processor
• General parameter-shift rules for quantum gradients
• Virtual Distillation for Quantum Error Mitigation
• Efficient estimation of Pauli observables by derandomization
• Fermionic partial tomography via classical shadows
• Estimating the gradient and higher-order derivatives on quantum hardware
• Exponential Error Suppression for Near-Term Quantum Devices
• The Dominant Eigenvector of a Noisy Quantum State
• Generalized quantum circuit differentiation rules
• Quantum Analytic Descent

Cited by in corpus (15)

• The Variational Quantum Eigensolver: a review of methods and best practices
• Shallow shadows: Expectation estimation using low-depth random Clifford 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
• Exponential distillation of dominant eigenproperties
• Biased Estimator Channels for Classical Shadows
• Covariance-based method for eigenstate factorization and generalized singlets
• Classical Shadows with Improved Median-of-Means Estimation
• 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