Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

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

quant-phcs.DCphysics.chem-phSubmitted Sep 28, 2026• Announced Sep 30, 2026• 0 citations• Revised Sep 30, 2026 (v2)
v1 · Sep 28, 2026v2 · Sep 30, 2026
arXivHTMLPDF

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.

Little sign of AI-generated textIncrementalMissing comparison

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.

Related papers

Analyzing Common Electronic Structure Theory Algorithms for Distributed Quantum Computing

Grier M. Jones, Hans‐Arno Jacobsen

To move towards the utility era of quantum computing, many corporations have posed distributed quantum computing (DQC) as a framework for scaling the current generation of devices for practical applications. One of these applications is quantum chemistry, also known as electronic structure theory, which has been poised as a “killer application” of quantum computing. To this end, we analyze five electronic structure methods, including the unitary coupled-cluster singles and doubles (UCCSD), unitary pair coupled-cluster doubles (UpCCD), unitary pair coupled-cluster with generalized singles and doubles (UpCCGSD), separable pair approximation plus generalized singles (SPA+GS), and local unitary cluster Jastrow (LUCJ) ansätze. The key benefit of these methods is that they can be found in common packages, such as Tequila and ffsim, that interface easily with the Qiskit Circuit Cutting addon. Herein, we highlight the challenges and aptitude of the aforementioned electronic structure methods for distribution using quasiprobability simulation with local operations (LO). The key findings of our work are that many of these algorithms cannot be efficiently parallelized using LO, and new methods must be developed to apply electronic structure theory within a DQC framework.

arXiv:2507.01902•IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•2 citations

Generalized Unitary Coupled Cluster Wave functions for Quantum Computation

Joonho Lee, William J. Huggins, Martin Head‐Gordon +1 more

We introduce a unitary coupled-cluster (UCC) ansatz termed k -UpCCGSD that is based on a family of sparse generalized doubles operators, which provides an affordable and systematically improvable unitary coupled-cluster wave function suitable for implementation on a near-term quantum computer. k -UpCCGSD employs k products of the exponential of pair coupled-cluster double excitation operators (pCCD), together with generalized single excitation operators. We compare its performance in both efficiency of implementation and accuracy with that of the generalized UCC ansatz employing the full generalized single and double excitation operators (UCCGSD), as well as with the standard ansatz employing only single and double excitations (UCCSD). k -UpCCGSD is found to show the best scaling for quantum computing applications, requiring a circuit depth of, compared with for UCCGSD, and for UCCSD, where N is the number of spin orbitals and η is the number of electrons. We analyzed the accuracy of these three ansätze by making classical benchmark calculations on the ground state and the first excited state of H 4 (STO-3G, 6-31G), H 2 O (STO-3G), and N 2 (STO-3G), making additional comparisons to conventional coupled cluster methods. The results for ground states show that k -UpCCGSD offers a good trade-off between accuracy and cost, achieving chemical accuracy for lower cost of implementation on quantum computers than both UCCGSD and UCCSD. UCCGSD is also found to be more accurate than UCCSD but at a greater cost for implementation. Excited states are calculated with an orthogonally constrained variational quantum eigensolver approach. This is seen to generally yield less accurate energies than for the corresponding ground states. We demonstrate that using a specialized multideterminantal reference state constructed from classical linear response calculations allows these excited state energetics to be improved.

arXiv:1810.02327•Journal of Chemical Theory and Computation•Nov 28, 2018•446 citations

Localized Quantum Chemistry on Quantum Computers

Matthew Otten, Matthew R. Hermes, Riddhish Pandharkar +3 more

Quantum chemistry calculations of large, strongly correlated systems are typically limited by the computation cost that scales exponentially with the size of the system. Quantum algorithms, designed specifically for quantum computers, can alleviate this, but the resources required are still too large for today’s quantum devices. Here we present a quantum algorithm that combines a localization of multireference wave functions of chemical systems with quantum phase estimation (QPE) and variational unitary coupled cluster singles and doubles (UCCSD) to compute their ground state energy. Our algorithm, termed “local active space unitary coupled cluster” (LAS-UCC), scales linearly with system size for certain geometries, providing a polynomial reduction in the total number of gates compared with QPE, while providing accuracy above that of the variational quantum eigensolver using the UCCSD ansatz and also above that of the classical local active space self-consistent field. The accuracy of LAS-UCC is demonstrated by dissociating (H2)2 into two H2 molecules and by breaking the two double bonds in trans-butadiene and resources estimates are provided for linear chains of up to 20 H2 molecules.

Journal of Chemical Theory and Computation•Nov 8, 2022•49 citations

Localized Quantum Chemistry on Quantum Computers

Matthew Otten, Matthew R. Hermes, Riddhish Pandharkar +3 more

