arXiv:2507.01902 · IEEE International Conference on Quantum Computing and Engineering (QCE)

Analyzing Common Electronic Structure Theory Algorithms for Distributed Quantum Computing

Grier M. Jones, Hans‐Arno Jacobsen

Published Aug 30, 2025• 1 citation

Abstract

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.

DOI: 10.1109/qce65121.2025.10351

Related papers

Quantum orbital-optimized unitary coupled cluster methods in the strongly correlated regime: Can quantum algorithms outperform their classical equivalents?

Igor O. Sokolov, Panagiotis Kl. Barkoutsos, Pauline J. Ollitrault +4 more

The Coupled Cluster (CC) method is used to compute the electronic correlation energy in atoms and molecules and often leads to highly accurate results. However, due to its single-reference nature, standard CC in its projected form fails to describe quantum states characterized by strong electronic correlations and multi-reference projective methods become necessary. On the other hand, quantum algorithms for the solution of many-electron problems have also emerged recently. The quantum unitary variant of CC (UCC) with singles and doubles (q-UCCSD) is a popular wavefunction Ansatz for the variational quantum eigensolver algorithm. The variational nature of this approach can lead to significant advantages compared to its classical equivalent in the projected form, in particular, for the description of strong electronic correlation. However, due to the large number of gate operations required in q-UCCSD, approximations need to be introduced in order to make this approach implementable in a state-of-the-art quantum computer. In this work, we evaluate several variants of the standard q-UCCSD Ansatz in which only a subset of excitations is included. In particular, we investigate the singlet and pair q-UCCD approaches combined with orbital optimization. We show that these approaches can capture the dissociation/distortion profiles of challenging systems, such as H4, H2O, and N2 molecules, as well as the one-dimensional periodic Fermi–Hubbard chain. These results promote the future use of q-UCC methods for the solution of challenging electronic structure problems in quantum chemistry.

arXiv:1911.10864The Journal of Chemical PhysicsMar 25, 2020164 citations

Quantifying Teleportation Overhead in Distributed Unitary Coupled-Cluster Ansätze

Grier M. Jones, Hassan Tariq Shafi, Zixuan Wang +3 more

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.

quant-pharXiv:2609.36266Sep 30, 20260 citations

Bridging physical intuition and hardware efficiency for correlated electronic states: the local unitary cluster Jastrow ansatz for electronic structure

Mário Motta, Kevin J. Sung, K. Birgitta Whaley +2 more

A prominent goal in quantum chemistry is to solve the molecular electronic structure problem for the ground state energy with high accuracy. While classical quantum chemistry is a relatively mature field, the accurate and scalable prediction of strongly correlated states found, e.g., in bond breaking and polynuclear transition metal compounds remains an open problem. Within the context of a variational quantum eigensolver, we propose a new family of ansatzes which provides a more physically appropriate description of strongly correlated electrons than unitary coupled cluster with singles and doubles excitations, with vastly reduced quantum resource requirements. Specifically, we present a set of local approximations to the unitary cluster Jastrow wavefunction motivated by Hubbard physics. The resulting ansatz removes the need for SWAP gates and can be tailored to arbitrary qubit topologies (e.g., square, hex, heavy-hex). Our ansatz is well-suited to take advantage of continuous sets of quantum gates recently realized on superconducting devices with tunable couplers, while retaining a unique level of physical transparency and interpretability. As the capabilities of quantum computing devices continue to progress, we expect that the local cluster Jastrow ansatz to be a natural choice to encode both statically and dynamically correlated electronic wavefunctions.

Chemical ScienceJan 1, 202354 citations

Quantum Simulation of Molecular Electronic States with a Transcorrelated Hamiltonian: Higher Accuracy with Fewer Qubits

Ashutosh Kumar, Ayush Asthana, Conner Masteran +5 more

