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

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

Wan-Hsuan Lin, Fangchun Liang, Mario Motta, Haimeng Zhang, Kenneth M. Merz, Kevin J. Sung

quant-phSubmitted Nov 27, 2025• Announced Nov 28, 2025• 13 citations
arXivHTMLPDF

Abstract

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.

Related papers

Analyzing Initialization Strategies for the Local Unitary Cluster Jastrow Ansatz within the Quantum-Centric Supercomputing Framework

Grier M. Jones, Maforikan J. Amoussou, Maximilian O. Leach +1 more

In this study, we analyze the choice of local unitary cluster Jastrow (LUCJ) ansatz initialization and sensitivity of the sample-based quantum diagonalization (SQD) algorithm within the quantum-centric supercomputing (QCSC) framework. We examine six initialization strategies, including those based on coupled-cluster singles and doubles (CCSD), Møller-Plesset second-order perturbation theory (MP2), data-driven coupled-cluster (DDCC), and trivial (zeroes and random) initializations, across twelve molecular systems and three basis sets (STO-3G, cc-pVDZ, and aug-cc-pVDZ). We find that while the mean absolute percentage errors (MAPEs) between the alternative and CCSD-initialized t2-amplitudes span many orders of magnitude, the resulting SQD energies are largely insensitive to this variation. In particular, most initializations recover energies within chemical accuracy (+/-1.6 mEh) of the CCSD reference, with convergence improving as the basis set size increases. Notably, random initialization achieves performance competitive with CCSD across all basis sets, while zeroes initialization, despite having smaller deviations from CCSD, yields the worst energy agreement. Our results highlight that the proximity to the CCSD initialization is not a reliable predictor of the quality of electronic energies. These findings establish that configuration recovery within SQD, rather than circuit initialization, is the dominant factor governing energy accuracy, and suggest that computationally cheaper initialization strategies are viable alternatives to CCSD for QCSC workflows

physics.chem-phCross-listedarXiv:2606.14933•Journal of Chemical Theory and Computation•Jun 16, 2026•1 citation

Efficient classical simulation of large-scale unitary cluster Jastrow circuits

Hrishikesh Belagali, Thomas Van Camp, R. Pradeep +3 more

Recent experiments on quantum computers have challenged the limits of classical computation in chemistry, simulating ground states of strongly correlated molecules. Many of these experiments have utilized the unitary cluster Jastrow ansatz, a quantum circuit inspired by the unitary coupled cluster ansatz that can be tailored to current quantum hardware. Notably, the largest experiment in Sci. Adv. 11, 25 (2025) executed a quantum circuit with 77 qubits and 10,570 gates on an IBM quantum computer and performed classical post-processing with up to 6400 nodes on Fugaku to compute ground state energies better than Hartree-Fock. In this work, we present a polynomial time classical algorithm to compute the energy of any single-layer unitary cluster Jastrow circuit, independent of locality constraints for quantum hardware. Our algorithm can reproduce the largest experiment from Sci. Adv. 11, 25 (2025) in less than a minute on a laptop, and through circuit optimization enabled by fast simulation we achieve a lower ground state energy than the experiment.

quant-pharXiv:2607.21337•Jul 24, 2026•6 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•6 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•108 citations

Evaluating Ground State Energies of Chemical Systems with Low-Depth Quantum Circuits and High Accuracy

Shuo Sun, Chandan Kumar, Kevin Shen +2 more

High Resolution Image Download MS PowerPoint Slide Quantum computers have the potential to efficiently solve the electronic structure problem but are currently limited by noise and shallow circuits. We present an enhanced Variational Quantum Eigensolver (VQE) ansatz based on the Qubit Coupled Cluster (QCC) approach that requires optimization of only n parameters, where n is the number of Pauli string generators, rather than the typical n + 2 m parameters, where m is the number of qubits. We evaluate the ground state energies and molecular dissociation curves of strongly correlated molecules, namely O 3 and Li 4, using active spaces of varying sizes in conjunction with our enhanced QCC ansatz, Unitary Coupled Cluster Single–Double (UCCSD) ansatz, and the classical Coupled Cluster Singles and Doubles (CCSD) method. Compared to UCCSD, our approach significantly reduces the number of parameters while maintaining high accuracy. Numerical simulations demonstrate the effectiveness of our approach, and experiments on superconducting and trapped-ion quantum computers showcase its practicality on real hardware. By eliminating the need for symmetry-restoring gates and reducing the number of parameters, our enhanced QCC ansatz enables accurate quantum chemistry calculations on near-term quantum devices for strongly correlated systems.