Quantum chemistry calculations of large, strongly correlated systems are typically limited by the computation cost that scales exponentially with the size of the system. Quantum algorithms, designed specifically for quantum computers, can alleviate this, but the resources required are still too large for today’s quantum devices. Here we present a quantum algorithm that combines a localization of multireference wave functions of chemical systems with quantum phase estimation (QPE) and variational unitary coupled cluster singles and doubles (UCCSD) to compute their ground state energy. Our algorithm, termed “local active space unitary coupled cluster” (LAS-UCC), scales linearly with system size for certain geometries, providing a polynomial reduction in the total number of gates compared with QPE, while providing accuracy above that of the variational quantum eigensolver using the UCCSD ansatz and also above that of the classical local active space self-consistent field. The accuracy of LAS-UCC is demonstrated by dissociating (H2)2 into two H2 molecules and by breaking the two double bonds in trans-butadiene and resources estimates are provided for linear chains of up to 20 H2 molecules.

arXiv:2203.02012•Oct 21, 2021•5 citations

Localized Quantum Chemistry on Quantum Computers

Matthew Otten, Matthew R. Hermes, Riddhish Pandharkar +3 more

Quantum chemistry calculations of large, strongly correlated systems are typically limited by the computation cost that scales exponentially with the size of the system. Quantum algorithms, designed specifically for quantum computers, can alleviate this, but the resources required are still too large for today's quantum devices. Here, we present a quantum algorithm that combines a localization of multireference wave functions of chemical systems with quantum phase estimation (QPE) and variational unitary coupled cluster singles and doubles (UCCSD) to compute their ground-state energy. Our algorithm, termed "local active space unitary coupled cluster" (LAS-UCC), scales linearly with the system size for certain geometries, providing a polynomial reduction in the total number of gates compared with QPE, while providing accuracy above that of the variational quantum eigensolver using the UCCSD ansatz and also above that of the classical local active space self-consistent field. The accuracy of LAS-UCC is demonstrated by dissociating (H2)2 into two H2 molecules and by breaking the two double bonds in trans-butadiene, and resource estimates are provided for linear chains of up to 20 H2 molecules.

•Nov 8, 2022•0 citations

Towards Reproducible Evaluation of Distributed Quantum Circuit Partitioning Algorithms

Javier Vela-Tambo, Davud Azizov, Tian Guo

Distributed Quantum Computing (DQC) addresses the physical scaling limitations of monolithic quantum processors by networking modular Quantum Processing Units (QPUs). Efficient execution of quantum algorithms on DQC architectures requires compiling them across QPUs while minimizing inter-QPU communication bottlenecks, primarily through circuit partitioning. However, current evaluations of state-of-the-art partitioning heuristics focus primarily on the total entanglement cost of the partitions, failing to capture the broader structural and temporal overheads introduced by distributed network constraints. This paper addresses this evaluation gap by applying established monolithic benchmarking metrics to partitioned distributed circuits to quantify the performance impact of network constraints. Using an open-source, automated evaluation pipeline, we systematically assess diverse partitioning algorithms across standardized workloads and quantum network topologies. Our empirical results reveal that partitioning algorithms with comparable entanglement costs can still introduce drastically different physical execution penalties. By exposing these hidden trade-offs, such as severe increases in circuit depth and substantial reductions in gate density, this study demonstrates that comprehensive circuit-level metrics are essential for guiding the future design of DQC compilers.

