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

Beyond real: Alternative unitary cluster Jastrow models for molecular electronic structure calculations on near-term quantum computers

Nikolay V. Tkachenko, Hang Ren, W.M. Billings, Rebecca Tomann, K. Birgitta Whaley, Martin Head‐Gordon

Published May 16, 2025• 0 citations
arXivHTMLPDF

Abstract

Near-term quantum devices require wavefunction ansätze that are expressive while also of shallow circuit depth in order to both accurately and efficiently simulate molecular electronic structure. While unitary coupled cluster (e.g., UCCSD) has become a standard, the high gate count associated with the implementation of this limits its feasibility on noisy intermediate-scale quantum (NISQ) hardware. K-fold unitary cluster Jastrow (uCJ) ansätze mitigate this challenge by providing $O(kN^2)$ circuit scaling and favorable linear depth circuit implementation. Previous work has focused on the real orbital-rotation (Re-uCJ) variant of uCJ, which allows an exact (Trotter-free) implementation. Here we extend and generalize the $k$-fold uCJ framework by introducing two new variants, Im-uCJ and g-uCJ, which incorporate imaginary and fully complex orbital rotation operators, respectively. Similar to Re-uCJ, both of the new variants achieve quadratic gate-count scaling. Our results focus on the simplest $k=1$ model, and show that the uCJ models frequently maintain energy errors within chemical accuracy. Both g-uCJ and Im-uCJ are more expressive in terms of capturing electron correlation and are also more accurate than the earlier Re-uCJ ansatz. We further show that Im-uCJ and g-uCJ circuits can also be implemented exactly, without any Trotter decomposition. Numerical tests using $k=1$ on $H_2$, $H_3^+$, $Be_2$, $C_2H_4$, $C_2H_6$ and $C_6H_6$ in various basis sets confirm the practical feasibility of these shallow Jastrow-based ansätze for applications on near-term quantum hardware.

DOI
10.48550/arxiv.2505.10963

Related papers

Beyond real: alternative unitary cluster Jastrow models for molecular electronic structure calculations on near-term quantum computers

Nikolay V. Tkachenko, Hang Ren, W.M. Billings +3 more

Im-uCJ and g-uCJ ansätze extend orbital rotations into complex space. Implemented exactly via generalized Givens rotations, these ansätze achieve higher accuracy and more robust optimization than the currently available Re-uCJ.

Chemical Science•Jan 1, 2025•2 citations

Quantum Simulation of Molecular Electronic States with a Transcorrelated Hamiltonian: Higher Accuracy with Fewer Qubits

Ashutosh Kumar, Ayush Asthana, Conner Masteran +5 more

Simulation of electronic structure is one of the most promising applications on noisy intermediate-scale quantum (NISQ) era devices. However, NISQ devices suffer from a number of challenges like limited qubit connectivity, short coherence times, and sizable gate error rates. Thus, desired quantum algorithms should require shallow circuit depths and low qubit counts to take advantage of these devices. Here, we attempt to reduce quantum resource requirements for molecular simulations on a quantum computer while maintaining the desired accuracy with the help of classical quantum chemical theories of canonical transformation and explicit correlation. In this work, compact ab initio Hamiltonians are generated classically, in the second quantized form, through an approximate similarity transformation of the Hamiltonian with (a) an explicitly correlated two-body unitary operator with generalized pair excitations that remove the Coulombic electron-electron singularities from the Hamiltonian and (b) a unitary one-body operator to efficiently capture the orbital relaxation effects required for accurate description of the excited states. The resulting transcorrelated Hamiltonians are able to describe both the ground and the excited states of molecular systems in a balanced manner. Using the variational quantum eigensolver (VQE) method based on the unitary coupled cluster with singles and doubles (UCCSD) ansatz and only a minimal basis set (ANO-RCC-MB), we demonstrate that the transcorrelated Hamiltonians can produce ground state energies comparable to the reference CCSD energies with the much larger cc-pVTZ basis set. This leads to a reduction in the number of required CNOT gates by more than 3 orders of magnitude for the chemical species studied in this work. Furthermore, using the quantum equation of motion (qEOM) formalism in conjunction with the transcorrelated Hamiltonian, we are able to reduce the deviations in the excitation energies from the reference EOM-CCSD/cc-pVTZ values by an order of magnitude. The transcorrelated Hamiltonians developed here are Hermitian and contain only one- and two-body interaction terms and thus can be easily combined with any quantum algorithm for accurate electronic structure simulations.

Journal of Chemical Theory and Computation•Aug 19, 2022•44 citations

Improved parameter initialization for the (local) unitary cluster Jastrow ansatz

