Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1906.08728

Hybrid Quantum/Classical Derivative Theory: Analytical Gradients and Excited-State Dynamics for the Multistate Contracted Variational Quantum Eigensolver

Robert M. Parrish, Edward G. Hohenstein, Peter L. McMahon, Todd J. Martı́nez

Published Jun 20, 2019• 15 citations
arXivHTMLPDF

Abstract

The maturation of analytical derivative theory over the past few decades has enabled classical electronic structure theory to provide accurate and efficient predictions of a wide variety of observable properties. However, classical implementations of analytical derivative theory take advantage of explicit computational access to the approximate electronic wavefunctions in question, which is not possible for the emerging case of hybrid quantum/classical methods. Here, we develop an efficient Lagrangian-based approach for analytical first derivatives of hybrid quantum/classical methods using only observable quantities from the quantum portion of the algorithm. Specifically, we construct the key first-derivative property of the nuclear energy gradient for the recently-developed multistate, contracted variant of the variational quantum eigensolver (MC-VQE) within the context of the ab initio exciton model (AIEM). We show that a clean separation between the quantum and classical parts of the problem is enabled by the definition of an appropriate set of relaxed density matrices, and show how the wavefunction response equations in the quantum part of the algorithm (coupled-perturbed MC-VQE or CP-MC-VQE equations) are decoupled from the wavefunction response equations and and gradient perturbations in the classical part of the algorithm. We explore the magnitudes of the Hellmann-Feynman and response contributions to the gradients in quantum circuit simulations of MC-VQE+AIEM and demonstrate a quantum circuit simulator implementation of adiabatic excited state dynamics with MC-VQE+AIEM.

DOI
10.48550/arxiv.1906.08728

Related papers

Hybrid Quantum/Classical Derivative Theory: Analytical Gradients and Excited-State Dynamics for the Multistate Contracted Variational Quantum Eigensolver

Edward G. Hohenstein

The maturation of analytical derivative theory over the past few decades has enabled classical electronic structure theory to provide accurate and efficient predictions of a wide variety of observable properties. However, classical implementations of analytical derivative theory take advantage of explicit computational access to the approximate electronic wavefunctions in question, which is not possible for the emerging case of hybrid quantum/classical methods. Here, we develop an efficient Lagrangian-based approach for analytical first derivatives of hybrid quantum/classical methods using only observable quantities from the quantum portion of the algorithm. Specifically, we construct the key first-derivative property of the nuclear energy gradient for the recently-developed multistate, contracted variant of the variational quantum eigensolver (MC-VQE) within the context of the ab initio exciton model (AIEM). We show that a clean separation between the quantum and classical parts of the problem is enabled by the definition of an appropriate set of relaxed density matrices, and show how the wavefunction response equations in the quantum part of the algorithm (coupled-perturbed MC-VQE or CP-MC-VQE equations) are decoupled from the wavefunction response equations and and gradient perturbations in the classical part of the algorithm. We explore the magnitudes of the Hellmann-Feynman and response contributions to the gradients in quantum circuit simulations of MC-VQE+AIEM and demonstrate a quantum circuit simulator implementation of adiabatic excited state dynamics with MC-VQE+AIEM.

•Sep 17, 2020•18 citations

Analytical Ground- and Excited-State Gradients for Molecular Electronic Structure Theory from Hybrid Quantum/Classical Methods

Robert M. Parrish, Gian-Luca Anselmetti, Christian Gogolin

We develop analytical gradients of ground- and excited-state energies with respect to system parameters including the nuclear coordinates for the hybrid quantum/classical multistate contracted variational quantum eigensolver (MC-VQE) applied to fermionic systems. We show how the resulting response contributions to the gradient can be evaluated with a quantum effort similar to that of obtaining the VQE energy and independent of the total number of derivative parameters (e.g. number of nuclear coordinates) by adopting a Lagrangian formalism for the evaluation of the total derivative. We also demonstrate that large-step-size finite-difference treatment of directional derivatives in concert with the parameter shift rule can significantly mitigate the complexity of dealing with the quantum parameter Hessian when solving the quantum response equations. This enables the computation of analytical derivative properties of systems with hundreds of atoms, while solving an active space of their most strongly correlated orbitals on a quantum computer. We numerically demonstrate the exactness the analytical gradients and discuss the magnitude of the quantum response contributions.

arXiv:2110.05040•Oct 11, 2021•5 citations

Efficient quantum analytic nuclear gradients with double factorization

Edward G. Hohenstein, Oumarou Oumarou, Rachael Al-Saadon +4 more

