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:2111.02589 · Physical Review A

Decomposition of high-rank factorized unitary coupled-cluster operators using ancilla and multiqubit controlled low-rank counterparts

Luogen Xu, Joseph T. Lee, James K. Freericks

Published Jan 4, 2022• 5 citations
arXivHTMLPDF

Abstract

The factorized form of the unitary coupled-cluster (UCC) approximation is one of the most promising methodologies to prepare trial states for strongly correlated systems within the variational quantum eigensolver framework. The factorized form of the UCC Ansatz can be systematically applied to a reference state to generate the desired entanglement. The difficulty associated with such an approach is the requirement of simultaneously entangling a growing number of qubits, which quickly exceeds the hardware limitations of today's quantum machines. In particular, while circuits for singles and double excitations can be performed on current hardware, higher-rank excitations require too many gate operations. In this work, we propose a set of schemes that trade off using extra qubits for a reduced gate depth to decompose high-rank UCC excitation operators into significantly lower depth circuits. These results will remain useful even when fault-tolerant machines are available to reduce the overall state-preparation circuit depth.

DOI
10.1103/physreva.105.012406

Related papers

Efficient Application of the Factorized form of the Unitary Coupled-Cluster Ansatz for the Variational Quantum Eigensolver Algorithm by Using Linear Combination of Unitaries

Luogen Xu, James K. Freericks

The variational quantum eigensolver is one of the most promising algorithms for near-term quantum computers. It has the potential to solve quantum chemistry problems involving strongly correlated electrons with relatively low-depth circuits, which are otherwise difficult to solve on classical computers. The variational eigenstate is constructed from a number of factorized unitary coupled-cluster terms applied onto an initial (single-reference) state. Current algorithms for applying one of these operators to a quantum state require a number of operations that scale exponentially with the rank of the operator. We exploit a hidden SU(2) symmetry to allow us to employ the linear combination of unitaries approach, Our Prepare subroutine uses n+2 ancilla qubits for a rank-n operator. Our Select(U^) scheme uses O(n)Cnot gates. This results in a full algorithm that scales like the cube of the rank of the operator n3, a significant reduction in complexity for rank five or higher operators. This approach, when combined with other algorithms for lower-rank operators (when compared to the standard implementation), will make the factorized form of the unitary coupled-cluster approach much more efficient to implement on all types of quantum computers.

arXiv:2302.08679•Symmetry•Jul 16, 2023•6 citations

Low Depth Unitary Coupled Cluster Algorithm for Large Chemical Systems

Jeremy Canfield, Dominika Zgid, J K Freericks

The unitary coupled cluster (UCC) algorithm is one of the most promising implementations of the variational quantum eigensolver for quantum computers. However, for large systems, the number of UCC factors leads to deep quantum circuits, which are prohibitive for execution on quantum hardware. To address this, circuit depth can be reduced at the cost of more measurements with a Taylor series expansion of UCC factors with small angles, while treating the large-angle factors exactly. We implement this approach to quadratic order (qUCC) for systems with strong correlations and systems where conventional methods like coupled cluster (CC) with low excitation levels fail, but UCC and qUCC perform well. We study hydrogen chains and the BeH2 molecule that allow us to change the degree of strong correlation due to geometrical distortions. We show, via a dramatic increase in number of factors able to handle exactly, a systematic convergence of these results as more exact UCC factors are included in the calculations -- the hardest to converge regime is in the crossover from weak to strong coupling. In all cases the total number of UCC factors needed to be treated exactly is much less than the total number of UCC factors available (typically about one-third to one-half of the total number of factors).

quant-pharXiv:2602.14999•The Journal of Chemical Physics•Feb 17, 2026•0 citations

Low-Depth Unitary Coupled Cluster Theory for Quantum Computation

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

The unitary coupled cluster (UCC) approximation is one of the more promising wave function ansätzes for electronic structure calculations on quantum computers via the variational quantum eigensolver algorithm. However, for large systems with many orbitals, the required number of UCC factors still leads to very deep quantum circuits, which can be challenging to implement. Based on the observation that most UCC amplitudes are small for both weakly correlated and strongly correlated molecules, we devise an algorithm that employs a Taylor expansion in the small amplitudes, trading off circuit depth for extra measurements. Strong correlations can be taken into account by performing the expansion about a small set of UCC factors, which are treated exactly. Near equilibrium, the Taylor series expansion often works well without the need to include any exact factors; as the molecule is stretched and correlations increase, we find only a small number of factors need to be treated exactly.

arXiv:2109.14134•Journal of Chemical Theory and Computation•Mar 22, 2022•8 citations

Reducing unitary coupled cluster circuit depth by classical stochastic amplitude prescreening

Maria-Andreea Filip, Nathan Fitzpatrick, David Muñoz Ramo +1 more

