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

Bulletin of the American Physical Society

Hybrid quantum-classical algorithm for variational coupled cluster method

Sathyawageeswar Subramanian, Yudong Cao

Published Mar 4, 2019• 0 citations
OpenAlex

Related papers

The Localized Active Space Method with Unitary Selective Coupled Cluster

Abhishek Mitra, Ruhee D’Cunha, Qiaohong Wang +5 more

We introduce a hybrid quantum-classical algorithm, the localized active space unitary selective coupled cluster singles and doubles (LAS-USCCSD) method. Derived from the localized active space unitary coupled cluster (LAS-UCCSD) method, LAS-USCCSD first performs a classical LASSCF calculation, then selectively identifies the most important parameters (cluster amplitudes used to build the multireference UCC ansatz) for restoring interfragment interaction energy using this reduced set of parameters with the variational quantum eigensolver method. We benchmark LAS-USCCSD against LAS-UCCSD by calculating the total energies of (H 2 ) 2, (H 2 ) 4, and trans -butadiene, and the magnetic coupling constant for a bimetallic compound [Cr 2 (OH) 3 (NH 3 ) 6 ] 3+ . For these systems, we find that LAS-USCCSD reduces the number of required parameters and thus the circuit depth by at least 1 order of magnitude, an aspect which is important for the practical implementation of multireference hybrid quantum-classical algorithms like LAS-UCCSD on near-term quantum computers.

arXiv:2404.12927•Journal of Chemical Theory and Computation•Sep 10, 2024•11 citations

A quantum-classical hybrid variational algorithm using trapped ions

Antonios Kyprianidis, Guido Pagano, Patrick Becker +8 more

Bulletin of the American Physical Society•May 30, 2019•0 citations

Quantum-Inspired Algorithm for the Factorized Form of Unitary Coupled Cluster Theory

Jia Chen, Hai‐Ping Cheng, James K. Freericks

The factorized form of unitary coupled cluster theory (UCC) is a promising wave-function ansatz for the variational quantum eigensolver algorithm. Here, we present a quantum-inspired classical algorithm for UCC based on an exact operator identity for the individual UCC factors. We implement this algorithm for calculations of the H 10 linear chain and the H 2 O molecule with single and double ζ basis sets to provide insights into UCC as a wave-function ansatz. We find that for weakly correlated molecules, the factorized form of the UCC provides similar accuracy to conventional coupled cluster theory (CC); for strongly correlated molecules, where CC often breaks down, UCC significantly outperforms the configuration interaction (CI) ansatz. As a result, the factorized form of the UCC is an accurate, efficient, and reliable electronic structure method in both the weakly and strongly correlated regions. This classical algorithm now allows robust benchmarking of anticipated results from quantum computers and application of coupled-cluster techniques to more strongly correlated molecules.

Journal of Chemical Theory and Computation•Jan 27, 2021•44 citations

Variational and Coupled Cluster Method for Many-Particle Systems

Jay D. Mancini, Vassilios Fessatidis, Samuel P. Bowen +1 more

Bulletin of the American Physical Society•Mar 6, 2007•0 citations

The theory of variational hybrid quantum-classical algorithms

Jarrod R. McClean, Jonathan Romero, Ryan Babbush +1 more

Many quantum algorithms have daunting resource requirements when compared to what is available today. To address this discrepancy, a quantum-classical hybrid optimization scheme known as 'the quantum variational eigensolver' was developed (Peruzzo et al 2014 Nat. Commun. 5 4213 ) with the philosophy that even minimal quantum resources could be made useful when used in conjunction with classical routines. In this work we extend the general theory of this algorithm and suggest algorithmic improvements for practical implementations. Specifically, we develop a variational adiabatic ansatz and explore unitary coupled cluster where we establish a connection from second order unitary coupled cluster to universal gate sets through a relaxation of exponential operator splitting. We introduce the concept of quantum variational error suppression that allows some errors to be suppressed naturally in this algorithm on a pre-threshold quantum device. Additionally, we analyze truncation and correlated sampling in Hamiltonian averaging as ways to reduce the cost of this procedure. Finally, we show how the use of modern derivative free optimization techniques can offer dramatic computational savings of up to three orders of magnitude over previously used optimization techniques.

arXiv:1509.04279•New Journal of Physics•Feb 4, 2016•2,228 citations

Generalized Variational Coupled-Cluster Formalism

Andrei Derevianko

APS•May 1, 2001•0 citations
We introduce a hybrid quantum-classical algorithm, the localized active space unitary selective coupled cluster singles and doubles (LAS-USCCSD) method. Derived from the localized active space unitary coupled cluster (LAS-UCCSD) method, LAS-USCCSD first performs a classical LASSCF calculation, then selectively identifies the most important parameters (cluster amplitudes used to build the multireference UCC ansatz) for restoring interfragment interaction energy using this reduced set of parameters with the variational quantum eigensolver method. We benchmark LAS-USCCSD against LAS-UCCSD by calculating the total energies of (H 2 ) 2, (H 2 ) 4, and trans -butadiene, and the magnetic coupling constant for a bimetallic compound [Cr 2 (OH) 3 (NH 3 ) 6 ] 3+ . For these systems, we find that LAS-USCCSD reduces the number of required parameters and thus the circuit depth by at least 1 order of magnitude, an aspect which is important for the practical implementation of multireference hybrid quantum-classical algorithms like LAS-UCCSD on near-term quantum computers.
The factorized form of unitary coupled cluster theory (UCC) is a promising wave-function ansatz for the variational quantum eigensolver algorithm. Here, we present a quantum-inspired classical algorithm for UCC based on an exact operator identity for the individual UCC factors. We implement this algorithm for calculations of the H 10 linear chain and the H 2 O molecule with single and double ζ basis sets to provide insights into UCC as a wave-function ansatz. We find that for weakly correlated molecules, the factorized form of the UCC provides similar accuracy to conventional coupled cluster theory (CC); for strongly correlated molecules, where CC often breaks down, UCC significantly outperforms the configuration interaction (CI) ansatz. As a result, the factorized form of the UCC is an accurate, efficient, and reliable electronic structure method in both the weakly and strongly correlated regions. This classical algorithm now allows robust benchmarking of anticipated results from quantum computers and application of coupled-cluster techniques to more strongly correlated molecules.
Many quantum algorithms have daunting resource requirements when compared to what is available today. To address this discrepancy, a quantum-classical hybrid optimization scheme known as 'the quantum variational eigensolver' was developed (Peruzzo et al 2014 Nat. Commun. 5 4213 ) with the philosophy that even minimal quantum resources could be made useful when used in conjunction with classical routines. In this work we extend the general theory of this algorithm and suggest algorithmic improvements for practical implementations. Specifically, we develop a variational adiabatic ansatz and explore unitary coupled cluster where we establish a connection from second order unitary coupled cluster to universal gate sets through a relaxation of exponential operator splitting. We introduce the concept of quantum variational error suppression that allows some errors to be suppressed naturally in this algorithm on a pre-threshold quantum device. Additionally, we analyze truncation and correlated sampling in Hamiltonian averaging as ways to reduce the cost of this procedure. Finally, we show how the use of modern derivative free optimization techniques can offer dramatic computational savings of up to three orders of magnitude over previously used optimization techniques.