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:2610.09151

Coupled Cluster Amplitude Extrapolation in Geometry Optimization

Jonas Beck, Michele Nottoli, Tommaso Nottoli, Luca Melega, Filippo Lipparini, Benjamin Stamm

Published Oct 6, 2026• 0 citations
arXivHTMLPDF

Abstract

In this work, we present an amplitude extrapolation ansatz for geometry optimization that uses calculations from previous steps to construct an initial guess for the quasi-Newton solver at each new geometry, significantly accelerating convergence of the coupled-cluster and Lambda solver alike. The ansatz incorporates a necessary amplitude transformation to mitigate discontinuities associated with orbital energy crossings at the Hartree-Fock level of theory, while remaining computational and memory efficient. The method is tested for a diverse set of medium-sized molecules to demonstrate a systematic and significant reduction in the number of coupled-cluster iterations compared to the conventional method.

DOI
10.48550/arxiv.2610.09151

Related papers

Accelerated coupled cluster calculations with Procrustes orbital interpolation

Simon Elias Schrader, Simen Kvaal

The coupled cluster method is considered a gold standard in quantum chemistry, reliably giving energies that are exact within chemical accuracy (1.6 mhartree). However, even in the coupled cluster single-double (CCSD) approximation, where the cluster operator is truncated to include only single and double excitations, the method scales as O(N6) in the number of electrons, and the cluster operator needs to be solved for iteratively, increasing the computation time. Inspired by eigenvector continuation, we present here an algorithm making use of the Gaussian processes that provides an improved initial guess for the coupled cluster amplitudes. The cluster operator is written as a linear combination of sample cluster operators that are obtained at particular sample geometries. By reusing the cluster operators from previous calculations in that way, it is possible to obtain a start guess for the amplitudes that surpasses both MP2 guesses and “previous geometry”-guesses in terms of the number of necessary iterations. As this improved guess is very close to the exact cluster operator, it can be used directly to calculate the CCSD energy to chemical accuracy, giving approximate CCSD energies scaling as O(N5).

arXiv:2212.07928•The Journal of Chemical Physics•Feb 27, 2023•6 citations

Unitary Selective Coupled-Cluster Method

Dmitry A. Fedorov, Yuri Alexeev, Stephen K. Gray +1 more

Simulating molecules using the Variational Quantum Eigensolver method is one of the promising applications for NISQ-era quantum computers. Designing an efficient ansatz to represent the electronic wave function is crucial in such simulations. Standard unitary coupled-cluster with singles and doubles (UCCSD) ansatz tends to have a large number of insignificant terms that do not lower the energy of the system. In this work, we present a unitary selective coupled-cluster method, a way to construct a unitary coupled-cluster ansatz iteratively using a selection procedure with excitations up to fourth order. This approach uses the electronic Hamiltonian matrix elements and the amplitudes for excitations already present in the ansatz to find the important excitations of higher order and to add them to the ansatz. The important feature of the method is that it systematically reduces the energy error with increasing ansatz size for a set of test molecules. {The main advantage of the proposed method is that the effort to increase the ansatz does not require any additional measurements on a quantum computer.}

arXiv:2109.12652•Quantum•May 2, 2022•40 citations

Optimization of the Qubit Coupled Cluster Ansatz on Classical Computers

Ilya G. Ryabinkin, S. M. Hosseini Jenab, Scott N. Genin

