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.
Skip Nav Destination
,
,
,
,
,
,
Article navigation
21 March 2023
Research Article|
March 21 2023
Efficient quantum analytic nuclear gradients with double factorization Available to Purchase
Edward G. Hohenstein
;
Edward G. Hohenstein
(Conceptualization)
1
QC Ware Corporation
, Palo Alto, California 94301, USA
Search for other works by this author on:
Oumarou Oumarou
;
Oumarou Oumarou
(Conceptualization)
2
Covestro Deutschland AG
, Leverkusen 51373, Germany
Search for other works by this author on:
Rachael Al-Saadon;
Rachael Al-Saadon
(Conceptualization)
1
QC Ware Corporation
, Palo Alto, California 94301, USA
Search for other works by this author on:
Gian-Luca R. Anselmetti
;
Gian-Luca R. Anselmetti
(Conceptualization)
2
Covestro Deutschland AG
, Leverkusen 51373, Germany
Search for other works by this author on:
Maximilian Scheurer
;
Maximilian Scheurer
(Conceptualization)
2
Covestro Deutschland AG
, Leverkusen 51373, Germany
Search for other works by this author on:
Christian Gogolin
;
Christian Gogolin
a)
(Conceptualization)
2
Covestro Deutschland AG
, Leverkusen 51373, Germany
Search for other works by this author on:
Robert M. Parrish
Robert M. Parrish
a)
(Conceptualization)
1
QC Ware Corporation
, Palo Alto, California 94301, USA
Search for other works by this author on:
Edward G. Hohenstein
1
Oumarou Oumarou
2
Rachael Al-Saadon
1
Gian-Luca R. Anselmetti
2
Maximilian Scheurer
2
Christian Gogolin
2,a)
Robert M. Parrish
1,a)
1
QC Ware Corporation
, Palo Alto, California 94301, USA
2
Covestro Deutschland AG
, Leverkusen 51373, Germany
J. Chem. Phys. 158, 114119 (2023)
Article history
Received:
November 30 2022
Accepted:
February 24 2023
Citation
Edward G. Hohenstein, Oumarou Oumarou, Rachael Al-Saadon, Gian-Luca R. Anselmetti, Maximilian Scheurer, Christian Gogolin, Robert M. Parrish; Efficient quantum analytic nuclear gradients with double factorization. J. Chem. Phys. 21 March 2023; 158 (11): 114119. https://doi.org/10.1063/5.0137167
Download citation file:
Pay-Per-View Access
$40.00
Sign In
You could not be signed in. Please check your credentials and make sure you have an active account and try again.
Citing articles via
The Amsterdam Modeling Suite
Evert Jan Baerends, Nestor F. Aguirre, et al.
DeePMD-kit v2: A software package for deep potential models
Jinzhe Zeng, Duo Zhang, et al.
CREST—A program for the exploration of low-energy molecular chemical space
Philipp Pracht, Stefan Grimme, et al.
Related Content
Scaling up electronic structure calculations on quantum computers: The frozen natural orbital based method of increments
J. Chem. Phys. (July 2021)
Noise-independent route toward the genesis of a COMPACT ansatz for molecular energetics: A dynamic approach
J. Chem. Phys. (March 2024)
Hybrid quantum transfer learning for crack image classification on NISQ hardware
AIP Conf. Proc. (March 2025)
Machine learning aided dimensionality reduction toward a resource efficient projective quantum eigensolver: Formal development and pilot applications
J. Chem. Phys. (June 2023)
Enhancing computational accuracy with parallel parameter optimization in variational quantum eigensolver
AIP Advances (January 2025)