Metraipolis › archive › dc_57aa8dffc4ed
Quantifying Teleportation Overhead in Distributed Unitary Coupled-Cluster Ansätze — arXiv:2609.36266
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.36266
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T16:59:15.078Z
- SHA-256 of the archived text
4996b22e885220a107396f9d56da43a0af9d06f4e9d057fcb184cfc7603fb55e- Stable URL of this page
https://metraipolis.com/documento/dc_57aa8dffc4ed
How to cite
Quantifying Teleportation Overhead in Distributed Unitary Coupled-Cluster Ansätze — arXiv:2609.36266 — arXiv (en), https://arxiv.org/abs/2609.36266 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_57aa8dffc4ed (Metraipolis archive dc_57aa8dffc4ed, sha256 4996b22e885220a107396f9d56da43a0af9d06f4e9d057fcb184cfc7603fb55e)
BibTeX
@misc{dc57aa8dffc4ed,
title = {Quantifying Teleportation Overhead in Distributed Unitary Coupled-Cluster Ansätze — arXiv:2609.36266},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.36266},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_57aa8dffc4ed; sha256 4996b22e885220a107396f9d56da43a0af9d06f4e9d057fcb184cfc7603fb55e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.36266. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-30 in cs.DC). Categorie arXiv: Quantum Physics (quant-ph) ; Distributed, Parallel, and Cluster Computing (cs.DC); Chemical Physics (physics.chem-ph). Pagina del lavoro: https://arxiv.org/abs/2609.36266 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-07T16:31:32.471Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).