Quantifying Teleportation Overhead in Distributed Unitary Coupled-Cluster Ansätze
Abstract
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.
Related
- Unitary Coupled Cluster Nuclear Shielding Constants in a Quantum Linear Response Framework
- Quantifying the Coupled Role of Mie Resonance Order and Geometry in Hot-Electron Photodetection
- Beyond Moisture Content: Time-Domain NMR for Quantifying Molecular Mobility, Water Accessibility and Food Function
- Compile-once operation graphs for reusable continuous unitary transformations
- Quantifying the Coherence Wall: FeMoCo Quantum Chemistry from 48 to 108 Qubits on IBM Heron r2
BibTeX
@misc{jones2026quantifying,
title = {{Quantifying Teleportation Overhead in Distributed Unitary Coupled-Cluster Ansätze}},
author = {Grier M. Jones and Hassan Tariq Shafi and Zixuan Wang and Thomas Trenty and Zachary Vernec and Hans-Arno Jacobsen},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.36266},
eprint = {2609.36266},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.36266},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Quantifying Teleportation Overhead in Distributed Unitary Coupled-Cluster Ansätze
AU - Grier M. Jones
AU - Hassan Tariq Shafi
AU - Zixuan Wang
AU - Thomas Trenty
AU - Zachary Vernec
AU - Hans-Arno Jacobsen
PY - 2026
DA - 2026/09/30
PB - arXiv
DO - 10.48550/arxiv.2609.36266
UR - https://arxiv.org/abs/2609.36266
AB - 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.
ER -