Reducing measurement costs by recycling the Hessian in adaptive variational quantum algorithms

Abstract

Adaptive protocols enable the construction of more efficient state preparation circuits in variational quantum algorithms (VQAs) by utilizing data obtained from the quantum processor during the execution of the algorithm. This idea originated with ADAPT-VQE, an algorithm that iteratively grows the state preparation circuit operator by operator, with each new operator accompanied by a new variational parameter, and where all parameters acquired thus far are optimized in each iteration. In ADAPT-VQE and other adaptive VQAs that followed it, it has been shown that initializing parameters to their optimal values from the previous iteration speeds up convergence and avoids shallow local traps in the parameter landscape. However, no other data from the optimization performed at one iteration is carried over to the next. In this work, we propose an improved quasi-Newton optimization protocol specifically tailored to adaptive VQAs. The distinctive feature in our proposal is that approximate second derivatives of the cost function are recycled across iterations in addition to parameter values. We implement a quasi-Newton optimizer where an approximation to the inverse Hessian matrix is continuously built and grown across the iterations of an adaptive VQA. The resulting algorithm has the flavor of a continuous optimization where the dimension of the search space is augmented when the gradient norm falls below a given threshold. We show that this inter-optimization exchange of second-order information leads the Hessian in the state of the optimizer to better approximate the exact Hessian. As a result, our method achieves a superlinear convergence rate even in situations where the typical quasi-Newton optimizer converges only linearly. Our protocol decreases the measurement costs in implementing adaptive VQAs on quantum hardware as well as the runtime of their classical simulation.

References in corpus (23)

• SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
• A variational eigenvalue solver on a quantum processor
• Barren plateaus in quantum neural network training landscapes
• The theory of variational hybrid quantum-classical algorithms
• Quantum Circuit Learning
• Evaluating analytic gradients on quantum hardware
• The Variational Quantum Eigensolver: a review of methods and best practices
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• Towards Practical Quantum Variational Algorithms
• qubit-ADAPT-VQE: An adaptive algorithm for constructing hardware-efficient ansatze on a quantum processor
• Layerwise learning for quantum neural networks
• Qubit-excitation-based adaptive variational quantum eigensolver
• Efficient quantum circuits for quantum computational chemistry
• Practical optimization for hybrid quantum-classical algorithms
• Classical Optimizers for Noisy Intermediate-Scale Quantum Devices
• A Comparison of Various Classical Optimizers for a Variational Quantum Linear Solver
• ADAPT-VQE is insensitive to rough parameter landscapes and barren plateaus
• A Feasible Approach for Automatically Differentiable Unitary Coupled-Cluster on Quantum Computers
• Quantum Annealing: a journey through Digitalization, Control, and hybrid Quantum Variational schemes
• An adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer
• Layering and subpool exploration for adaptive Variational Quantum Eigensolvers: Reducing circuit depth, runtime, and susceptibility to noise
• How to really measure operator gradients in ADAPT-VQE
• ADAPT-QAOA with a classically inspired initial state

Cited by in corpus (2)

• Reducing the Resources Required by ADAPT-VQE Using Coupled Exchange Operators and Improved Subroutines
• Shot-Efficient ADAPT-VQE via Reused Pauli Measurements and Variance-Based Shot Allocation