arXiv:2609.36266
Quantifying Teleportation Overhead in Distributed Unitary Coupled-Cluster Ansätze
Grier M. Jones, Hassan Tariq Shafi, Zixuan Wang, Thomas Trenty, Zachary Vernec, Hans-Arno Jacobsen
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.
AI Summary
The paper estimates teleportation overhead for distributing quantum-chemistry UCC circuits, comparing UCCSD, UpCCD, and UpCCGSD under Jordan–Wigner (JW) and Bravyi–Kitaev (BK) encodings. It asks how ansatz choice, encoding, partitioning, and routing affect nonlocal-resource requirements for hydrogen chains. Circuits generated with Tequila and converted to Qiskit are evaluated using two approaches: counting two-qubit gates crossing fixed half- or quarter-partitions, and applying the existing TeleSABRE layout-and-routing heuristic to two coupled 120-qubit square-lattice QPUs. The analysis counts Bell pairs and, for routed circuits, SWAPs, total gates, and qubits; it assumes arbitrary-angle rotations are available. UpCCD has the lowest reported overhead, UpCCGSD is intermediate, and UCCSD has the largest resource requirements. Naive UpCCD Bell-pair estimates range from 4 for $\mathrm{H}_2$ with JW to 2,508 for $\mathrm{H}_{50}$ with BK. TeleSABRE is reported to reduce Bell-pair requirements by more than an order of magnitude relative to naive layouts. Routing also reduces encoding-dependent differences and can reverse their direction: for UpCCGSD, BK requires more Bell pairs than JW at $\mathrm{H}_{10}$ but fewer at $\mathrm{H}_{26}$. The study is restricted to hydrogen chains and does not assess chemical accuracy per resource or noise-dependent trade-offs. Memory constraints limit UCCSD estimates to $\mathrm{H}_{18}$ and routed UpCCGSD estimates to $\mathrm{H}_{26}$, although naive UpCCGSD estimates extend to $\mathrm{H}_{50}$. Broader molecular tests and joint accuracy–distributability comparisons are deferred to future work.
Central claim may not hold: The abstract's preference for spin-blocked Jordan–Wigner UpCCD is not established by a defined ordering comparison or by the reported results. The reported TeleSABRE results omit UCCSD, so the larger UCCSD overhead demonstrated for naive partitions is not established after routing optimization. The promised classical-communication costs are not reported or explicitly derived from the teleportation resource counts.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.