# Unitary coupled cluster ansatz

The unitary coupled cluster (UCC) ansatz (an assumed trial formula or structure used as a starting guess) is a parameterized quantum circuit for quantum chemistry that prepares a trial molecular state by applying a unitary operator of the form exp(T − T†) to a reference state, where T is a fermionic excitation operator borrowed from classical coupled cluster theory. In its factorized form it can serve as an efficient state-preparation method for the variational quantum eigensolver (VQE), because it usually starts from the physically meaningful Hartree–Fock reference state and explores the space of electronic excitations in a structured way.<sup>[1](https://doi.org/10.3390/sym14030494)</sup><sup> • </sup><sup>[2](https://pubs.acs.org/doi/abs/10.1021/acs.jctc.1c01026)</sup><sup> • </sup><sup>[3](https://pubs.rsc.org/en/content/articlelanding/2022/cs/d1cs00932j)</sup>

| Key fact | Value |
|---|---|
| Unitary form | \( \| \Psi_{\mathrm{UCC}} \rangle = e^{T - T^{\dagger}} \| \Psi_0 \rangle \), with T a fermionic excitation operator<sup>[1](https://doi.org/10.3390/sym14030494)</sup> |
| UCCSD cluster terms | O((N−η)² η²), each acting on a constant number of spin-orbitals (N spin-orbitals, η electrons)<sup>[4](https://ar5iv.labs.arxiv.org/html/1810.02327)</sup> |
| UCCSD circuit depth | O((N−η)² η) per Trotter step; first-order Trotterized UCCSD VQE is upper-bounded by O(n⁵) under Jordan–Wigner<sup>[4](https://ar5iv.labs.arxiv.org/html/1810.02327)</sup><sup> • </sup><sup>[5](https://pubs.acs.org/doi/full/10.1021/acs.jpca.3c00550)</sup> |
| k-UpCCGSD depth | O(kN), versus O(N³) for UCCGSD<sup>[4](https://ar5iv.labs.arxiv.org/html/1810.02327)</sup> |
| Qubit count | Linear in the number of spin-orbitals<sup>[4](https://ar5iv.labs.arxiv.org/html/1810.02327)</sup> |
| Mapping cost per term | O(N) operations under Jordan–Wigner, O(log N) under Bravyi–Kitaev<sup>[6](https://beta.iopscience.iop.org/article/10.1088/2058-9565/aad3e4/ampdf)</sup> |
| Trainability risk | Two-body (doubles) terms produce exponentially concentrating cost functions in the infinite-depth limit<sup>[7](https://arxiv.org/html/2312.08105)</sup> |

## From coupled cluster to unitary coupled cluster

Classical coupled cluster theory uses the wavefunction \(|\Psi\rangle = e^{T}|\Psi_{0}\rangle\), where T generates single, double, and higher electronic excitations out of a reference determinant. This exponential is generally not unitary, because the cluster operator T is not anti-Hermitian. Replacing \(e^{T}\) with \(e^{T - T^{\dagger}}\) fixes this, since \(T - T^{\dagger}\) is anti-Hermitian and its exponential is unitary; the resulting state \(|\Psi_{\mathrm{UCC}}\rangle = e^{T - T^{\dagger}}|\Psi_{0}\rangle\) is the UCC ansatz.<sup>[1](https://doi.org/10.3390/sym14030494)</sup>

The unitary form introduces a practical problem of its own. The individual excitation terms in T − T† do not commute, so the exponential of the sum cannot be directly decomposed into device-implementable pieces. The standard remedy is the [Trotter product formula](https://www.edgepedia.org/trotter-suzuki-product-formulas), which relates the exponential of a sum to an ordered product of individual exponentials; the resulting factorized form is what is actually run on hardware.<sup>[3](https://pubs.rsc.org/en/content/articlelanding/2022/cs/d1cs00932j)</sup><sup> • </sup><sup>[1](https://doi.org/10.3390/sym14030494)</sup> In this factorized form UCC acts as an efficient state-preparation method for VQE, normally starting from the Hartree–Fock reference state.<sup>[2](https://pubs.acs.org/doi/abs/10.1021/acs.jctc.1c01026)</sup>

## Anatomy of UCCSD: excitations, parameters, and circuit compilation

The cluster operator is a sum of fermionic excitation operators: single excitations (one electron promoted to an unoccupied spin-orbital), double excitations, and so on up to n-fold. Truncating at singles and doubles gives UCCSD, a widely used variant; this truncation is exact for two-electron systems and suffices to describe many molecules accurately.<sup>[3](https://pubs.rsc.org/en/content/articlelanding/2022/cs/d1cs00932j)</sup><sup> • </sup><sup>[6](https://beta.iopscience.iop.org/article/10.1088/2058-9565/aad3e4/ampdf)</sup>

After Trotterization, UCCSD contains O((N−η)² η²) cluster terms, each acting on a constant number of spin-orbitals.<sup>[4](https://ar5iv.labs.arxiv.org/html/1810.02327)</sup> Each fermionic excitation exponential is compiled into Pauli-string rotations: the fermionic operator is mapped to qubit operators, and each exponential of a Pauli string is simulated with CNOT gates and a parameterized rotation.<sup>[8](https://www.osti.gov/servlets/purl/2424442)</sup><sup> • </sup><sup>[9](https://nvidia.github.io/cuda-quantum/latest/applications/python/uccsd_wf_ansatz.html)</sup> The gate cost of individual pieces is well characterized: a UCC single-excitation exponential is a [Givens rotation](https://www.edgepedia.org/givens-rotation) needing only two CNOT gates for adjacent qubits, while a fermionic SWAP across a distance d costs 3d CNOT gates.<sup>[5](https://pubs.acs.org/doi/full/10.1021/acs.jpca.3c00550)</sup>

The depth problem is the ansatz's main weakness. The unfavorable parameter scaling with system size translates into a large number of gates and long circuits whose errors accumulate on near-term devices; spin-adaptation reduces the parameter count but not the gate count or depth.<sup>[5](https://pubs.acs.org/doi/full/10.1021/acs.jpca.3c00550)</sup> For large systems with many orbitals, the required number of UCC factors still leads to very deep circuits.<sup>[2](https://pubs.acs.org/doi/abs/10.1021/acs.jctc.1c01026)</sup>

## Fermionic-to-qubit mappings and their circuit costs

Fermionic [creation and annihilation operators](https://www.edgepedia.org/creation-and-annihilation-operators) must be encoded into qubit operators before compilation, using transformations such as Jordan–Wigner (JW) or Bravyi–Kitaev (BK).<sup>[3](https://pubs.rsc.org/en/content/articlelanding/2022/cs/d1cs00932j)</sup> The choice changes circuit cost directly. Under JW, a fermionic operator on one spin-orbital becomes a qubit operator acting non-locally on O(N) qubits, producing a per-term overhead that scales linearly with qubit count; under BK, implementing a single excitation term τⱼ − τ†ⱼ costs O(log N) operations instead of O(N).<sup>[4](https://ar5iv.labs.arxiv.org/html/1810.02327)</sup><sup> • </sup><sup>[6](https://beta.iopscience.iop.org/article/10.1088/2058-9565/aad3e4/ampdf)</sup>

The BK advantage is conditional. On hardware with limited qubit connectivity, the extra SWAP operations BK may require can erase its asymptotic edge.<sup>[6](https://beta.iopscience.iop.org/article/10.1088/2058-9565/aad3e4/ampdf)</sup> There is also evidence that JW implementations are more robust to noise than BK, presumably because BK stores occupation information non-locally, so a local single-qubit error propagates more widely.<sup>[6](https://beta.iopscience.iop.org/article/10.1088/2058-9565/aad3e4/ampdf)</sup> The mapping choice is therefore a trade-off between gate count, hardware topology, and error behavior rather than a single winner.

## By the numbers

- **Parameters and terms.** UCCSD carries O((N−η)² η²) cluster terms; the qubit requirement of a UCC ansatz is linear in the number of spin-orbitals.<sup>[4](https://ar5iv.labs.arxiv.org/html/1810.02327)</sup>
- **Depth.** Trotterized UCCSD needs depth O((N−η)² η); generalized doubles (UCCGSD) needs O(N³); k-UpCCGSD needs only O(kN).<sup>[4](https://ar5iv.labs.arxiv.org/html/1810.02327)</sup> An independent upper bound for first-order Trotterized UCCSD VQE under JW is O(n⁵).<sup>[5](https://pubs.acs.org/doi/full/10.1021/acs.jpca.3c00550)</sup>
- **Reduced variants.** k-UpCCGSD restricts doubles to pairs of excitations, cutting gate-count dependence from approximately quartic to quadratic in the number of spin-orbitals M, O(kM²), with depth reducible to O(kM).<sup>[3](https://pubs.rsc.org/en/content/articlelanding/2022/cs/d1cs00932j)</sup> Classical benchmarks on H4, H₂O, and N₂ found k-UpCCGSD reaches chemical accuracy at lower implementation cost than both UCCGSD and UCCSD.<sup>[4](https://ar5iv.labs.arxiv.org/html/1810.02327)</sup>
- **Depth-reduction tricks.** Small-amplitude filtration and entropy-based orbital selection reduce UCCSD CNOT counts and depth by more than 50% in all reported test cases.<sup>[5](https://pubs.acs.org/doi/full/10.1021/acs.jpca.3c00550)</sup> An ancilla-controlled technique exploiting parity redundancy of JW Pauli strings, and a partitioning into commuting Pauli strings, also cut CNOT counts by more than 50%.<sup>[3](https://pubs.rsc.org/en/content/articlelanding/2022/cs/d1cs00932j)</sup> A linear-combination-of-unitaries approach using a hidden SU(2) symmetry implements a rank-n UCC operator with n+2 ancilla qubits and O(n) CNOTs in the SELECT step, giving an O(n³) algorithm that pays off for rank five or higher.<sup>[8](https://www.osti.gov/servlets/purl/2424442)</sup> A Taylor-expansion algorithm in small amplitudes trades circuit depth for extra measurements.<sup>[2](https://pubs.acs.org/doi/abs/10.1021/acs.jctc.1c01026)</sup>

## How it compares with other ansatz families

Against hardware-efficient ansätze, UCCSD trades gate economy for physical structure, but its parameter count grows unfavorably with system size and its circuits are long.<sup>[5](https://pubs.acs.org/doi/full/10.1021/acs.jpca.3c00550)</sup> The evidence captured here covers UCC-family gradient behavior in detail but does not include a direct head-to-head expressibility or trainability comparison with hardware-efficient circuits; that comparison is not settled by these sources.

Within the chemically inspired family, the qubit coupled cluster (QCC) method replaces fermionic excitation generators with Pauli-string generators, reducing gate operations from an upper bound of O(N⁵) for UCCSD to O(N⁴) under JW while achieving UCCSD-like accuracy on BeH₂, H₂O, N₂, H₄, and H₆.<sup>[3](https://pubs.rsc.org/en/content/articlelanding/2022/cs/d1cs00932j)</sup> Adaptive methods such as ADAPT-VQE grow the ansatz operator by operator, and fixed-structure alternatives include k-UpCCGSD, OO-UCC, and DUCC.<sup>[5](https://pubs.acs.org/doi/full/10.1021/acs.jpca.3c00550)</sup> The 2024 non-iterative disentangled UCC (NI-DUCC) method operates directly in qubit space with anti-Hermitian excitation operators whose set scales linearly with qubit number, scales CNOT counts as O(knp) per circuit, and reaches full configuration interaction solutions as the layer count k increases.<sup>[10](https://arxiv.org/html/2408.14289v2)</sup>

## Recent developments

UCCSD is no longer the frontier. Recent work targets its two main costs directly. Lie-algebraic methods such as NI-DUCC use algebraic relations among the generators to resolve the operator-ordering issues of Trotterized UCC, avoid gradient measurements entirely, and show reduced VQE energy without barren-plateau problems in simulation.<sup>[10](https://arxiv.org/html/2408.14289v2)</sup> Relaxed Trotterized UCC, studied in a 2024 Communications Physics paper for the second-order-truncated UCCSD variant under JW, relaxes the strict Trotter product structure of the compiled ansatz.<sup>[11](https://www.nature.com/articles/s42005-024-01798-0.pdf)</sup> Initialization has also moved on: because classical optimization of UCC parameters suffers from barren plateaus, local minima, and saddle points, high-quality initial points from MP2, or CCSD, and schemes beyond them, are an active topic.<sup>[12](https://quantum-journal.org/papers/q-2024-11-26-1538/)</sup>

UCCSD remains a standard component of software stacks. Qiskit Nature provides a UCC class that builds excitations from a HartreeFock reference, a UCCSD utility class equivalent to UCC with excitations='sd', and a typical VQE workflow pairing the ansatz with HFInitialPoint, the JordanWignerMapper, and an SLSQP optimizer.<sup>[13](https://qiskit-community.github.io/qiskit-nature/stubs/qiskit_nature.second_q.circuit.library.UCC.html)</sup> NVIDIA's CUDA-Q ships a cudaq.kernels.uccsd implementation that decomposes exp(T − T†) via the Trotter–Suzuki approximation into CNOT and rotation gates, with an exp_pauli() gate that dramatically reduces gate counts on classical simulators.<sup>[9](https://nvidia.github.io/cuda-quantum/latest/applications/python/uccsd_wf_ansatz.html)</sup> What is documented is that as of November 2024, UCC-based VQE results on quantum hardware remain very limited and simulations have only accessed small system sizes.<sup>[12](https://quantum-journal.org/papers/q-2024-11-26-1538/)</sup>

## References

1. [Operator Relationship between Conventional Coupled Cluster and Unitary Coupled Cluster (Symmetry)](https://doi.org/10.3390/sym14030494)
2. [Low-Depth Unitary Coupled Cluster Theory for Quantum Computation (J. Chem. Theory Comput.)](https://pubs.acs.org/doi/abs/10.1021/acs.jctc.1c01026)
3. [A quantum computing view on unitary coupled cluster theory (Chemical Society Reviews)](https://pubs.rsc.org/en/content/articlelanding/2022/cs/d1cs00932j)
4. [Generalized Unitary Coupled Cluster Wavefunctions for Quantum Computation](https://ar5iv.labs.arxiv.org/html/1810.02327)
5. [Exploring Parameter Redundancy in the Unitary Coupled-Cluster Ansätze for Hybrid Variational Quantum Computing (J. Phys. Chem. A)](https://pubs.acs.org/doi/full/10.1021/acs.jpca.3c00550)
6. [Strategies for quantum computing molecular energies using the unitary coupled cluster ansatz (Quantum Sci. Technol.)](https://beta.iopscience.iop.org/article/10.1088/2058-9565/aad3e4/ampdf)
7. [Towards determining the presence of barren plateaus in some chemically inspired variational quantum algorithms](https://arxiv.org/html/2312.08105)
8. [Efficient Application of the Factorized Form of the Unitary Coupled-Cluster Ansatz for VQE Using Linear Combination of Unitaries (OSTI)](https://www.osti.gov/servlets/purl/2424442)
9. [The UCCSD Wavefunction ansatz — NVIDIA CUDA-Q documentation](https://nvidia.github.io/cuda-quantum/latest/applications/python/uccsd_wf_ansatz.html)
10. [Non-Iterative Disentangled Unitary Coupled-Cluster based on Lie-algebraic structure (2024)](https://arxiv.org/html/2408.14289v2)
11. [Relaxed Trotterized UCC (Communications Physics, 2024)](https://www.nature.com/articles/s42005-024-01798-0.pdf)
12. [Beyond MP2 initialization for unitary coupled cluster quantum circuits (Quantum, 2024)](https://quantum-journal.org/papers/q-2024-11-26-1538/)
13. [UCC — Qiskit Nature 0.7.2 documentation](https://qiskit-community.github.io/qiskit-nature/stubs/qiskit_nature.second_q.circuit.library.UCC.html)

---
*Topic: Encyclopedia › Physical world and mathematics › Physics › Quantum physics › Quantum information science › Quantum computing and algorithms › Quantum algorithms › Variational and hybrid quantum-classical algorithms › Variational ansatz families*

*Initially written Sep 17, 2026 · Reviewed: Sep 30, 2026 · Edited: Sep 30, 2026; Oct 11, 2026; Oct 15, 2026 · Last review: Sep 30, 2026*

*Copyright 2026 EdgeChat AI, a subsidiary of Biostate AI.*

License: Edgepedia Community License 1.0, https://www.edgepedia.org/edgepedia/license