Wan-Hsuan Lin, Fangchun Liang, Mario Motta +3 more

The unitary cluster Jastrow (UCJ) ansatz and its variant known as local UCJ (LUCJ) are promising choices for variational quantum algorithms for chemistry due to their combination of physical motivation and hardware efficiency. The parameters of these ansatzes can be initialized from the output of a coupled cluster, singles and doubles (CCSD) calculation performed on a classical computer. However, truncating the number of repetitions of the ansatz, as well as discarding interactions to accommodate the connectivity constraints of near-term quantum processors, degrade the approximation to CCSD and the resulting energy accuracy. In this work, we propose two methods to improve the parameter initialization. The first method, which is applicable to both expectation value- and sample-based algorithms, uses compressed double factorization of the CCSD amplitudes to improve or recover the CCSD approximation. The second method, which is applicable to sample-based algorithms, uses approximate tensor network simulation to improve the quality of samples produced by the ansatz circuit. We validate our methods using exact state vector simulation on systems of up to 52 qubits, as well as experiments on superconducting quantum processors using up to 65 qubits. Our results indicate that our methods can significantly improve the output of both expectation value- and sample-based quantum algorithms.

quant-pharXiv:2511.22476•Nov 28, 2025•0 citations

Jastrow-type Decomposition in Quantum Chemistry for Low-Depth Quantum Circuits

Yuta Matsuzawa, Yuki Kurashige

We propose an efficient O( N 2 )-parameter ansatz that consists of a sequence of exponential operators, each of which is a unitary variant of Neuscamman’s cluster Jastrow operator. The ansatz can also be derived as a decomposition of T 2 amplitudes of the unitary coupled cluster with generalized singles and doubles, which gives a near full-CI energy. The proposed ansatz therefore can reproduce the uCCGSD energy, or rather will reach the exact full-CI energy because of the exponential operator product form. Because the cluster Jastrow operators are expressed by a product of number operators and the derived Pauli operator products, namely, the Jordan–Wigner strings, are all commutative, it does not require the Trotter approximation to implement to a quantum circuit and should be a good candidate for the variational quantum eigensolver algorithm of a near-term quantum computer. The accuracy of the ansatz was examined for dissociation of a nitrogen dimer, and compared with other existing O( N 2 )-parameter ansatzs. Not only the original ansatzs defined in the second-quantization form but also their Trotter-splitting variants, in which the cluster amplitudes are optimized to minimize the energy obtained with a few, typically single, Trotter steps, were examined by quantum circuit simulators.

arXiv:1909.12410•Journal of Chemical Theory and Computation•Jan 15, 2020•96 citations

Hardness of classically sampling quantum chemistry circuits

Ayoub Hafid, Hokuto Iwakiri, Kento Tsubouchi +2 more

Significant advances have been made in the study of quantum advantage both in theory and experiment, although these have mostly been limited to artificial setups. In this work, we extend the scope to address quantum advantage in tasks relevant to chemistry and physics. Specifically, we consider the unitary cluster Jastrow (UCJ) ansatz-a variant of the unitary coupled cluster ansatz, which is widely used to solve the electronic structure problem on quantum computers-to show that sampling from the output distributions of quantum circuits implementing the UCJ ansatz is likely to be classically hard. More specifically, we show that there exist UCJ circuits for which classical simulation of sampling cannot be performed in polynomial time, under a reasonable complexity-theoretical assumption that the polynomial hierarchy does not collapse. Our main contribution is to show that a class of UCJ circuits can be used to perform arbitrary instantaneous quantum polynomial-time (IQP) computations, which are already known to be classically hard to simulate under the same complexity assumption. As a side result, we also show that UCJ equipped with post-selection can generate the class post-BQP. Our demonstration, worst-case nonsimulatability of UCJ, would potentially imply quantum advantage in quantum algorithms for chemistry and physics using unitary coupled cluster type ansatzes, such as the variational quantum eigensolver and quantum-selected configuration interaction.

arXiv:2504.12893•Apr 17, 2025•1 citation

Parallelized Givens Ansatz for Molecular Ground States: Bridging Accuracy and Efficiency on NISQ Platforms

M. R. Nirmal, Ankit Khandelwal, Manoj Karunakaran Nambiar +1 more

