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

Chebyshev Approximated Variational Coupled Cluster for Quantum Computing

Luca Erhart, Yuichiro Yoshida, Viktor E. Khinevich, Wataru Mizukami

Published Jun 11, 2024• 3 citations
arXivHTMLPDF

Abstract

We propose an approach to approximately implement the variational coupled cluster (VCC) theory on quantum computers, which struggles with exponential scaling of computational costs on classical computers. To this end, we employ expanding the exponential cluster operator using Chebyshev polynomials and introduce two methods: the Chebyshev approximated VCC (C$^d$-VCC) and the Hermitian-part Chebyshev approximated VCC (HC$^d$-VCC), where $d$ indicates the maximum degree of the Chebyshev polynomials. The latter method decomposes the cluster operator into anti-Hermitian and Hermitian parts, with the anti-Hermitian part represented by the disentangled unitary coupled cluster ansatz and the Hermitian part approximated using Chebyshev expansion. We illustrate the implementation of the HC$^d$-VCC in a quantum circuit using the quantum singular value transformation technique. Numerical simulations show that the C$^d$-VCC rapidly converges to the exact VCC with increasing truncation degree $d$, and the HC$^d$-VCC effectively reduces the Chebyshev expansion error compared to the C$^d$-VCC. The HC$^d$-VCC method for realizing non-unitary coupled cluster wave functions on quantum computers is expected to be useful for initial state preparation on quantum computers and efficient tomography of the quantum state for post-processing on classical computers after quantum computations.

DOI
10.48550/arxiv.2406.07364

Related papers

Strategies for quantum computing molecular energies using the unitary coupled cluster ansatz

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

Abstract The variational quantum eigensolver (VQE) algorithm combines the ability of quantum computers to efficiently compute expectation values with a classical optimization routine in order to approximate ground state energies of quantum systems. In this paper, we study the application of VQE to the simulation of molecular energies using the unitary coupled cluster (UCC) ansatz. We introduce new strategies to reduce the circuit depth for the implementation of UCC and improve the optimization of the wavefunction based on efficient classical approximations of the cluster amplitudes. Additionally, we propose an analytical method to compute the energy gradient that reduces the sampling cost for gradient estimation by several orders of magnitude compared to numerical gradients. We illustrate our methodology with numerical simulations for a system of four hydrogen atoms that exhibit strong correlation and show that the circuit depth of VQE using a UCC ansatz can be reduced without introducing significant loss of accuracy in the final wavefunctions and energies.

arXiv:1701.02691•Quantum Science and Technology•Jul 17, 2018•783 citations

Efficient quantum state tomography with Chebyshev polynomials

Hao Su, Shiying Xiong, Yue Yang

Quantum computing shows promise for addressing computationally intensive problems but is constrained by the exponential resource requirements of general quantum state tomography (QST), which fully characterizes quantum states through parameter estimation. We introduce the QST with Chebyshev polynomials, an approximate tomography method for pure quantum states encoding complex-valued functions. This method reformulates tomography as the estimation of Chebyshev expansion coefficients, expressed as inner products between the target quantum state and Chebyshev basis functions, measured using the Hadamard test circuit. By treating the truncation order of the Chebyshev polynomials as a controllable parameter, the method provides a practical balance between efficiency and accuracy. For quantum states encoding functions dominated by large-scale features, such as those representing fluid flow fields, appropriate truncation enables faithful reconstruction of the dominant components via quantum circuits with linear depth, while keeping both measurement repetitions and post-processing independent of qubit count, in contrast to the exponential scaling of full measurement-based QST methods. Validation on analytic functions and numerically generated flow-field data demonstrates accurate reconstruction and effective extraction of large-scale features, indicating the method's suitability for systems governed by macroscopic dynamics.

arXiv:2509.02112•Physical Review A•Mar 13, 2026•7 citations

A stochastic approach to unitary coupled cluster

Maria-Andreea Filip, Alex J. W. Thom

