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

Elsevier eBooks

Data-driven acceleration of coupled-cluster and perturbation theory methods

Grier M. Jones, P. D. Varuna S. Pathirage, Konstantinos D. Vogiatzis

Published Sep 23, 2022• 9 citations
Publisher
DOI
10.1016/b978-0-323-90049-2.00007-x

Related papers

New Developments in Many Body Perturbation Theory and Coupled Cluster Theory

Dieter Cremer A, Zhi He

Springer eBooks•Jan 1, 1997•6 citations

Bridging the Gap Between Multi-reference Perturbation and Coupled Cluster Methods

Jeppe Olsen

CRC Press eBooks•Oct 27, 2006•0 citations

Integrating Coupled‐Cluster Theory Within AI Workflows for Accurate Molecular Geometries

Shahzad Akram, Konstantinos D. Vogiatzis

ABSTRACT We introduce a hybrid data‐driven coupled‐cluster (DDCC) framework that enables efficient coupled‐cluster singles and doubles (CCSD)‐level geometry optimizations through direct prediction of wavefunction parameters. In conventional CCSD, each optimization step requires solving the nonlinear ‐amplitude equations and the linear ‐equations, both scaling as , making geometry optimizations computationally demanding. The data‐driven CC (DDCC) scheme replaces these iterative solvers with neural network predictions of the and amplitudes, thereby removing the dominant computational bottleneck. The model utilizes a physically grounded representation of electron correlation, combining excitation‐based descriptors with a molecular orbital (MO) framework defined through orbital centroids. This design enables accurate recovery of the CC wave function parameters, which in turn yields reliable nuclear gradients throughout the optimization process. Across a diverse set of thermally perturbed geometries and out‐of‐sample molecules, DDCC reproduces CCSD geometries with near‐quantitative agreement, while reducing computational cost by over an order of magnitude. These results establish DDCC as an effective and transferable strategy for accelerating high‐level electronic structure calculations, providing a practical route toward routine CCSD‐quality geometry optimization in larger and more complex molecular systems.

Journal of Computational Chemistry•Aug 3, 2026•0 citations

Coupled cluster methods in the many body problem

Bruce H. J. McKellar

•Jan 1, 1994•0 citations

Exploration of the Two-Electron Excitation Space with Data-Driven Coupled Cluster

P. D. Varuna S. Pathirage, Justin T. Phillips, Konstantinos D. Vogiatzis

Computational cost limits the applicability of post-Hartree–Fock methods such as coupled-cluster on larger molecular systems. The data-driven coupled-cluster (DDCC) method applies machine learning to predict the coupled-cluster two-electron amplitudes ( t 2 ) using data from second-order perturbation theory (MP2). One major limitation of the DDCC models is the size of training sets that increases exponentially with the system size. Effective sampling of the amplitude space can resolve this issue. Five different amplitude selection techniques that reduce the amount of data used for training were evaluated, an approach that also prevents model overfitting and increases the portability of data-driven coupled-cluster singles and doubles to more complex molecules or larger basis sets. In combination with a localized orbital formalism to predict the CCSD t 2 amplitudes, we have achieved a 10-fold error reduction for energy calculations.

The Journal of Physical Chemistry A•Feb 29, 2024•12 citations

Foundations of coupled-cluster theory

Isaiah Shavitt, Rodney J. Bartlett

Cambridge University Press eBooks•Aug 6, 2009•1 citation
ABSTRACT We introduce a hybrid data‐driven coupled‐cluster (DDCC) framework that enables efficient coupled‐cluster singles and doubles (CCSD)‐level geometry optimizations through direct prediction of wavefunction parameters. In conventional CCSD, each optimization step requires solving the nonlinear ‐amplitude equations and the linear ‐equations, both scaling as , making geometry optimizations computationally demanding. The data‐driven CC (DDCC) scheme replaces these iterative solvers with neural network predictions of the and amplitudes, thereby removing the dominant computational bottleneck. The model utilizes a physically grounded representation of electron correlation, combining excitation‐based descriptors with a molecular orbital (MO) framework defined through orbital centroids. This design enables accurate recovery of the CC wave function parameters, which in turn yields reliable nuclear gradients throughout the optimization process. Across a diverse set of thermally perturbed geometries and out‐of‐sample molecules, DDCC reproduces CCSD geometries with near‐quantitative agreement, while reducing computational cost by over an order of magnitude. These results establish DDCC as an effective and transferable strategy for accelerating high‐level electronic structure calculations, providing a practical route toward routine CCSD‐quality geometry optimization in larger and more complex molecular systems.
Computational cost limits the applicability of post-Hartree–Fock methods such as coupled-cluster on larger molecular systems. The data-driven coupled-cluster (DDCC) method applies machine learning to predict the coupled-cluster two-electron amplitudes ( t 2 ) using data from second-order perturbation theory (MP2). One major limitation of the DDCC models is the size of training sets that increases exponentially with the system size. Effective sampling of the amplitude space can resolve this issue. Five different amplitude selection techniques that reduce the amount of data used for training were evaluated, an approach that also prevents model overfitting and increases the portability of data-driven coupled-cluster singles and doubles to more complex molecules or larger basis sets. In combination with a localized orbital formalism to predict the CCSD t 2 amplitudes, we have achieved a 10-fold error reduction for energy calculations.