Efficient quantum analytic nuclear gradients with double factorization
Abstract
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.
Read the paper
Related studies
- Chaos and quantum thermalization
- The Dalton quantum chemistry program system
- Quantum dots: synthesis, bioapplications, and toxicity
- Cord Blood Leptin and Adiponectin as Predictors of Adiposity in Children at 3 Years of Age: A Prospective Cohort Study
- A Guide to In Silico Drug Design
- Quantitative metabolomics by H-NMR and LC-MS/MS confirms altered metabolic pathways in diabetes
Go deeper in Evidence Hub
Evidence Hub adds a study data sheet (design, sample size, evidence level, key numbers), an AI summary and a chat grounded in the paper's text.