Unitary coupled cluster (UCC), originally developed as a variational alternative to the popular traditional coupled cluster method, has seen a resurgence as a functional form for use on quantum computers. However, the number of excitors present in the Ansatz often presents a barrier to implementation on quantum computers. Given the natural sparsity of wavefunctions obtained from quantum Monte Carlo methods, we consider here a stochastic solution to the UCC problem. Using the coupled cluster Monte Carlo framework, we develop cluster selection schemes that capture the structure of the UCC wavefunction, as well as its Trotterized approximation, and use these to solve the corresponding projected equations. Due to the fast convergence of the equations with order in the cluster expansion, this approach scales polynomially with the size of the system. Unlike traditional UCC implementations, our approach naturally produces a non-variational estimator for the energy in the form of the projected energy. For unitary coupled cluster singles and doubles (UCCSD) in small systems, we find that this agrees well with the expectation value of the energy and, in the case of two electrons, with full configuration interaction results. For the larger N2 system, the two estimators diverge, with the projected energy approaching the coupled cluster result, while the expectation value is close to results from traditional UCCSD.

arXiv:2011.08344•The Journal of Chemical Physics•Dec 2, 2020•39 citations

Dual exponential coupled cluster theory: Unitary adaptation, implementation in the variational quantum eigensolver framework and pilot applications

Dipanjali Halder, V. S. Prasannaa, Rahul Maitra

In this paper, we have developed a unitary variant of a double exponential coupled cluster theory, which is capable of handling molecular strong correlation with arbitrary electronic complexity. With the Hartree-Fock determinant taken as the reference, we introduce a sequential product of parameterized unitary Ansätze. While the first unitary, containing the excitation operators, acts directly on the reference determinant, the second unitary, containing a set of rank-two, vacuum-annihilating scattering operators, has nontrivial action only on certain entangled states. We demonstrate the theoretical bottleneck of such an implementation in a classical computer, whereas the same is implemented in the hybrid quantum-classical variational quantum eigensolver framework with a reasonably shallow quantum circuit without any additional approximation. We have further introduced a number of variants of the proposed Ansatz with different degrees of sophistication by judiciously approximating the scattering operators. With a number of applications on strongly correlated molecules, we have shown that all our schemes can perform uniformly well throughout the molecular potential energy surface without significant additional implementation cost over the conventional unitary coupled cluster approach with single and double excitations.

arXiv:2207.05318•The Journal of Chemical Physics•Oct 17, 2022•22 citations

Nonunitary Coupled Cluster Enabled by Midcircuit Measurements on Quantum Computers

Alexandre Fleury, James Brown, Erika Lloyd +2 more

Many quantum algorithms rely on a quality initial state for optimal performance. Preparing an initial state for specific applications can considerably reduce the cost of probabilistic algorithms such as the well studied quantum phase estimation (QPE). Fortunately, in the application space of quantum chemistry, generating approximate wave functions for molecular systems is well studied, and quantum computing algorithms stand to benefit from importing these classical methods directly into a quantum circuit. In this work, we propose a state preparation method based on coupled cluster (CC) theory, which is a pillar of quantum chemistry on classical computers, by incorporating midcircuit measurements into the circuit construction. Currently, the most well studied state preparation method for quantum chemistry on quantum computers is the variational quantum eigensolver (VQE) with a unitary-CC with single- and double-electron excitation terms (UCCSD) ansatz whose operations are limited to unitary gates. We verify the accuracy of our state preparation protocol using midcircuit measurements by performing energy evaluation and state overlap computation for a set of small chemical systems. We further demonstrate that our approach leads to a reduction of the classical computation overhead, and the number of CNOT and T gates by 28 and 57% on average when compared against the standard VQE-UCCSD protocol.

arXiv:2406.11574•Journal of Chemical Theory and Computation•Dec 9, 2024•3 citations

Generalized Unitary Coupled Cluster Wave functions for Quantum Computation

Joonho Lee, William J. Huggins, Martin Head‐Gordon +1 more

We introduce a unitary coupled-cluster (UCC) ansatz termed k -UpCCGSD that is based on a family of sparse generalized doubles operators, which provides an affordable and systematically improvable unitary coupled-cluster wave function suitable for implementation on a near-term quantum computer. k -UpCCGSD employs k products of the exponential of pair coupled-cluster double excitation operators (pCCD), together with generalized single excitation operators. We compare its performance in both efficiency of implementation and accuracy with that of the generalized UCC ansatz employing the full generalized single and double excitation operators (UCCGSD), as well as with the standard ansatz employing only single and double excitations (UCCSD). k -UpCCGSD is found to show the best scaling for quantum computing applications, requiring a circuit depth of, compared with for UCCGSD, and for UCCSD, where N is the number of spin orbitals and η is the number of electrons. We analyzed the accuracy of these three ansätze by making classical benchmark calculations on the ground state and the first excited state of H 4 (STO-3G, 6-31G), H 2 O (STO-3G), and N 2 (STO-3G), making additional comparisons to conventional coupled cluster methods. The results for ground states show that k -UpCCGSD offers a good trade-off between accuracy and cost, achieving chemical accuracy for lower cost of implementation on quantum computers than both UCCGSD and UCCSD. UCCGSD is also found to be more accurate than UCCSD but at a greater cost for implementation. Excited states are calculated with an orthogonally constrained variational quantum eigensolver approach. This is seen to generally yield less accurate energies than for the corresponding ground states. We demonstrate that using a specialized multideterminantal reference state constructed from classical linear response calculations allows these excited state energetics to be improved.

