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

A variational quantum algorithm for the 2D-Block pair Unitary Coupled Cluster (2D-BpUCC) method

Louis Jourdan, Patrick Cassam‐Chenaï

Published Feb 12, 2026• 0 citations
OpenAlex

Related papers

Quantifying Teleportation Overhead in Distributed Unitary Coupled-Cluster Ansätze

Grier M. Jones, Hassan Tariq Shafi, Zixuan Wang +3 more

Distributed quantum computing (DQC) has been proposed as a way to scale quantum algorithms for practical applications beyond monolithic quantum processor architectures. Among these applications, quantum chemistry is widely regarded as one of the most promising use cases for quantum computing. In this work, we estimate the distributed-resource requirements of unitary coupled-cluster (UCC) ansätze for quantum chemistry, focusing on unitary coupled-cluster singles and doubles (UCCSD), unitary pair coupled-cluster doubles (UpCCD), and unitary pair coupled-cluster with generalized singles and doubles (UpCCGSD) circuits for hydrogen chains. We focus on a teleportation-based approach to DQC, quantitatively comparing a naive distribution method to the output of the TeleSABRE algorithm. For both approaches, we estimate the cost of handling nonlocal two-qubit gates across a fixed midpoint or quarter-point partition, reporting Bell-pair/classical-communication costs in teleportation. Across Jordan-Wigner and Bravyi-Kitaev, we find that UpCCD with spin-blocked Jordan-Wigner ordering gives the most favorable scaling, while UCCSD incurs substantially larger distributed-resource requirements.

quant-pharXiv:2609.36266•Sep 30, 2026•0 citations

Hybrid quantum-classical algorithm for variational coupled cluster method

Sathyawageeswar Subramanian, Yudong Cao

Bulletin of the American Physical Society•Mar 4, 2019•0 citations

Experimental quantum computational chemistry with optimized unitary coupled cluster ansatz

Shaojun Guo, Jinzhao Sun, Haoran Qian +35 more

arXiv:2212.08006•Nature Physics•Jun 11, 2024•95 citations

Towards determining the presence of barren plateaus in some chemically inspired variational quantum algorithms

Rui Mao, Guojing Tian, Xiaoming Sun

In quantum chemistry, the variational quantum eigensolver (VQE) is a promising algorithm for molecular simulations on near-term quantum computers. However, VQEs using hardware-efficient circuits face scaling challenges due to the barren plateau problem. This raises the question of whether chemically inspired circuits from unitary coupled cluster (UCC) methods can avoid this issue. Here we provide theoretical evidence indicating they may not. By examining alternated dUCC ansätzes and relaxed Trotterized UCC ansätzes, we find that in the infinite depth limit, a separation occurs between particle-hole one- and two-body unitary operators. While one-body terms yield a polynomially concentrated energy landscape, adding two-body terms leads to exponential concentration. Numerical simulations support these findings, suggesting that popular 1-step Trotterized unitary coupled-cluster with singles and doubles (UCCSD) ansätze may not scale. Our results emphasize the link between trainability and circuit expressiveness, raising doubts about VQEs’ ability to surpass classical methods. The variational quantum eigensolver (VQE) is a promising approach for molecular simulations on quantum computers but faces scaling issues due to the barren plateau problem. The authors’ findings indicate that unitary coupled cluster circuits may not overcome these challenges, raising doubts about VQE’s ability to outperform classical methods.

arXiv:2312.08105•Communications Physics•Oct 18, 2024•19 citations

Variational quantum algorithms

Marco Cerezo, Andrew Arrasmith, Ryan Babbush +8 more

arXiv:2012.09265•Nature Reviews Physics•Aug 12, 2021•4,270 citations

Qubit unitary coupled cluster with generalized single and paired double excitations ansatz for variational quantum eigensolver

Qing‐Xing Xie, Wen‐gang Zhang, Xusheng Xu +2 more

Abstract Variational quantum eigensolver (VQE) with a unitary coupled cluster (UCC) ansatz has been suggested as a promising method for electronic structure calculations on future quantum computers. However, the complexity of the excitation terms for UCC with the single and double excitations (UCCSD) ansatz is up‐bounded to , where N is the number of electrons and M is the number of spin orbitals. The gate complexity of quantum circuit for the UCCSD ansatz is up‐bounded to using the Jordan–Wigner transformation. These complexities significantly limit the implementation of UCCSD on current Noisy Intermediate‐Scale Quantum (NISQ) devices. Herein, we developed a k‐QUpCCGSD ansatz which is based on the generalized paired double excitation operators and the particle preserving exchange gate. The former reduces the number of the excitation operators, the latter reduces the number of qubit gates for transforming excitation operators to quantum circuit. The gate complexity of the proposed k‐QUpCCGSD ansatz is up‐bounded to , which significantly reduce the complexity of the VQE algorithm on NISQ devices. The performance of the proposed ansatz on VQE is demonstrated by calculating ground‐state dissociation energy curves of the H6, LiH, H2O, and BeH2 molecules with the STO‐3G minimal basis set, and the accuracy is evaluated by comparing to the full configuration interaction (FCI) benchmarks. Moreover, we compare the number of quantum gates, especially the CNOT gates, and accuracies of various ansatzes. The assessments have shown that the accuracy of qubit unitary coupled cluster (QUCC) ansatzes is slightly worse than that of the UCC ones, but the circuit complexity of QUCC is much less than that of UCC. Among the tested QUCC ansatzes, k‐QUpCCGSD achieves higher accuracy with fewer quantum gates than QUCCSD, and k‐QUpCCGSD is a promising ansatz for VQE calculation on NISQ devices.