Simulation of electronic structure is one of the most promising applications on noisy intermediate-scale quantum (NISQ) era devices. However, NISQ devices suffer from a number of challenges like limited qubit connectivity, short coherence times, and sizable gate error rates. Thus, desired quantum algorithms should require shallow circuit depths and low qubit counts to take advantage of these devices. Here, we attempt to reduce quantum resource requirements for molecular simulations on a quantum computer while maintaining the desired accuracy with the help of classical quantum chemical theories of canonical transformation and explicit correlation. In this work, compact ab initio Hamiltonians are generated classically, in the second quantized form, through an approximate similarity transformation of the Hamiltonian with (a) an explicitly correlated two-body unitary operator with generalized pair excitations that remove the Coulombic electron-electron singularities from the Hamiltonian and (b) a unitary one-body operator to efficiently capture the orbital relaxation effects required for accurate description of the excited states. The resulting transcorrelated Hamiltonians are able to describe both the ground and the excited states of molecular systems in a balanced manner. Using the variational quantum eigensolver (VQE) method based on the unitary coupled cluster with singles and doubles (UCCSD) ansatz and only a minimal basis set (ANO-RCC-MB), we demonstrate that the transcorrelated Hamiltonians can produce ground state energies comparable to the reference CCSD energies with the much larger cc-pVTZ basis set. This leads to a reduction in the number of required CNOT gates by more than 3 orders of magnitude for the chemical species studied in this work. Furthermore, using the quantum equation of motion (qEOM) formalism in conjunction with the transcorrelated Hamiltonian, we are able to reduce the deviations in the excitation energies from the reference EOM-CCSD/cc-pVTZ values by an order of magnitude. The transcorrelated Hamiltonians developed here are Hermitian and contain only one- and two-body interaction terms and thus can be easily combined with any quantum algorithm for accurate electronic structure simulations.

Journal of Chemical Theory and ComputationAug 19, 202244 citations

Entanglement-efficient bipartite-distributed quantum computing

Jun-Yi Wu, Kosuke Matsui, Tim Forrer +5 more

In noisy intermediate-scale quantum computing, the limited scalability of a single quantum processing unit (QPU) can be extended through distributed quantum computing (DQC), in which one can implement global operations over two QPUs by entanglement-assisted local operations and classical communication. To facilitate this type of DQC in experiments, we need an entanglement-efficient protocol. To this end, we extend the protocol in [Eisert et. al., PRA, 62:052317(2000)] implementing each nonlocal controlled-unitary gate locally with one maximally entangled pair to a packing protocol, which can pack multiple nonlocal controlled-unitary gates locally using one maximally entangled pair. In particular, two types of packing processes are introduced as the building blocks, namely the distributing processes and embedding processes. Each distributing process distributes corresponding gates locally with one entangled pair. The efficiency of entanglement is then enhanced by embedding processes, which merge two non-sequential distributing processes and hence save the entanglement cost. We show that the structure of distributability and embeddability of a quantum circuit can be fully represented by the corresponding packing graphs and conflict graphs. Based on these graphs, we derive heuristic algorithms for finding an entanglement-efficient packing of distributing processes for a given quantum circuit to be implemented by two parties. These algorithms can determine the required number of local auxiliary qubits in the DQC. We apply these algorithms for bipartite DQC of unitary coupled-cluster circuits and find a significant reduction of entanglement cost through embeddings. This method can determine a constructive upper bound on the entanglement cost for the DQC of quantum circuits.

arXiv:2212.12688QuantumDec 5, 202332 citations

Graph-|Q⟩⟨C|: A Quantum Algorithm with Reduced Quantum Circuit Depth for Electronic Structure

Srinivasan S. Iyengar, J. H. Zhang, Debadrita Saha +1 more

The accurate determination of chemical properties is known to have a critical impact on multiple fundamental chemical problems but is deeply hindered by the steep algebraic scaling of electron correlation calculations and the exponential scaling of quantum nuclear dynamics. With the advent of new quantum computing hardware and associated developments in creating new paradigms for quantum software, this avenue has been recognized as perhaps one way to address exponentially complex challenges in quantum chemistry and molecular dynamics. In this paper, we discuss a new approach to drastically reduce the quantum circuit depth (by several orders of magnitude) and help improve the accuracy in the quantum computation of electron correlation energies for large molecular systems. The method is derived from a graph-theoretic approach to molecular fragmentation and enables us to create a family of projection operators that decompose quantum circuits into separate unitary processes. Some of these processes can be treated on quantum hardware and others on classical hardware in a completely asynchronous and parallel fashion. Numerical benchmarks are provided through the computation of unitary coupled-cluster singles and doubles (UCCSD) energies for medium-sized protonated and neutral water clusters using the new quantum algorithms presented here.

The Journal of Physical Chemistry AOct 31, 20237 citations