arXiv:1810.02327•Journal of Chemical Theory and Computation•Nov 28, 2018•446 citations
We propose an approach to approximately implement the variational coupled cluster (VCC) theory on quantum computers, which struggles with exponential scaling of computational costs on classical computers. To this end, we employ expanding the exponential cluster operator using Chebyshev polynomials and introduce two methods: the Chebyshev approximated VCC (Cd^dd-VCC) and the Hermitian-part Chebyshev approximated VCC (HCd^dd-VCC), where ddd indicates the maximum degree of the Chebyshev polynomials. The latter method decomposes the cluster operator into anti-Hermitian and Hermitian parts, with the anti-Hermitian part represented by the disentangled unitary coupled cluster ansatz and the Hermitian part approximated using Chebyshev expansion. We illustrate the implementation of the HCd^dd-VCC in a quantum circuit using the quantum singular value transformation technique. Numerical simulations show that the Cd^dd-VCC rapidly converges to the exact VCC with increasing truncation degree ddd, and the HCd^dd-VCC effectively reduces the Chebyshev expansion error compared to the Cd^dd-VCC. The HCd^dd-VCC method for realizing non-unitary coupled cluster wave functions on quantum computers is expected to be useful for initial state preparation on quantum computers and efficient tomography of the quantum state for post-processing on classical computers after quantum computations.
Abstract The variational quantum eigensolver (VQE) algorithm combines the ability of quantum computers to efficiently compute expectation values with a classical optimization routine in order to approximate ground state energies of quantum systems. In this paper, we study the application of VQE to the simulation of molecular energies using the unitary coupled cluster (UCC) ansatz. We introduce new strategies to reduce the circuit depth for the implementation of UCC and improve the optimization of the wavefunction based on efficient classical approximations of the cluster amplitudes. Additionally, we propose an analytical method to compute the energy gradient that reduces the sampling cost for gradient estimation by several orders of magnitude compared to numerical gradients. We illustrate our methodology with numerical simulations for a system of four hydrogen atoms that exhibit strong correlation and show that the circuit depth of VQE using a UCC ansatz can be reduced without introducing significant loss of accuracy in the final wavefunctions and energies.
Quantum computing shows promise for addressing computationally intensive problems but is constrained by the exponential resource requirements of general quantum state tomography (QST), which fully characterizes quantum states through parameter estimation. We introduce the QST with Chebyshev polynomials, an approximate tomography method for pure quantum states encoding complex-valued functions. This method reformulates tomography as the estimation of Chebyshev expansion coefficients, expressed as inner products between the target quantum state and Chebyshev basis functions, measured using the Hadamard test circuit. By treating the truncation order of the Chebyshev polynomials as a controllable parameter, the method provides a practical balance between efficiency and accuracy. For quantum states encoding functions dominated by large-scale features, such as those representing fluid flow fields, appropriate truncation enables faithful reconstruction of the dominant components via quantum circuits with linear depth, while keeping both measurement repetitions and post-processing independent of qubit count, in contrast to the exponential scaling of full measurement-based QST methods. Validation on analytic functions and numerically generated flow-field data demonstrates accurate reconstruction and effective extraction of large-scale features, indicating the method's suitability for systems governed by macroscopic dynamics.
Unitary coupled cluster (UCC), originally developed as a variational alternative to the popular traditional coupled cluster method, has seen a resurgence as a functional form for use on quantum computers. However, the number of excitors present in the Ansatz often presents a barrier to implementation on quantum computers. Given the natural sparsity of wavefunctions obtained from quantum Monte Carlo methods, we consider here a stochastic solution to the UCC problem. Using the coupled cluster Monte Carlo framework, we develop cluster selection schemes that capture the structure of the UCC wavefunction, as well as its Trotterized approximation, and use these to solve the corresponding projected equations. Due to the fast convergence of the equations with order in the cluster expansion, this approach scales polynomially with the size of the system. Unlike traditional UCC implementations, our approach naturally produces a non-variational estimator for the energy in the form of the projected energy. For unitary coupled cluster singles and doubles (UCCSD) in small systems, we find that this agrees well with the expectation value of the energy and, in the case of two electrons, with full configuration interaction results. For the larger N2 system, the two estimators diverge, with the projected energy approaching the coupled cluster result, while the expectation value is close to results from traditional UCCSD.
In this paper, we have developed a unitary variant of a double exponential coupled cluster theory, which is capable of handling molecular strong correlation with arbitrary electronic complexity. With the Hartree-Fock determinant taken as the reference, we introduce a sequential product of parameterized unitary Ansätze. While the first unitary, containing the excitation operators, acts directly on the reference determinant, the second unitary, containing a set of rank-two, vacuum-annihilating scattering operators, has nontrivial action only on certain entangled states. We demonstrate the theoretical bottleneck of such an implementation in a classical computer, whereas the same is implemented in the hybrid quantum-classical variational quantum eigensolver framework with a reasonably shallow quantum circuit without any additional approximation. We have further introduced a number of variants of the proposed Ansatz with different degrees of sophistication by judiciously approximating the scattering operators. With a number of applications on strongly correlated molecules, we have shown that all our schemes can perform uniformly well throughout the molecular potential energy surface without significant additional implementation cost over the conventional unitary coupled cluster approach with single and double excitations.
Many quantum algorithms rely on a quality initial state for optimal performance. Preparing an initial state for specific applications can considerably reduce the cost of probabilistic algorithms such as the well studied quantum phase estimation (QPE). Fortunately, in the application space of quantum chemistry, generating approximate wave functions for molecular systems is well studied, and quantum computing algorithms stand to benefit from importing these classical methods directly into a quantum circuit. In this work, we propose a state preparation method based on coupled cluster (CC) theory, which is a pillar of quantum chemistry on classical computers, by incorporating midcircuit measurements into the circuit construction. Currently, the most well studied state preparation method for quantum chemistry on quantum computers is the variational quantum eigensolver (VQE) with a unitary-CC with single- and double-electron excitation terms (UCCSD) ansatz whose operations are limited to unitary gates. We verify the accuracy of our state preparation protocol using midcircuit measurements by performing energy evaluation and state overlap computation for a set of small chemical systems. We further demonstrate that our approach leads to a reduction of the classical computation overhead, and the number of CNOT and T gates by 28 and 57% on average when compared against the standard VQE-UCCSD protocol.
We introduce a unitary coupled-cluster (UCC) ansatz termed k -UpCCGSD that is based on a family of sparse generalized doubles operators, which provides an affordable and systematically improvable unitary coupled-cluster wave function suitable for implementation on a near-term quantum computer. k -UpCCGSD employs k products of the exponential of pair coupled-cluster double excitation operators (pCCD), together with generalized single excitation operators. We compare its performance in both efficiency of implementation and accuracy with that of the generalized UCC ansatz employing the full generalized single and double excitation operators (UCCGSD), as well as with the standard ansatz employing only single and double excitations (UCCSD). k -UpCCGSD is found to show the best scaling for quantum computing applications, requiring a circuit depth of, compared with for UCCGSD, and for UCCSD, where N is the number of spin orbitals and η is the number of electrons. We analyzed the accuracy of these three ansätze by making classical benchmark calculations on the ground state and the first excited state of H 4 (STO-3G, 6-31G), H 2 O (STO-3G), and N 2 (STO-3G), making additional comparisons to conventional coupled cluster methods. The results for ground states show that k -UpCCGSD offers a good trade-off between accuracy and cost, achieving chemical accuracy for lower cost of implementation on quantum computers than both UCCGSD and UCCSD. UCCGSD is also found to be more accurate than UCCSD but at a greater cost for implementation. Excited states are calculated with an orthogonally constrained variational quantum eigensolver approach. This is seen to generally yield less accurate energies than for the corresponding ground states. We demonstrate that using a specialized multideterminantal reference state constructed from classical linear response calculations allows these excited state energetics to be improved.