Efficient Quantum Analytic Nuclear Gradients with Double Factorization

Abstract

Efficient representations of the Hamiltonian such as double factorization drastically reduce circuit depth or 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 18470 total atoms in QM/MM simulations, with modest-sized quantum active spaces. We show this in the context of the variational quantum eigensolver (VQE) in case studies such as transition state optimization, ab initio molecular dynamics simulation and energy minimization of large molecular systems.

arXiv comment22 pages, 5 figures

References in corpus (21)

• A variational eigenvalue solver on a quantum processor
• The theory of variational hybrid quantum-classical algorithms
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Generalized Unitary Coupled Cluster Wavefunctions for Quantum Computation
• Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
• Quantum Computation of Electronic Transitions using a Variational Quantum Eigensolver
• Solving strongly correlated electron models on a quantum computer
• Efficient and Noise Resilient Measurements for Quantum Chemistry on Near-Term Quantum Computers
• Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
• Low rank representations for quantum simulation of electronic structure
• Fermionic partial tomography via classical shadows
• Calculating energy derivatives for quantum chemistry on a quantum computer
• Tensor hypercontraction: A universal technique for the resolution of matrix elements of local, finite-range $N$-body potentials in many-body quantum problems
• Matchgate Shadows for Fermionic Quantum Simulation
• Quantum Filter Diagonalization with Double-Factorized Hamiltonians
• Efficient ab initio auxiliary-field quantum Monte Carlo calculations in Gaussian bases via low-rank tensor decomposition
• Efficient quantum computation of molecular forces and other energy gradients
• Analytical nonadiabatic couplings and gradients within the state-averaged orbital-optimized variational quantum eigensolver
• Analytical energy gradient for state-averaged orbital-optimized variational quantum eigensolvers and its application to a photochemical reaction
• Hybrid Quantum/Classical Derivative Theory: Analytical Gradients and Excited-State Dynamics for the Multistate Contracted Variational Quantum Eigensolver
• Analytical Ground- and Excited-State Gradients for Molecular Electronic Structure Theory from Hybrid Quantum/Classical Methods

Cited by in corpus (8)

• Quantifying the effect of gate errors on variational quantum eigensolvers for quantum chemistry
• Accelerating Quantum Computations of Chemistry Through Regularized Compressed Double Factorization
• The variational quantum eigensolver self-consistent field method within a polarizable embedded framework
• Estimation of electrostatic interaction energies on a trapped-ion quantum computer
• Molecular Properties from Quantum Krylov Subspace Diagonalization
• Solvent distribution effects on quantum chemical calculations with quantum computers
• Self-consistent Quantum Linear Response with a Polarizable Embedding environment
• Extending Quantum Computing through Subspace, Embedding and Classical Molecular Dynamics Techniques