Unitary coupled cluster (UCC) approaches are an appealing route to utilizing quantum hardware to perform quantum chemistry calculations, as quantum computers can in principle perform UCC calculations in a polynomially scaling fashion, as compared with the exponential scaling required on classical computers. Current noisy intermediate scale quantum computers are limited by both hardware capacity in number of logical qubits and the noise introduced by the deep circuits required for UCC calculations using the variational quantum eigensolver (VQE) approach. We present a combined classical-quantum approach where a stochastic classical UCC preprocessing step is used to determine the important excitations in the UCC Ansatz. The reduced number of selected excitations are then used in a UCC-based VQE calculation. This approach gives a systematically improvable approximation, and we show that significant reductions in quantum resources can be achieved, with simulations on the ${\mathrm{CH}}_{2}, {\mathrm{N}}_{2}$, and ${\mathrm{N}}_{2}{\mathrm{H}}_{2}$ molecules giving submillihartree errors.

arXiv:2108.10912•Physical Review Research•Jun 27, 2022•9 citations

Qubit Coupled Cluster Method: A Systematic Approach to Quantum Chemistry on a Quantum Computer

Ilya G. Ryabinkin, Tzu-Ching Yen, Scott N. Genin +1 more

A unitary coupled cluster (UCC) form for the wave function in the variational quantum eigensolver has been suggested as a systematic way to go beyond the mean-field approximation and include electron correlation in solving quantum chemistry problems on a quantum computer. Although being exact in the limit of including all possible coupled cluster excitations, practically, the accuracy of this approach depends on the number and type of terms are included in the wave function parametrization. Another difficulty of UCC is a growth of the number of simultaneously entangled qubits even at the fixed Fermionic excitation rank. Not all quantum computing architectures can cope with this growth. To address both problems, we introduce a qubit coupled cluster (QCC) method that starts directly in the qubit space and uses energy response estimates for ranking the importance of individual entanglers for the variational energy minimization. Also, we provide an exact factorization of a unitary rotation of more than two qubits to a product of two-qubit unitary rotations. Thus, the QCC method with the factorization technique can be limited to only two-qubit entanglement gates and allows for very efficient use of quantum resources in terms of the number of coupled cluster operators. The method performance is illustrated by calculating ground-state potential energy curves of H 2 and LiH molecules with chemical accuracy, ≤1 kcal/mol, and a symmetric water dissociation curve.

arXiv:1809.03827•Journal of Chemical Theory and Computation•Nov 14, 2018•306 citations

Circuit-Depth Reduction of Unitary-Coupled-Cluster Ansatz by Energy Sorting

Yi Fan, Changsu Cao, Xusheng Xu +3 more

Quantum computation represents a revolutionary approach to solving problems in quantum chemistry. However, due to the limited quantum resources in the current noisy intermediate-scale quantum (NISQ) devices, quantum algorithms for large chemical systems remain a major task. In this work, we demonstrate that the circuit depth of the unitary coupled cluster (UCC) and UCC-based ansatzes in the algorithm of the variational quantum eigensolver can be significantly reduced by an energy-sorting strategy. Specifically, subsets of excitation operators are first prescreened from the operator pool according to its contribution to the total energy. The quantum circuit ansatz is then iteratively constructed until convergence of the final energy to a typical accuracy. For demonstration, this method has been successfully applied to molecular and periodic systems. Particularly, a reduction of 50%-98% in the number of operators is observed while retaining the accuracy of the original UCCSD operator pools. This method can be straightforwardly extended to general parametric variational ansatzes.