Efficient representations of the Hamiltonian, such as double factorization, drastically reduce the circuit depth or the number of repetitions in error corrected and noisy intermediate-scale quantum (NISQ) algorithms for chemistry. We report a Lagrangian-based approach for evaluating relaxed one- and two-particle reduced density matrices from double factorized Hamiltonians, unlocking efficiency improvements in computing the nuclear gradient and related derivative properties. We demonstrate the accuracy and feasibility of our Lagrangian-based approach to recover all off-diagonal density matrix elements in classically simulated examples with up to 327 quantum and 18 470 total atoms in QM/MM simulations with modest-sized quantum active spaces. We show this in the context of the variational quantum eigensolver in case studies, such as transition state optimization, ab initio molecular dynamics simulation, and energy minimization of large molecular systems.

arXiv:2207.13144•The Journal of Chemical Physics•Feb 27, 2023•16 citations

Quantum Computation of Electronic Transitions Using a Variational Quantum Eigensolver

Robert M. Parrish, Edward G. Hohenstein, Peter L. McMahon +1 more

We develop an extension of the variational quantum eigensolver (VQE) algorithm-multistate contracted VQE (MC-VQE)-that allows for the efficient computation of the transition energies between the ground state and several low-lying excited states of a molecule, as well as the oscillator strengths associated with these transitions. We numerically simulate MC-VQE by computing the absorption spectrum of an ab initio exciton model of an 18-chromophore light-harvesting complex from purple photosynthetic bacteria.

arXiv:1901.01234•Physical Review Letters•Jun 12, 2019•281 citations

Accelerating Quantum Chemistry through Compressed Hamiltonian Representation and Efficient Quantum Analytic Energy Gradient Algorithms

Oumarou Oumarou

In ab-initio quantum chemistry, solving the electronic structure problem of a molecular system of interest to obtain an approximation of the ground and, in some cases, the excited state energies is a core and central task in various quantum chemistry processes. These include, but certainly not limited to, the calculation of the activation energy–that is the minimal energy required to launch a given chemical reaction–, the dipole and multipole moments which describe the polarity of the molecule, performing the optimization of the geometry of the molecule and searching for transition states. Furthermore, many quantum chemistry applications are predicated, not merely on the approximation of the ground state energy, but also on the corresponding first order derivatives. The body of literature of classical algorithms approximating the ground state energy and its first order derivative is extensively rich with a plethora of methods such as self-consistent mean-field methods, coupled-cluster methods, density matrix renormalization group and many more, each of which has intrinsic set of properties and characteristics that makes it suitable for specific tasks and cases. However, classical methods face a practically insurmountable challenge: the efficient computation of high accuracy approximation of ground state energies of large system sizes. This is fundamentally because the electronic structure problem provably belongs to the complexity class of QMA-hard problems. Which also means that it is out of reach for quantum algorithms as well in general. However, with certain assumptions that are expected to hold molecules of interest–that so far proved to be classically challenging because the required accuracy set by the standard of chemical accuracy threshold (generally held in quantum chemistry)– quantum algorithms can efficiently treat such cases. While originally theorized by Richard Feynmann as a potentially efficient way of simulating some classically intractable many-body systems, quantum computing has since proven to have a stronger and richer potential paving the way for the inception of new algorithms such as Shor’s algorithm for integer factorization, HHL for solving linear system of equation and Grover’s algorithm for constrained binary search, just to name a few. These algorithms provably exhibit an improvement rate that goes respectively exponentially and quadratically in the time complexity. Quantum chemistry is considered a prominent candidate to benefit from quantum computing given the variety of quantum algorithms put forth to solve the electronic structure problem of particular systems of interest. These quantum algorithm proposals can be broadly categorized in three main categories that span the spectrum: from noisy intermediate scale quantum (NISQ) computers to early and full scale fault tolerant quantum ((E)FTQC) computers. Firstly, the variational quantum eigensolver (VQE) family of quantum algorithms which variationally search for the ground state energy through the optimization of the energy of a parametrized state prepared in a quantum computer using an ansatz. Secondly, the quantum Krylov subspace diagonalization (QKSD) methods, which generate a subspace of the original Hilbert space and efficiently produce the lowest energy in said subspace as its output. Lastly, we have the quantum phase estimation (QPE) algorithms, which provably produce the ground state energy in Heisenberg scaling presenting hence a provable efficient solution. In this thesis, we firstly set to work on the problem of efficient Hamiltonian linear combination of unitaries (LCU) representation. This is mainly motivated by the wide-range impact an efficient compression of the Hamiltonian can potentially have on several quantum algorithms such as VQE, QPE...etc. We designed a method that efficiently compress the Hamiltonian representation in a way that is beneficially impactful across the set of the aforementioned quantum algorithms. Namely, we motivate and present in Sections 1.3 and 1.4 respectively, the regularized compressed double-factorization (RC-DF) and show how it reduces the energy measurement complexity both in terms of number of distinct observables and number of samples. Moreover, it also reduces the total depth of the quantum phase estimation circuit thanks to its low normalization factor. Secondly, given the importance of the energy derivatives, in Sections 2.1 and 2.2, we introduce and present an efficient quantum algorithm for the calculation of the analytic gradient of VQE energies of double-factorized Hamiltonians. Furthermore, in Section 2.1, we expand on the utility of RC-DF by presenting a quantum algorithm that determines the analytic gradient of energies measured with respect to RC-DF Hamiltonains. Third, in Section 3.1, we summarize the theoretical results of purification error-mitigation techniques, namely echo verification and virtual distillation. In Section 3.2, we report on the results of the experimental bench mark, of said techniques, performed on on Google’s Sycamore device to validate the theoretical scaling of error suppression and extrapolate the resources needed for classically intractable system sizes. Fourth, in Section 4 we establish the challenges of computing energy gradients in a quantum Krylov frame work. To overcome the problem, we provide, in Section 4.3, an efficient quantum algorithm for calculating energy derivative obtained through QKSD procedures. Our approach shows how the QKSD ground state can be prepared using quantum signal processing (QSP) and reduces the number of observables to O(1) per reduced density matrix (RDM). Lastly, in light of the importance of quantum RAMs due to their utility in a variety of quantum algorithms that require efficient initial state preparation, as explained in Section 5.5, we address the problematic exponential depth of the bucket-brigade QRAM (when decomposed). We present in Section 5.6 a very efficient Clifford+T decomposition of the bucket-brigade QRAM, which preserves the linear scaling of the depth of the circuit without introducing any additional ancilla.