Immense interest in quantum computing has prompted the development of electronic structure methods that are suitable for quantum hardware. However, the slow pace at which quantum hardware progresses forces researchers to implement their ideas on classical computers despite the obvious loss of any “quantum advantage.” As a result, the so-called q uantum-inspired methods emerge. They allow one to look at the electronic structure problem from a different angle, yet to fully exploit their capacity, efficient implementations are highly desirable. Here, we report two schemes for improving the amplitude optimization in the iterative qubit coupled cluster (iQCC) method: a variational quantum eigensolver-type approach, which is based on the qubit coupled cluster (QCC) Ansatz. Our first scheme approximates the QCC unitary as a sum of symmetrical polynomials of generators up to a given order. The resulting energy expression allows for flexible control of computational complexity via the order parameter. It also guarantees smoothness of trial energies and their derivatives, which is important for gradient-based optimization strategies. The second scheme limits the size of the expansion space in which the QCC unitary is generated. It provides better control of memory requirements but, in general, may lead to the nonsmooth variation of energy estimates upon changes in amplitudes. It can be used, however, to extrapolate energies for a given set of amplitudes toward the exact QCC value. Both schemes allow for a larger number of generators to be included in the QCC form compared to the exact formulation. This reduces the number of iterations in the iQCC method and/or leads to higher accuracy. We assess the capabilities of the new schemes to perform QCC amplitudes optimization for a few molecular systems: dinitrogen (N 2, 16 qubits), water (H 2 O, 36 qubits), and tris(2-(2,4-difluorophenyl)pyridine) iridium(III), (Ir(F 2 ppy) 3, 80 qubits).

arXiv:2502.17587•Journal of Chemical Theory and Computation•Jun 17, 2025•2 citations

Reduced‐cost sparsity‐exploiting algorithm for solving coupled‐cluster equations

Jiří Brabec, Chao Yang, Evgeny Epifanovsky +2 more

We present an algorithm for reducing the computational work involved in coupled-cluster (CC) calculations by sparsifying the amplitude correction within a CC amplitude update procedure. We provide a theoretical justification for this approach, which is based on the convergence theory of inexact Newton iterations. We demonstrate by numerical examples that, in the simplest case of the CCD equations, we can sparsify the amplitude correction by setting, on average, roughly 90% nonzero elements to zeros without a major effect on the convergence of the inexact Newton iterations.

Journal of Computational Chemistry•Jan 24, 2016•4 citations

Iterative Qubit Coupled Cluster Approach with Efficient Screening of Generators

Ilya G. Ryabinkin, Robert A. Lang, Scott N. Genin +1 more

An iterative version of the qubit coupled cluster (QCC) method [I. G. Ryabinkin et al., J. Chem. Theory Comput. 2019, 14, 6317] is proposed. The new method seeks to find ground electronic energies of molecules on noisy intermediate-scale quantum devices. Each iteration involves a canonical transformation of the Hamiltonian and employs constant-size quantum circuits at the expense of increasing the Hamiltonian size. We numerically studied the convergence of the method on ground-state calculations for LiH, H 2 O, and N 2 molecules and found that the exact ground-state energies can be systematically approached only if the generators of the QCC ansatz are sampled from a specific set of operators. We report an algorithm for constructing this set that scales linearly with the size of the Hamiltonian.

arXiv:1906.11192•Journal of Chemical Theory and Computation•Jan 14, 2020•179 citations

An Efficient Implementation of Second Quantization-Based Many-Body Methods for Electrons and its Application to Coupled-Cluster with Arbitrary Excitation Level

Anna Engels-Putzka

This thesis deals with selected aspects of a new implementation of many-body methods which can be formulated in the framework of second quantization, in particular the coupled-cluster (CC) method with arbitrary excitation level. Coupled-cluster is one of the most successful and widely used quantum chemical methods for accurate calculations on small to medium-sized molecules. Since it employs a nonlinear parametrization of the wave function, its implementation is rather difficult, in particular if higher (i.e. more than double) excitations are to be included. The latter is necessary to obtain highly accurate results and also as a prerequisite for the generalization to multi-reference cases. The implementation described here has a twofold focus. One is on generality and flexibility regarding the method to be implemented, the other is on efficiency. To achieve flexibility, it is useful to have a machinery which automatically derives working equations for a given method. We realize this by applying techniques of second quantization. This work treats in particular the last step of this procedure, namely the simplification of the resulting equations by the identification of equivalent terms. The algorithm used here is based on the interpretation of algebraic terms as graphs. The derived CC equations then have to be solved iteratively. The efficiency of the program is mainly determined by the evaluation of the occurring expressions, which has to be done in each iteration step. The evaluation is split up in a sequence of tensor contractions. Their generic implementation is complicated by the particular structure of the involved tensors. We reduce each contraction to a sequence of matrix multiplications, which requires a previous data rearranging. But since matrix multiplication is the most efficient operation on modern computers, this additional effort pays off. Preliminary tests show that our program is at least as fast as the most efficient general coupled-cluster implementation so far, and the relation is expected to improve for calculations with larger basis sets where the matrix multiplication becomes the time-determining step. Finally, we give an outlook to possible further developments. In particular, the preparation of the equations before the actual evaluation (factorization) offers much potential for optimizations which we do not exploit at the moment, in contrast to the program with which we compare, which employs at least a partial optimization at this point.