arXiv:2402.13960•The Journal of Physical Chemistry A•Mar 3, 2025•3 citations

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
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.
In this study, we analyze the choice of local unitary cluster Jastrow (LUCJ) ansatz initialization and sensitivity of the sample-based quantum diagonalization (SQD) algorithm within the quantum-centric supercomputing (QCSC) framework. We examine six initialization strategies, including those based on coupled-cluster singles and doubles (CCSD), Møller-Plesset second-order perturbation theory (MP2), data-driven coupled-cluster (DDCC), and trivial (zeroes and random) initializations, across twelve molecular systems and three basis sets (STO-3G, cc-pVDZ, and aug-cc-pVDZ). We find that while the mean absolute percentage errors (MAPEs) between the alternative and CCSD-initialized t2-amplitudes span many orders of magnitude, the resulting SQD energies are largely insensitive to this variation. In particular, most initializations recover energies within chemical accuracy (+/-1.6 mEh) of the CCSD reference, with convergence improving as the basis set size increases. Notably, random initialization achieves performance competitive with CCSD across all basis sets, while zeroes initialization, despite having smaller deviations from CCSD, yields the worst energy agreement. Our results highlight that the proximity to the CCSD initialization is not a reliable predictor of the quality of electronic energies. These findings establish that configuration recovery within SQD, rather than circuit initialization, is the dominant factor governing energy accuracy, and suggest that computationally cheaper initialization strategies are viable alternatives to CCSD for QCSC workflows
Recent experiments on quantum computers have challenged the limits of classical computation in chemistry, simulating ground states of strongly correlated molecules. Many of these experiments have utilized the unitary cluster Jastrow ansatz, a quantum circuit inspired by the unitary coupled cluster ansatz that can be tailored to current quantum hardware. Notably, the largest experiment in Sci. Adv. 11, 25 (2025) executed a quantum circuit with 77 qubits and 10,570 gates on an IBM quantum computer and performed classical post-processing with up to 6400 nodes on Fugaku to compute ground state energies better than Hartree-Fock. In this work, we present a polynomial time classical algorithm to compute the energy of any single-layer unitary cluster Jastrow circuit, independent of locality constraints for quantum hardware. Our algorithm can reproduce the largest experiment from Sci. Adv. 11, 25 (2025) in less than a minute on a laptop, and through circuit optimization enabled by fast simulation we achieve a lower ground state energy than the experiment.
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.
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.
High Resolution Image Download MS PowerPoint Slide Quantum computers have the potential to efficiently solve the electronic structure problem but are currently limited by noise and shallow circuits. We present an enhanced Variational Quantum Eigensolver (VQE) ansatz based on the Qubit Coupled Cluster (QCC) approach that requires optimization of only n parameters, where n is the number of Pauli string generators, rather than the typical n + 2 m parameters, where m is the number of qubits. We evaluate the ground state energies and molecular dissociation curves of strongly correlated molecules, namely O 3 and Li 4, using active spaces of varying sizes in conjunction with our enhanced QCC ansatz, Unitary Coupled Cluster Single–Double (UCCSD) ansatz, and the classical Coupled Cluster Singles and Doubles (CCSD) method. Compared to UCCSD, our approach significantly reduces the number of parameters while maintaining high accuracy. Numerical simulations demonstrate the effectiveness of our approach, and experiments on superconducting and trapped-ion quantum computers showcase its practicality on real hardware. By eliminating the need for symmetry-restoring gates and reducing the number of parameters, our enhanced QCC ansatz enables accurate quantum chemistry calculations on near-term quantum devices for strongly correlated systems.
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.