•Aug 8, 2026•0 citations

Hybrid quantum-classical algorithms for solving quantum chemistry in Hamiltonian–wave-function space

Zhan-Hao Yuan, Tao Yin, Dan-Bo Zhang

The variational quantum eigensolver (VQE) typically optimizes variational parameters in a quantum circuit to prepare eigenstates for a quantum system. Its application to many problems may involve a group of Hamiltonians, e.g., a Hamiltonian of a molecule is a function of the nuclear configurations. In this paper we incorporate derivatives of the Hamiltonian into the VQE and develop some hybrid quantum-classical algorithms, which explore both Hamiltonian and wave-function spaces for solving quantum chemistry problems more efficiently. For geometry optimization, we propose a mutual gradient-descent algorithm that updates the parameters of the Hamiltonian and wave function alternately, which can give a rapid convergence towards equilibrium structures of molecules as demonstrated in numerical simulations. Moreover, to speed up the calculation of the energy potential surface, we establish differential equations that govern how the optimized variational parameters of the wave function change with the intrinsic parameters of the Hamiltonian. Our study suggests a direction for a hybrid quantum-classical algorithm for solving quantum systems more efficiently by considering spaces of both the Hamiltonian and the wave function.

arXiv:2008.09014•Physical Review A•Jan 15, 2021•13 citations
The maturation of analytical derivative theory over the past few decades has enabled classical electronic structure theory to provide accurate and efficient predictions of a wide variety of observable properties. However, classical implementations of analytical derivative theory take advantage of explicit computational access to the approximate electronic wavefunctions in question, which is not possible for the emerging case of hybrid quantum/classical methods. Here, we develop an efficient Lagrangian-based approach for analytical first derivatives of hybrid quantum/classical methods using only observable quantities from the quantum portion of the algorithm. Specifically, we construct the key first-derivative property of the nuclear energy gradient for the recently-developed multistate, contracted variant of the variational quantum eigensolver (MC-VQE) within the context of the ab initio exciton model (AIEM). We show that a clean separation between the quantum and classical parts of the problem is enabled by the definition of an appropriate set of relaxed density matrices, and show how the wavefunction response equations in the quantum part of the algorithm (coupled-perturbed MC-VQE or CP-MC-VQE equations) are decoupled from the wavefunction response equations and and gradient perturbations in the classical part of the algorithm. We explore the magnitudes of the Hellmann-Feynman and response contributions to the gradients in quantum circuit simulations of MC-VQE+AIEM and demonstrate a quantum circuit simulator implementation of adiabatic excited state dynamics with MC-VQE+AIEM.
The maturation of analytical derivative theory over the past few decades has enabled classical electronic structure theory to provide accurate and efficient predictions of a wide variety of observable properties. However, classical implementations of analytical derivative theory take advantage of explicit computational access to the approximate electronic wavefunctions in question, which is not possible for the emerging case of hybrid quantum/classical methods. Here, we develop an efficient Lagrangian-based approach for analytical first derivatives of hybrid quantum/classical methods using only observable quantities from the quantum portion of the algorithm. Specifically, we construct the key first-derivative property of the nuclear energy gradient for the recently-developed multistate, contracted variant of the variational quantum eigensolver (MC-VQE) within the context of the ab initio exciton model (AIEM). We show that a clean separation between the quantum and classical parts of the problem is enabled by the definition of an appropriate set of relaxed density matrices, and show how the wavefunction response equations in the quantum part of the algorithm (coupled-perturbed MC-VQE or CP-MC-VQE equations) are decoupled from the wavefunction response equations and and gradient perturbations in the classical part of the algorithm. We explore the magnitudes of the Hellmann-Feynman and response contributions to the gradients in quantum circuit simulations of MC-VQE+AIEM and demonstrate a quantum circuit simulator implementation of adiabatic excited state dynamics with MC-VQE+AIEM.
We develop analytical gradients of ground- and excited-state energies with respect to system parameters including the nuclear coordinates for the hybrid quantum/classical multistate contracted variational quantum eigensolver (MC-VQE) applied to fermionic systems. We show how the resulting response contributions to the gradient can be evaluated with a quantum effort similar to that of obtaining the VQE energy and independent of the total number of derivative parameters (e.g. number of nuclear coordinates) by adopting a Lagrangian formalism for the evaluation of the total derivative. We also demonstrate that large-step-size finite-difference treatment of directional derivatives in concert with the parameter shift rule can significantly mitigate the complexity of dealing with the quantum parameter Hessian when solving the quantum response equations. This enables the computation of analytical derivative properties of systems with hundreds of atoms, while solving an active space of their most strongly correlated orbitals on a quantum computer. We numerically demonstrate the exactness the analytical gradients and discuss the magnitude of the quantum response contributions.
Efficient representations of the Hamiltonian, such as double factorization, drastically reduce the circuit depth or the number of repetitions in error corrected and noisy intermediate-scale quantum (NISQ) algorithms for chemistry. We report a Lagrangian-based approach for evaluating relaxed one- and two-particle reduced density matrices from double factorized Hamiltonians, unlocking efficiency improvements in computing the nuclear gradient and related derivative properties. We demonstrate the accuracy and feasibility of our Lagrangian-based approach to recover all off-diagonal density matrix elements in classically simulated examples with up to 327 quantum and 18 470 total atoms in QM/MM simulations with modest-sized quantum active spaces. We show this in the context of the variational quantum eigensolver in case studies, such as transition state optimization, ab initio molecular dynamics simulation, and energy minimization of large molecular systems.
We develop an extension of the variational quantum eigensolver (VQE) algorithm-multistate contracted VQE (MC-VQE)-that allows for the efficient computation of the transition energies between the ground state and several low-lying excited states of a molecule, as well as the oscillator strengths associated with these transitions. We numerically simulate MC-VQE by computing the absorption spectrum of an ab initio exciton model of an 18-chromophore light-harvesting complex from purple photosynthetic bacteria.
In ab-initio quantum chemistry, solving the electronic structure problem of a molecular system of interest to obtain an approximation of the ground and, in some cases, the excited state energies is a core and central task in various quantum chemistry processes. These include, but certainly not limited to, the calculation of the activation energy–that is the minimal energy required to launch a given chemical reaction–, the dipole and multipole moments which describe the polarity of the molecule, performing the optimization of the geometry of the molecule and searching for transition states. Furthermore, many quantum chemistry applications are predicated, not merely on the approximation of the ground state energy, but also on the corresponding first order derivatives. The body of literature of classical algorithms approximating the ground state energy and its first order derivative is extensively rich with a plethora of methods such as self-consistent mean-field methods, coupled-cluster methods, density matrix renormalization group and many more, each of which has intrinsic set of properties and characteristics that makes it suitable for specific tasks and cases. However, classical methods face a practically insurmountable challenge: the efficient computation of high accuracy approximation of ground state energies of large system sizes. This is fundamentally because the electronic structure problem provably belongs to the complexity class of QMA-hard problems. Which also means that it is out of reach for quantum algorithms as well in general. However, with certain assumptions that are expected to hold molecules of interest–that so far proved to be classically challenging because the required accuracy set by the standard of chemical accuracy threshold (generally held in quantum chemistry)– quantum algorithms can efficiently treat such cases. While originally theorized by Richard Feynmann as a potentially efficient way of simulating some classically intractable many-body systems, quantum computing has since proven to have a stronger and richer potential paving the way for the inception of new algorithms such as Shor’s algorithm for integer factorization, HHL for solving linear system of equation and Grover’s algorithm for constrained binary search, just to name a few. These algorithms provably exhibit an improvement rate that goes respectively exponentially and quadratically in the time complexity. Quantum chemistry is considered a prominent candidate to benefit from quantum computing given the variety of quantum algorithms put forth to solve the electronic structure problem of particular systems of interest. These quantum algorithm proposals can be broadly categorized in three main categories that span the spectrum: from noisy intermediate scale quantum (NISQ) computers to early and full scale fault tolerant quantum ((E)FTQC) computers. Firstly, the variational quantum eigensolver (VQE) family of quantum algorithms which variationally search for the ground state energy through the optimization of the energy of a parametrized state prepared in a quantum computer using an ansatz. Secondly, the quantum Krylov subspace diagonalization (QKSD) methods, which generate a subspace of the original Hilbert space and efficiently produce the lowest energy in said subspace as its output. Lastly, we have the quantum phase estimation (QPE) algorithms, which provably produce the ground state energy in Heisenberg scaling presenting hence a provable efficient solution. In this thesis, we firstly set to work on the problem of efficient Hamiltonian linear combination of unitaries (LCU) representation. This is mainly motivated by the wide-range impact an efficient compression of the Hamiltonian can potentially have on several quantum algorithms such as VQE, QPE...etc. We designed a method that efficiently compress the Hamiltonian representation in a way that is beneficially impactful across the set of the aforementioned quantum algorithms. Namely, we motivate and present in Sections 1.3 and 1.4 respectively, the regularized compressed double-factorization (RC-DF) and show how it reduces the energy measurement complexity both in terms of number of distinct observables and number of samples. Moreover, it also reduces the total depth of the quantum phase estimation circuit thanks to its low normalization factor. Secondly, given the importance of the energy derivatives, in Sections 2.1 and 2.2, we introduce and present an efficient quantum algorithm for the calculation of the analytic gradient of VQE energies of double-factorized Hamiltonians. Furthermore, in Section 2.1, we expand on the utility of RC-DF by presenting a quantum algorithm that determines the analytic gradient of energies measured with respect to RC-DF Hamiltonains. Third, in Section 3.1, we summarize the theoretical results of purification error-mitigation techniques, namely echo verification and virtual distillation. In Section 3.2, we report on the results of the experimental bench mark, of said techniques, performed on on Google’s Sycamore device to validate the theoretical scaling of error suppression and extrapolate the resources needed for classically intractable system sizes. Fourth, in Section 4 we establish the challenges of computing energy gradients in a quantum Krylov frame work. To overcome the problem, we provide, in Section 4.3, an efficient quantum algorithm for calculating energy derivative obtained through QKSD procedures. Our approach shows how the QKSD ground state can be prepared using quantum signal processing (QSP) and reduces the number of observables to O(1) per reduced density matrix (RDM). Lastly, in light of the importance of quantum RAMs due to their utility in a variety of quantum algorithms that require efficient initial state preparation, as explained in Section 5.5, we address the problematic exponential depth of the bucket-brigade QRAM (when decomposed). We present in Section 5.6 a very efficient Clifford+T decomposition of the bucket-brigade QRAM, which preserves the linear scaling of the depth of the circuit without introducing any additional ancilla.
The variational quantum eigensolver (VQE) typically optimizes variational parameters in a quantum circuit to prepare eigenstates for a quantum system. Its application to many problems may involve a group of Hamiltonians, e.g., a Hamiltonian of a molecule is a function of the nuclear configurations. In this paper we incorporate derivatives of the Hamiltonian into the VQE and develop some hybrid quantum-classical algorithms, which explore both Hamiltonian and wave-function spaces for solving quantum chemistry problems more efficiently. For geometry optimization, we propose a mutual gradient-descent algorithm that updates the parameters of the Hamiltonian and wave function alternately, which can give a rapid convergence towards equilibrium structures of molecules as demonstrated in numerical simulations. Moreover, to speed up the calculation of the energy potential surface, we establish differential equations that govern how the optimized variational parameters of the wave function change with the intrinsic parameters of the Hamiltonian. Our study suggests a direction for a hybrid quantum-classical algorithm for solving quantum systems more efficiently by considering spaces of both the Hamiltonian and the wave function.