量化分布式酉耦合簇拟设中的隐形传态开销
Quantifying Teleportation Overhead in Distributed Unitary Coupled-Cluster Ansätze
- University of Toronto（多伦多大学）
机构由 AI 辅助整理，请以论文原文为准。
AI总结：
本研究量化了分布式量子计算中酉耦合簇拟设（UCCSD、UpCCD、UpCCGSD）的隐形传态开销，发现自旋分块Jordan-Wigner排序的UpCCD扩展性最优，而UCCSD资源需求显著更大。
AI中文摘要：
分布式量子计算（DQC）已被提出作为超越单片量子处理器架构、扩展量子算法以应用于实际问题的途径。在这些应用中，量子化学被广泛认为是量子计算最有前景的应用场景之一。在本工作中，我们估算了用于量子化学的酉耦合簇（UCC）拟设的分布式资源需求，重点关注氢链的酉耦合簇单双激发（UCCSD）、酉对耦合簇双激发（UpCCD）以及具有广义单双激发的酉对耦合簇（UpCCGSD）电路。我们聚焦于基于隐形传态的DQC方法，定量比较了朴素分布方法与TeleSABRE算法的输出。对于这两种方法，我们估算了在固定中点或四分之一分割下处理非局域双量子比特门的成本，报告了隐形传态中的贝尔对/经典通信开销。在Jordan-Wigner和Bravyi-Kitaev变换下，我们发现采用自旋分块Jordan-Wigner排序的UpCCD具有最有利的扩展性，而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ä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.