In recent years, the Variational Quantum Eigensolver (VQE) has emerged as one of the most popular algorithms for solving the electronic structure problem on near-term quantum computers. The utility of VQE is often hindered by the limitations of current quantum hardware, including, but not limited to, short qubit coherence times and low gate fidelities. These limitations become particularly pronounced when VQE is used along with deep quantum circuits, such as those required by the ”Unitary Coupled Cluster Singles and Doubles” (UCCSD) ansatz, often resulting in significant errors. To address these issues, we propose a low-depth ansatz based on parallelized Givens rotations, which can recover substantial correlation energy while drastically reducing circuit depth and two-qubit gate counts for an arbitrary active space (AS). Also, considering the current hardware architectures with low qubit counts, we introduce a systematic way to select molecular orbitals to define active spaces (ASs) that retain significant electron correlation. We validate our approach by computing bond dissociation profiles of water and strongly correlated systems, such as molecular nitrogen and oxygen, across various ASs. Noiseless simulations using the new ansatz yield ground-state energies comparable to those from the UCCSD ansatz while reducing circuit depth by 50–70%. Moreover, in noisy simulations, our approach achieves energy error rates an order of magnitude lower than that of UCCSD. Considering the efficiency and practical usage of our ansatz, we hope that it becomes a potential choice for performing quantum chemistry calculations on near-term quantum devices.