arXiv:2106.15210•The Journal of Physical Chemistry Letters•Oct 20, 2023•38 citations
The factorized form of the unitary coupled-cluster (UCC) approximation is one of the most promising methodologies to prepare trial states for strongly correlated systems within the variational quantum eigensolver framework. The factorized form of the UCC Ansatz can be systematically applied to a reference state to generate the desired entanglement. The difficulty associated with such an approach is the requirement of simultaneously entangling a growing number of qubits, which quickly exceeds the hardware limitations of today's quantum machines. In particular, while circuits for singles and double excitations can be performed on current hardware, higher-rank excitations require too many gate operations. In this work, we propose a set of schemes that trade off using extra qubits for a reduced gate depth to decompose high-rank UCC excitation operators into significantly lower depth circuits. These results will remain useful even when fault-tolerant machines are available to reduce the overall state-preparation circuit depth.
The variational quantum eigensolver is one of the most promising algorithms for near-term quantum computers. It has the potential to solve quantum chemistry problems involving strongly correlated electrons with relatively low-depth circuits, which are otherwise difficult to solve on classical computers. The variational eigenstate is constructed from a number of factorized unitary coupled-cluster terms applied onto an initial (single-reference) state. Current algorithms for applying one of these operators to a quantum state require a number of operations that scale exponentially with the rank of the operator. We exploit a hidden SU(2) symmetry to allow us to employ the linear combination of unitaries approach, Our Prepare subroutine uses n+2 ancilla qubits for a rank-n operator. Our Select(U^) scheme uses O(n)Cnot gates. This results in a full algorithm that scales like the cube of the rank of the operator n3, a significant reduction in complexity for rank five or higher operators. This approach, when combined with other algorithms for lower-rank operators (when compared to the standard implementation), will make the factorized form of the unitary coupled-cluster approach much more efficient to implement on all types of quantum computers.
The unitary coupled cluster (UCC) algorithm is one of the most promising implementations of the variational quantum eigensolver for quantum computers. However, for large systems, the number of UCC factors leads to deep quantum circuits, which are prohibitive for execution on quantum hardware. To address this, circuit depth can be reduced at the cost of more measurements with a Taylor series expansion of UCC factors with small angles, while treating the large-angle factors exactly. We implement this approach to quadratic order (qUCC) for systems with strong correlations and systems where conventional methods like coupled cluster (CC) with low excitation levels fail, but UCC and qUCC perform well. We study hydrogen chains and the BeH2 molecule that allow us to change the degree of strong correlation due to geometrical distortions. We show, via a dramatic increase in number of factors able to handle exactly, a systematic convergence of these results as more exact UCC factors are included in the calculations -- the hardest to converge regime is in the crossover from weak to strong coupling. In all cases the total number of UCC factors needed to be treated exactly is much less than the total number of UCC factors available (typically about one-third to one-half of the total number of factors).
The unitary coupled cluster (UCC) approximation is one of the more promising wave function ansätzes for electronic structure calculations on quantum computers via the variational quantum eigensolver algorithm. However, for large systems with many orbitals, the required number of UCC factors still leads to very deep quantum circuits, which can be challenging to implement. Based on the observation that most UCC amplitudes are small for both weakly correlated and strongly correlated molecules, we devise an algorithm that employs a Taylor expansion in the small amplitudes, trading off circuit depth for extra measurements. Strong correlations can be taken into account by performing the expansion about a small set of UCC factors, which are treated exactly. Near equilibrium, the Taylor series expansion often works well without the need to include any exact factors; as the molecule is stretched and correlations increase, we find only a small number of factors need to be treated exactly.
Unitary coupled cluster (UCC) approaches are an appealing route to utilizing quantum hardware to perform quantum chemistry calculations, as quantum computers can in principle perform UCC calculations in a polynomially scaling fashion, as compared with the exponential scaling required on classical computers. Current noisy intermediate scale quantum computers are limited by both hardware capacity in number of logical qubits and the noise introduced by the deep circuits required for UCC calculations using the variational quantum eigensolver (VQE) approach. We present a combined classical-quantum approach where a stochastic classical UCC preprocessing step is used to determine the important excitations in the UCC Ansatz. The reduced number of selected excitations are then used in a UCC-based VQE calculation. This approach gives a systematically improvable approximation, and we show that significant reductions in quantum resources can be achieved, with simulations on the CH2,N2{\mathrm{CH}}_{2}, {\mathrm{N}}_{2}CH2​,N2​, and N2H2{\mathrm{N}}_{2}{\mathrm{H}}_{2}N2​H2​ molecules giving submillihartree errors.
A unitary coupled cluster (UCC) form for the wave function in the variational quantum eigensolver has been suggested as a systematic way to go beyond the mean-field approximation and include electron correlation in solving quantum chemistry problems on a quantum computer. Although being exact in the limit of including all possible coupled cluster excitations, practically, the accuracy of this approach depends on the number and type of terms are included in the wave function parametrization. Another difficulty of UCC is a growth of the number of simultaneously entangled qubits even at the fixed Fermionic excitation rank. Not all quantum computing architectures can cope with this growth. To address both problems, we introduce a qubit coupled cluster (QCC) method that starts directly in the qubit space and uses energy response estimates for ranking the importance of individual entanglers for the variational energy minimization. Also, we provide an exact factorization of a unitary rotation of more than two qubits to a product of two-qubit unitary rotations. Thus, the QCC method with the factorization technique can be limited to only two-qubit entanglement gates and allows for very efficient use of quantum resources in terms of the number of coupled cluster operators. The method performance is illustrated by calculating ground-state potential energy curves of H 2 and LiH molecules with chemical accuracy, ≤1 kcal/mol, and a symmetric water dissociation curve.
Quantum computation represents a revolutionary approach to solving problems in quantum chemistry. However, due to the limited quantum resources in the current noisy intermediate-scale quantum (NISQ) devices, quantum algorithms for large chemical systems remain a major task. In this work, we demonstrate that the circuit depth of the unitary coupled cluster (UCC) and UCC-based ansatzes in the algorithm of the variational quantum eigensolver can be significantly reduced by an energy-sorting strategy. Specifically, subsets of excitation operators are first prescreened from the operator pool according to its contribution to the total energy. The quantum circuit ansatz is then iteratively constructed until convergence of the final energy to a typical accuracy. For demonstration, this method has been successfully applied to molecular and periodic systems. Particularly, a reduction of 50%-98% in the number of operators is observed while retaining the accuracy of the original UCCSD operator pools. This method can be straightforwardly extended to general parametric variational ansatzes.