Search papers, labs, and topics across Lattice.
The authors benchmark the distributed resource overheads—quantified by Bell-pair consumption and classical communication—required to execute unitary coupled-cluster ansätze (UCCSD, UpCCD, and UpCCGSD) across partitioned architectures in teleportation-based distributed quantum computing. Determining these cross-partition costs is essential for assessing whether modular quantum processors can feasibly execute variational algorithms for quantum chemistry beyond monolithic limits. Evaluated on hydrogen chain models, UpCCD with spin-blocked Jordan-Wigner encoding yields the lowest teleportation overhead, whereas full UCCSD incurs massive inter-core routing costs that severely penalize distributed scaling.
Scaling quantum chemistry across modular QPUs hinges on ansatz selection: pairing UpCCD with spin-blocked Jordan-Wigner encoding dramatically slashes inter-chip Bell-pair consumption compared to the prohibitive overhead of standard UCCSD.
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\"atze 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.