International Journal of Quantum Chemistry•Aug 17, 2022•6 citations
Distributed quantum computing (DQC) has been proposed as a way to scale quantum algorithms for practical applications beyond monolithic quantum processor architectures. Among these applications, quantum chemistry is widely regarded as one of the most promising use cases for quantum computing. In this work, we estimate the distributed-resource requirements of unitary coupled-cluster (UCC) ansätze for quantum chemistry, focusing on unitary coupled-cluster singles and doubles (UCCSD), unitary pair coupled-cluster doubles (UpCCD), and unitary pair coupled-cluster with generalized singles and doubles (UpCCGSD) circuits for hydrogen chains. We focus on a teleportation-based approach to DQC, quantitatively comparing a naive distribution method to the output of the TeleSABRE algorithm. For both approaches, we estimate the cost of handling nonlocal two-qubit gates across a fixed midpoint or quarter-point partition, reporting Bell-pair/classical-communication costs in teleportation. Across Jordan-Wigner and Bravyi-Kitaev, we find that UpCCD with spin-blocked Jordan-Wigner ordering gives the most favorable scaling, while UCCSD incurs substantially larger distributed-resource requirements.
In quantum chemistry, the variational quantum eigensolver (VQE) is a promising algorithm for molecular simulations on near-term quantum computers. However, VQEs using hardware-efficient circuits face scaling challenges due to the barren plateau problem. This raises the question of whether chemically inspired circuits from unitary coupled cluster (UCC) methods can avoid this issue. Here we provide theoretical evidence indicating they may not. By examining alternated dUCC ansätzes and relaxed Trotterized UCC ansätzes, we find that in the infinite depth limit, a separation occurs between particle-hole one- and two-body unitary operators. While one-body terms yield a polynomially concentrated energy landscape, adding two-body terms leads to exponential concentration. Numerical simulations support these findings, suggesting that popular 1-step Trotterized unitary coupled-cluster with singles and doubles (UCCSD) ansätze may not scale. Our results emphasize the link between trainability and circuit expressiveness, raising doubts about VQEs’ ability to surpass classical methods. The variational quantum eigensolver (VQE) is a promising approach for molecular simulations on quantum computers but faces scaling issues due to the barren plateau problem. The authors’ findings indicate that unitary coupled cluster circuits may not overcome these challenges, raising doubts about VQE’s ability to outperform classical methods.
Abstract Variational quantum eigensolver (VQE) with a unitary coupled cluster (UCC) ansatz has been suggested as a promising method for electronic structure calculations on future quantum computers. However, the complexity of the excitation terms for UCC with the single and double excitations (UCCSD) ansatz is up‐bounded to , where N is the number of electrons and M is the number of spin orbitals. The gate complexity of quantum circuit for the UCCSD ansatz is up‐bounded to using the Jordan–Wigner transformation. These complexities significantly limit the implementation of UCCSD on current Noisy Intermediate‐Scale Quantum (NISQ) devices. Herein, we developed a k‐QUpCCGSD ansatz which is based on the generalized paired double excitation operators and the particle preserving exchange gate. The former reduces the number of the excitation operators, the latter reduces the number of qubit gates for transforming excitation operators to quantum circuit. The gate complexity of the proposed k‐QUpCCGSD ansatz is up‐bounded to , which significantly reduce the complexity of the VQE algorithm on NISQ devices. The performance of the proposed ansatz on VQE is demonstrated by calculating ground‐state dissociation energy curves of the H6, LiH, H2O, and BeH2 molecules with the STO‐3G minimal basis set, and the accuracy is evaluated by comparing to the full configuration interaction (FCI) benchmarks. Moreover, we compare the number of quantum gates, especially the CNOT gates, and accuracies of various ansatzes. The assessments have shown that the accuracy of qubit unitary coupled cluster (QUCC) ansatzes is slightly worse than that of the UCC ones, but the circuit complexity of QUCC is much less than that of UCC. Among the tested QUCC ansatzes, k‐QUpCCGSD achieves higher accuracy with fewer quantum gates than QUCCSD, and k‐QUpCCGSD is a promising ansatz for VQE calculation on NISQ devices.