Problem
Research questions and friction points this paper is trying to address.
Distributed Quantum Computing
Unitary Coupled-Cluster
Teleportation Overhead
Quantum Chemistry
Resource Estimation
Quantifying Teleportation Overhead in Distributed Unitary Coupled-Cluster Ansätze
🤖 AI Summary
This study addresses the unclear overhead of non-local gate teleportation for Unitary Coupled Cluster (UCC) ansätze in distributed quantum computing. Using hydrogen chains as benchmarks, we systematically quantify the resource requirements of UCCSD and UpCCD under distributed architectures, comparing naive distribution with the TeleSABRE algorithm. Furthermore, this work presents the first evaluation of how Jordan-Wigner versus Bravyi-Kitaev encodings and various partitioning strategies affect communication overhead. Our results reveal that UpCCD, when combined with spin-blocked Jordan-Wigner ordering, achieves optimal resource scaling, exhibiting significantly lower distributed overhead than UCCSD. These findings provide critical guidance for the compilation optimization and efficient deployment of distributed variational quantum algorithms.
📝 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.
Innovation
Methods, ideas, or system contributions that make the work stand out.
Distributed Quantum Computing
Unitary Coupled-Cluster
Quantum Teleportation
TeleSABRE
Fermion-to-Qubit Mapping
🔎 Similar Papers
No similar papers found.
