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:2212.08006 · Nature Physics

Experimental quantum computational chemistry with optimized unitary coupled cluster ansatz

Shaojun Guo, Jinzhao Sun, Haoran Qian, Ming Gong, Yukun Zhang, Fusheng Chen, Yangsen Ye, Yulin Wu, Sirui Cao, Kun Liu, Chen Zha, Chong Ying, Qingling Zhu, He-Liang Huang, Youwei Zhao, Shaowei Li, Shiyu Wang, Jiale Yu, Daojin Fan, Dachao Wu, Hong Te Su, Huiqiu Deng, Hao Rong, Yuan Li, Kaili Zhang, Tung-Hsun Chung, Futian Liang, Jin Lin, Yu Xu, Lihua Sun, Cheng Guo, Na Li, Yong-Heng Huo, Cheng-Zhi Peng, Chao‐Yang Lu, Xiao Yuan, Xiaobo Zhu, Jian-Wei Pan

Published Jun 11, 2024• 95 citations
arXivHTMLPDF
DOI
10.1038/s41567-024-02530-z

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

Computational quantum chemistry

George Maroulis

AIP conference proceedings•Jan 1, 2012•15 citations

Quantum Computational Chemistry

Taku Onishi

Springer eBooks•Sep 22, 2017•34 citations

Operator Relationship between Conventional Coupled Cluster and Unitary Coupled Cluster

James K. Freericks

The chemistry community has long sought the exact relationship between the conventional and the unitary coupled cluster ansatz for a single-reference system, especially given the interest in performing quantum chemistry on quantum computers. In this work, we show how one can use the operator manipulations given by the exponential disentangling identity and the Hadamard lemma to relate the factorized form of the unitary coupled-cluster approximation to a factorized form of the conventional coupled cluster approximation (the factorized form is required, because some amplitudes are operator-valued and do not commute with other terms). By employing the Trotter product formula, one can then relate the factorized form to the standard form of the unitary coupled cluster ansatz. The operator dependence of the factorized form of the coupled cluster approximation can also be removed at the expense of requiring even more higher-rank operators, finally yielding the conventional coupled cluster. The algebraic manipulations of this approach are daunting to carry out by hand, but can be automated on a computer for small enough systems.

arXiv:2201.11881•Symmetry•Feb 28, 2022•13 citations

Quantum implementation of the unitary coupled cluster for simulating molecular electronic structure

Yangchao Shen, Xiang Zhang, Shuaining Zhang +3 more

In classical computational chemistry, the coupled-cluster ansatz is one of the most commonly used ab initio methods, which is critically limited by its nonunitary nature. The unitary modification as an ideal solution to the problem is, however, extremely inefficient in classical conventional computation. Here, we provide experimental evidence that indeed the unitary version of the coupled-cluster ansatz can be reliably performed in a physical quantum system, a trapped-ion system. We perform a simulation on the electronic structure of a molecular ion (${\mathrm{HeH}}^{+}$), where the ground-state energy surface curve is probed, the energies of the excited states are studied, and bond dissociation is simulated nonperturbatively. Our simulation takes advantages from quantum computation to overcome the intrinsic limitations in classical computation, and our experimental results indicate that the method is promising for preparing molecular ground states for quantum simulations.

arXiv:1506.00443•Physical Review A•Feb 15, 2017•300 citations

Computational Quantum Chemistry

Elsevier eBooks•Jan 1, 2019•23 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.
The chemistry community has long sought the exact relationship between the conventional and the unitary coupled cluster ansatz for a single-reference system, especially given the interest in performing quantum chemistry on quantum computers. In this work, we show how one can use the operator manipulations given by the exponential disentangling identity and the Hadamard lemma to relate the factorized form of the unitary coupled-cluster approximation to a factorized form of the conventional coupled cluster approximation (the factorized form is required, because some amplitudes are operator-valued and do not commute with other terms). By employing the Trotter product formula, one can then relate the factorized form to the standard form of the unitary coupled cluster ansatz. The operator dependence of the factorized form of the coupled cluster approximation can also be removed at the expense of requiring even more higher-rank operators, finally yielding the conventional coupled cluster. The algebraic manipulations of this approach are daunting to carry out by hand, but can be automated on a computer for small enough systems.
In classical computational chemistry, the coupled-cluster ansatz is one of the most commonly used ab initio methods, which is critically limited by its nonunitary nature. The unitary modification as an ideal solution to the problem is, however, extremely inefficient in classical conventional computation. Here, we provide experimental evidence that indeed the unitary version of the coupled-cluster ansatz can be reliably performed in a physical quantum system, a trapped-ion system. We perform a simulation on the electronic structure of a molecular ion (HeH+{\mathrm{HeH}}^{+}HeH+), where the ground-state energy surface curve is probed, the energies of the excited states are studied, and bond dissociation is simulated nonperturbatively. Our simulation takes advantages from quantum computation to overcome the intrinsic limitations in classical computation, and our experimental results indicate that the method is promising for preparing molecular ground states for quantum simulations.