•Jan 1, 2009•0 citations
In this work, we present an amplitude extrapolation ansatz for geometry optimization that uses calculations from previous steps to construct an initial guess for the quasi-Newton solver at each new geometry, significantly accelerating convergence of the coupled-cluster and Lambda solver alike. The ansatz incorporates a necessary amplitude transformation to mitigate discontinuities associated with orbital energy crossings at the Hartree-Fock level of theory, while remaining computational and memory efficient. The method is tested for a diverse set of medium-sized molecules to demonstrate a systematic and significant reduction in the number of coupled-cluster iterations compared to the conventional method.
The coupled cluster method is considered a gold standard in quantum chemistry, reliably giving energies that are exact within chemical accuracy (1.6 mhartree). However, even in the coupled cluster single-double (CCSD) approximation, where the cluster operator is truncated to include only single and double excitations, the method scales as O(N6) in the number of electrons, and the cluster operator needs to be solved for iteratively, increasing the computation time. Inspired by eigenvector continuation, we present here an algorithm making use of the Gaussian processes that provides an improved initial guess for the coupled cluster amplitudes. The cluster operator is written as a linear combination of sample cluster operators that are obtained at particular sample geometries. By reusing the cluster operators from previous calculations in that way, it is possible to obtain a start guess for the amplitudes that surpasses both MP2 guesses and “previous geometry”-guesses in terms of the number of necessary iterations. As this improved guess is very close to the exact cluster operator, it can be used directly to calculate the CCSD energy to chemical accuracy, giving approximate CCSD energies scaling as O(N5).
Simulating molecules using the Variational Quantum Eigensolver method is one of the promising applications for NISQ-era quantum computers. Designing an efficient ansatz to represent the electronic wave function is crucial in such simulations. Standard unitary coupled-cluster with singles and doubles (UCCSD) ansatz tends to have a large number of insignificant terms that do not lower the energy of the system. In this work, we present a unitary selective coupled-cluster method, a way to construct a unitary coupled-cluster ansatz iteratively using a selection procedure with excitations up to fourth order. This approach uses the electronic Hamiltonian matrix elements and the amplitudes for excitations already present in the ansatz to find the important excitations of higher order and to add them to the ansatz. The important feature of the method is that it systematically reduces the energy error with increasing ansatz size for a set of test molecules. {The main advantage of the proposed method is that the effort to increase the ansatz does not require any additional measurements on a quantum computer.}
Immense interest in quantum computing has prompted the development of electronic structure methods that are suitable for quantum hardware. However, the slow pace at which quantum hardware progresses forces researchers to implement their ideas on classical computers despite the obvious loss of any “quantum advantage.” As a result, the so-called q uantum-inspired methods emerge. They allow one to look at the electronic structure problem from a different angle, yet to fully exploit their capacity, efficient implementations are highly desirable. Here, we report two schemes for improving the amplitude optimization in the iterative qubit coupled cluster (iQCC) method: a variational quantum eigensolver-type approach, which is based on the qubit coupled cluster (QCC) Ansatz. Our first scheme approximates the QCC unitary as a sum of symmetrical polynomials of generators up to a given order. The resulting energy expression allows for flexible control of computational complexity via the order parameter. It also guarantees smoothness of trial energies and their derivatives, which is important for gradient-based optimization strategies. The second scheme limits the size of the expansion space in which the QCC unitary is generated. It provides better control of memory requirements but, in general, may lead to the nonsmooth variation of energy estimates upon changes in amplitudes. It can be used, however, to extrapolate energies for a given set of amplitudes toward the exact QCC value. Both schemes allow for a larger number of generators to be included in the QCC form compared to the exact formulation. This reduces the number of iterations in the iQCC method and/or leads to higher accuracy. We assess the capabilities of the new schemes to perform QCC amplitudes optimization for a few molecular systems: dinitrogen (N 2, 16 qubits), water (H 2 O, 36 qubits), and tris(2-(2,4-difluorophenyl)pyridine) iridium(III), (Ir(F 2 ppy) 3, 80 qubits).
We present an algorithm for reducing the computational work involved in coupled-cluster (CC) calculations by sparsifying the amplitude correction within a CC amplitude update procedure. We provide a theoretical justification for this approach, which is based on the convergence theory of inexact Newton iterations. We demonstrate by numerical examples that, in the simplest case of the CCD equations, we can sparsify the amplitude correction by setting, on average, roughly 90% nonzero elements to zeros without a major effect on the convergence of the inexact Newton iterations.
An iterative version of the qubit coupled cluster (QCC) method [I. G. Ryabinkin et al., J. Chem. Theory Comput. 2019, 14, 6317] is proposed. The new method seeks to find ground electronic energies of molecules on noisy intermediate-scale quantum devices. Each iteration involves a canonical transformation of the Hamiltonian and employs constant-size quantum circuits at the expense of increasing the Hamiltonian size. We numerically studied the convergence of the method on ground-state calculations for LiH, H 2 O, and N 2 molecules and found that the exact ground-state energies can be systematically approached only if the generators of the QCC ansatz are sampled from a specific set of operators. We report an algorithm for constructing this set that scales linearly with the size of the Hamiltonian.
This thesis deals with selected aspects of a new implementation of many-body methods which can be formulated in the framework of second quantization, in particular the coupled-cluster (CC) method with arbitrary excitation level. Coupled-cluster is one of the most successful and widely used quantum chemical methods for accurate calculations on small to medium-sized molecules. Since it employs a nonlinear parametrization of the wave function, its implementation is rather difficult, in particular if higher (i.e. more than double) excitations are to be included. The latter is necessary to obtain highly accurate results and also as a prerequisite for the generalization to multi-reference cases. The implementation described here has a twofold focus. One is on generality and flexibility regarding the method to be implemented, the other is on efficiency. To achieve flexibility, it is useful to have a machinery which automatically derives working equations for a given method. We realize this by applying techniques of second quantization. This work treats in particular the last step of this procedure, namely the simplification of the resulting equations by the identification of equivalent terms. The algorithm used here is based on the interpretation of algebraic terms as graphs. The derived CC equations then have to be solved iteratively. The efficiency of the program is mainly determined by the evaluation of the occurring expressions, which has to be done in each iteration step. The evaluation is split up in a sequence of tensor contractions. Their generic implementation is complicated by the particular structure of the involved tensors. We reduce each contraction to a sequence of matrix multiplications, which requires a previous data rearranging. But since matrix multiplication is the most efficient operation on modern computers, this additional effort pays off. Preliminary tests show that our program is at least as fast as the most efficient general coupled-cluster implementation so far, and the relation is expected to improve for calculations with larger basis sets where the matrix multiplication becomes the time-determining step. Finally, we give an outlook to possible further developments. In particular, the preparation of the equations before the actual evaluation (factorization) offers much potential for optimizations which we do not exploit at the moment, in contrast to the program with which we compare, which employs at least a partial optimization at this point.