quant-pharXiv:2608.27099•Aug 28, 2026•0 citations
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.
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 H2\mathrm{H}_2H2​ with JW to 2,508 for H50\mathrm{H}_{50}H50​ 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 H10\mathrm{H}_{10}H10​ but fewer at H26\mathrm{H}_{26}H26​.
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 H18\mathrm{H}_{18}H18​ and routed UpCCGSD estimates to H26\mathrm{H}_{26}H26​, although naive UpCCGSD estimates extend to H50\mathrm{H}_{50}H50​. Broader molecular tests and joint accuracy–distributability comparisons are deferred to future work.
To move towards the utility era of quantum computing, many corporations have posed distributed quantum computing (DQC) as a framework for scaling the current generation of devices for practical applications. One of these applications is quantum chemistry, also known as electronic structure theory, which has been poised as a “killer application” of quantum computing. To this end, we analyze five electronic structure methods, including the unitary coupled-cluster singles and doubles (UCCSD), unitary pair coupled-cluster doubles (UpCCD), unitary pair coupled-cluster with generalized singles and doubles (UpCCGSD), separable pair approximation plus generalized singles (SPA+GS), and local unitary cluster Jastrow (LUCJ) ansätze. The key benefit of these methods is that they can be found in common packages, such as Tequila and ffsim, that interface easily with the Qiskit Circuit Cutting addon. Herein, we highlight the challenges and aptitude of the aforementioned electronic structure methods for distribution using quasiprobability simulation with local operations (LO). The key findings of our work are that many of these algorithms cannot be efficiently parallelized using LO, and new methods must be developed to apply electronic structure theory within a DQC framework.
We introduce a unitary coupled-cluster (UCC) ansatz termed k -UpCCGSD that is based on a family of sparse generalized doubles operators, which provides an affordable and systematically improvable unitary coupled-cluster wave function suitable for implementation on a near-term quantum computer. k -UpCCGSD employs k products of the exponential of pair coupled-cluster double excitation operators (pCCD), together with generalized single excitation operators. We compare its performance in both efficiency of implementation and accuracy with that of the generalized UCC ansatz employing the full generalized single and double excitation operators (UCCGSD), as well as with the standard ansatz employing only single and double excitations (UCCSD). k -UpCCGSD is found to show the best scaling for quantum computing applications, requiring a circuit depth of, compared with for UCCGSD, and for UCCSD, where N is the number of spin orbitals and η is the number of electrons. We analyzed the accuracy of these three ansätze by making classical benchmark calculations on the ground state and the first excited state of H 4 (STO-3G, 6-31G), H 2 O (STO-3G), and N 2 (STO-3G), making additional comparisons to conventional coupled cluster methods. The results for ground states show that k -UpCCGSD offers a good trade-off between accuracy and cost, achieving chemical accuracy for lower cost of implementation on quantum computers than both UCCGSD and UCCSD. UCCGSD is also found to be more accurate than UCCSD but at a greater cost for implementation. Excited states are calculated with an orthogonally constrained variational quantum eigensolver approach. This is seen to generally yield less accurate energies than for the corresponding ground states. We demonstrate that using a specialized multideterminantal reference state constructed from classical linear response calculations allows these excited state energetics to be improved.
Quantum chemistry calculations of large, strongly correlated systems are typically limited by the computation cost that scales exponentially with the size of the system. Quantum algorithms, designed specifically for quantum computers, can alleviate this, but the resources required are still too large for today’s quantum devices. Here we present a quantum algorithm that combines a localization of multireference wave functions of chemical systems with quantum phase estimation (QPE) and variational unitary coupled cluster singles and doubles (UCCSD) to compute their ground state energy. Our algorithm, termed “local active space unitary coupled cluster” (LAS-UCC), scales linearly with system size for certain geometries, providing a polynomial reduction in the total number of gates compared with QPE, while providing accuracy above that of the variational quantum eigensolver using the UCCSD ansatz and also above that of the classical local active space self-consistent field. The accuracy of LAS-UCC is demonstrated by dissociating (H2)2 into two H2 molecules and by breaking the two double bonds in trans-butadiene and resources estimates are provided for linear chains of up to 20 H2 molecules.
Quantum chemistry calculations of large, strongly correlated systems are typically limited by the computation cost that scales exponentially with the size of the system. Quantum algorithms, designed specifically for quantum computers, can alleviate this, but the resources required are still too large for today’s quantum devices. Here we present a quantum algorithm that combines a localization of multireference wave functions of chemical systems with quantum phase estimation (QPE) and variational unitary coupled cluster singles and doubles (UCCSD) to compute their ground state energy. Our algorithm, termed “local active space unitary coupled cluster” (LAS-UCC), scales linearly with system size for certain geometries, providing a polynomial reduction in the total number of gates compared with QPE, while providing accuracy above that of the variational quantum eigensolver using the UCCSD ansatz and also above that of the classical local active space self-consistent field. The accuracy of LAS-UCC is demonstrated by dissociating (H2)2 into two H2 molecules and by breaking the two double bonds in trans-butadiene and resources estimates are provided for linear chains of up to 20 H2 molecules.
Quantum chemistry calculations of large, strongly correlated systems are typically limited by the computation cost that scales exponentially with the size of the system. Quantum algorithms, designed specifically for quantum computers, can alleviate this, but the resources required are still too large for today's quantum devices. Here, we present a quantum algorithm that combines a localization of multireference wave functions of chemical systems with quantum phase estimation (QPE) and variational unitary coupled cluster singles and doubles (UCCSD) to compute their ground-state energy. Our algorithm, termed "local active space unitary coupled cluster" (LAS-UCC), scales linearly with the system size for certain geometries, providing a polynomial reduction in the total number of gates compared with QPE, while providing accuracy above that of the variational quantum eigensolver using the UCCSD ansatz and also above that of the classical local active space self-consistent field. The accuracy of LAS-UCC is demonstrated by dissociating (H2)2 into two H2 molecules and by breaking the two double bonds in trans-butadiene, and resource estimates are provided for linear chains of up to 20 H2 molecules.
Distributed Quantum Computing (DQC) addresses the physical scaling limitations of monolithic quantum processors by networking modular Quantum Processing Units (QPUs). Efficient execution of quantum algorithms on DQC architectures requires compiling them across QPUs while minimizing inter-QPU communication bottlenecks, primarily through circuit partitioning. However, current evaluations of state-of-the-art partitioning heuristics focus primarily on the total entanglement cost of the partitions, failing to capture the broader structural and temporal overheads introduced by distributed network constraints. This paper addresses this evaluation gap by applying established monolithic benchmarking metrics to partitioned distributed circuits to quantify the performance impact of network constraints. Using an open-source, automated evaluation pipeline, we systematically assess diverse partitioning algorithms across standardized workloads and quantum network topologies. Our empirical results reveal that partitioning algorithms with comparable entanglement costs can still introduce drastically different physical execution penalties. By exposing these hidden trade-offs, such as severe increases in circuit depth and substantial reductions in gate density, this study demonstrates that comprehensive circuit-level metrics are essential for guiding the future design of DQC compilers.