arXiv:2504.18264•The Journal of Physical Chemistry A•Nov 7, 2025•1 citation
Near-term quantum devices require wavefunction ansätze that are expressive while also of shallow circuit depth in order to both accurately and efficiently simulate molecular electronic structure. While unitary coupled cluster (e.g., UCCSD) has become a standard, the high gate count associated with the implementation of this limits its feasibility on noisy intermediate-scale quantum (NISQ) hardware. K-fold unitary cluster Jastrow (uCJ) ansätze mitigate this challenge by providing O(kN2)O(kN^2)O(kN2) circuit scaling and favorable linear depth circuit implementation. Previous work has focused on the real orbital-rotation (Re-uCJ) variant of uCJ, which allows an exact (Trotter-free) implementation. Here we extend and generalize the kkk-fold uCJ framework by introducing two new variants, Im-uCJ and g-uCJ, which incorporate imaginary and fully complex orbital rotation operators, respectively. Similar to Re-uCJ, both of the new variants achieve quadratic gate-count scaling. Our results focus on the simplest k=1k=1k=1 model, and show that the uCJ models frequently maintain energy errors within chemical accuracy. Both g-uCJ and Im-uCJ are more expressive in terms of capturing electron correlation and are also more accurate than the earlier Re-uCJ ansatz. We further show that Im-uCJ and g-uCJ circuits can also be implemented exactly, without any Trotter decomposition. Numerical tests using k=1k=1k=1 on H2H_2H2​, H3+H_3^+H3+​, Be2Be_2Be2​, C2H4C_2H_4C2​H4​, C2H6C_2H_6C2​H6​ and C6H6C_6H_6C6​H6​ in various basis sets confirm the practical feasibility of these shallow Jastrow-based ansätze for applications on near-term quantum hardware.
Simulation of electronic structure is one of the most promising applications on noisy intermediate-scale quantum (NISQ) era devices. However, NISQ devices suffer from a number of challenges like limited qubit connectivity, short coherence times, and sizable gate error rates. Thus, desired quantum algorithms should require shallow circuit depths and low qubit counts to take advantage of these devices. Here, we attempt to reduce quantum resource requirements for molecular simulations on a quantum computer while maintaining the desired accuracy with the help of classical quantum chemical theories of canonical transformation and explicit correlation. In this work, compact ab initio Hamiltonians are generated classically, in the second quantized form, through an approximate similarity transformation of the Hamiltonian with (a) an explicitly correlated two-body unitary operator with generalized pair excitations that remove the Coulombic electron-electron singularities from the Hamiltonian and (b) a unitary one-body operator to efficiently capture the orbital relaxation effects required for accurate description of the excited states. The resulting transcorrelated Hamiltonians are able to describe both the ground and the excited states of molecular systems in a balanced manner. Using the variational quantum eigensolver (VQE) method based on the unitary coupled cluster with singles and doubles (UCCSD) ansatz and only a minimal basis set (ANO-RCC-MB), we demonstrate that the transcorrelated Hamiltonians can produce ground state energies comparable to the reference CCSD energies with the much larger cc-pVTZ basis set. This leads to a reduction in the number of required CNOT gates by more than 3 orders of magnitude for the chemical species studied in this work. Furthermore, using the quantum equation of motion (qEOM) formalism in conjunction with the transcorrelated Hamiltonian, we are able to reduce the deviations in the excitation energies from the reference EOM-CCSD/cc-pVTZ values by an order of magnitude. The transcorrelated Hamiltonians developed here are Hermitian and contain only one- and two-body interaction terms and thus can be easily combined with any quantum algorithm for accurate electronic structure simulations.
The unitary cluster Jastrow (UCJ) ansatz and its variant known as local UCJ (LUCJ) are promising choices for variational quantum algorithms for chemistry due to their combination of physical motivation and hardware efficiency. The parameters of these ansatzes can be initialized from the output of a coupled cluster, singles and doubles (CCSD) calculation performed on a classical computer. However, truncating the number of repetitions of the ansatz, as well as discarding interactions to accommodate the connectivity constraints of near-term quantum processors, degrade the approximation to CCSD and the resulting energy accuracy. In this work, we propose two methods to improve the parameter initialization. The first method, which is applicable to both expectation value- and sample-based algorithms, uses compressed double factorization of the CCSD amplitudes to improve or recover the CCSD approximation. The second method, which is applicable to sample-based algorithms, uses approximate tensor network simulation to improve the quality of samples produced by the ansatz circuit. We validate our methods using exact state vector simulation on systems of up to 52 qubits, as well as experiments on superconducting quantum processors using up to 65 qubits. Our results indicate that our methods can significantly improve the output of both expectation value- and sample-based quantum algorithms.
We propose an efficient O( N 2 )-parameter ansatz that consists of a sequence of exponential operators, each of which is a unitary variant of Neuscamman’s cluster Jastrow operator. The ansatz can also be derived as a decomposition of T 2 amplitudes of the unitary coupled cluster with generalized singles and doubles, which gives a near full-CI energy. The proposed ansatz therefore can reproduce the uCCGSD energy, or rather will reach the exact full-CI energy because of the exponential operator product form. Because the cluster Jastrow operators are expressed by a product of number operators and the derived Pauli operator products, namely, the Jordan–Wigner strings, are all commutative, it does not require the Trotter approximation to implement to a quantum circuit and should be a good candidate for the variational quantum eigensolver algorithm of a near-term quantum computer. The accuracy of the ansatz was examined for dissociation of a nitrogen dimer, and compared with other existing O( N 2 )-parameter ansatzs. Not only the original ansatzs defined in the second-quantization form but also their Trotter-splitting variants, in which the cluster amplitudes are optimized to minimize the energy obtained with a few, typically single, Trotter steps, were examined by quantum circuit simulators.
Significant advances have been made in the study of quantum advantage both in theory and experiment, although these have mostly been limited to artificial setups. In this work, we extend the scope to address quantum advantage in tasks relevant to chemistry and physics. Specifically, we consider the unitary cluster Jastrow (UCJ) ansatz-a variant of the unitary coupled cluster ansatz, which is widely used to solve the electronic structure problem on quantum computers-to show that sampling from the output distributions of quantum circuits implementing the UCJ ansatz is likely to be classically hard. More specifically, we show that there exist UCJ circuits for which classical simulation of sampling cannot be performed in polynomial time, under a reasonable complexity-theoretical assumption that the polynomial hierarchy does not collapse. Our main contribution is to show that a class of UCJ circuits can be used to perform arbitrary instantaneous quantum polynomial-time (IQP) computations, which are already known to be classically hard to simulate under the same complexity assumption. As a side result, we also show that UCJ equipped with post-selection can generate the class post-BQP. Our demonstration, worst-case nonsimulatability of UCJ, would potentially imply quantum advantage in quantum algorithms for chemistry and physics using unitary coupled cluster type ansatzes, such as the variational quantum eigensolver and quantum-selected configuration interaction.
In recent years, the Variational Quantum Eigensolver (VQE) has emerged as one of the most popular algorithms for solving the electronic structure problem on near-term quantum computers. The utility of VQE is often hindered by the limitations of current quantum hardware, including, but not limited to, short qubit coherence times and low gate fidelities. These limitations become particularly pronounced when VQE is used along with deep quantum circuits, such as those required by the ”Unitary Coupled Cluster Singles and Doubles” (UCCSD) ansatz, often resulting in significant errors. To address these issues, we propose a low-depth ansatz based on parallelized Givens rotations, which can recover substantial correlation energy while drastically reducing circuit depth and two-qubit gate counts for an arbitrary active space (AS). Also, considering the current hardware architectures with low qubit counts, we introduce a systematic way to select molecular orbitals to define active spaces (ASs) that retain significant electron correlation. We validate our approach by computing bond dissociation profiles of water and strongly correlated systems, such as molecular nitrogen and oxygen, across various ASs. Noiseless simulations using the new ansatz yield ground-state energies comparable to those from the UCCSD ansatz while reducing circuit depth by 50–70%. Moreover, in noisy simulations, our approach achieves energy error rates an order of magnitude lower than that of UCCSD. Considering the efficiency and practical usage of our ansatz, we hope that it becomes a potential choice for performing quantum chemistry calculations on near-term quantum devices.