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

The Journal of Physical Chemistry A

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

Srinivasan S. Iyengar, J. H. Zhang, Debadrita Saha, Timothy C. Ricard

Published Oct 31, 2023• 7 citations
Publisher

Abstract

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.

DOI
10.1021/acs.jpca.3c04261

Related papers

Graph-|Q⟩⟨C|, a Graph-Based Quantum/Classical Algorithm for Efficient Electronic Structure on Hybrid Quantum/Classical Hardware Systems: Improved Quantum Circuit Depth Performance

J. H. Zhang, Srinivasan S. Iyengar

We present a procedure to reduce the depth of quantum circuits and improve the accuracy of results in computing post-Hartree–Fock electronic structure energies in large molecular systems. The method is based on molecular fragmentation where a molecular system is divided into overlapping fragments through a graph-theoretic procedure. This allows us to create a set of projection operators that decompose the unitary evolution of the full system into separate sets of processes, some of which can be treated on quantum hardware and others on classical hardware. Thus, we develop a procedure for an electronic structure that can be asynchronously spawned onto a potentially large ensemble of classical and quantum hardware systems. We demonstrate this method by computing Unitary Coupled Cluster Singles and Doubles (UCCSD) energies for a set of [H 2 ] n clusters, with n ranging from 4 to 128. We implement our methodology using quantum circuits, and when these quantum circuits are processed on a quantum simulator, we obtain energies in agreement with the UCCSD energies in the milli-hartree energy range. We also show that our circuit decomposition approach yields up to 9 orders of magnitude reduction in the number of CNOT gates and quantum circuit depth for the large-sized clusters when compared to a standard quantum circuit implementation available on IBM’s Quantum Information Science kit, known as Qiskit.

Journal of Chemical Theory and Computation•Apr 12, 2022•19 citations

Accuracy and Resource Estimations for Quantum Chemistry on a Near-Term Quantum Computer

Michael Kühn, Sebastian Zanker, Peter Deglmann +2 more

One of the most important application areas of molecular quantum chemistry is the study and prediction of chemical reactivity. Large-scale, fully error-tolerant quantum computers could provide exact or near-exact solutions to the underlying electronic structure problem with exponentially less effort than a classical computer thus enabling highly accurate predictions for comparably large molecular systems. In the nearer future, however, only “noisy” devices with a limited number of qubits that are subject to decoherence will be available. For such near-term quantum computers the hybrid quantum-classical variational quantum eigensolver algorithm in combination with the unitary coupled-cluster ansatz (UCCSD-VQE) [Peruzzo et al. Nat. Commun. 2014, 5, 4213 and McClean et al. New J. Phys. 2016, 18, 023023] has become an intensively discussed approach that could provide accurate results before the dawn of error-tolerant quantum computing. In this work we present an implementation of UCCSD-VQE that allows for the first time to treat both open- and closed-shell molecules. We study the accuracy of the obtained energies for nine small molecular systems as well as for four exemplary chemical reactions by comparing to well-established electronic structure methods like (nonunitary) coupled-cluster and density functional theory. Finally, we roughly estimate the required quantum hardware resources to obtain “useful” results for practical purposes.

arXiv:1812.06814•Journal of Chemical Theory and Computation•Aug 12, 2019•75 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.

arXiv:2201.09852•Journal of Chemical Theory and Computation•Aug 19, 2022•50 citations

Graph-Theoretic Molecular Fragmentation for Potential Surfaces Leads Naturally to a Tensor Network Form and Allows Accurate and Efficient Quantum Nuclear Dynamics

Anup Kumar, Nicole DeGregorio, Timothy C. Ricard +1 more

Molecular fragmentation methods have revolutionized quantum chemistry. Here, we use a graph-theoretically generated molecular fragmentation method, to obtain accurate and efficient representations for multidimensional potential energy surfaces and the quantum time-evolution operator, which plays a critical role in quantum chemical dynamics. In doing so, we find that the graph-theoretic fragmentation approach naturally reduces the potential portion of the time-evolution operator into a tensor network that contains a stream of coupled lower-dimensional propagation steps to potentially achieve quantum dynamics with reduced complexity. Furthermore, the fragmentation approach used here has previously been shown to allow accurate and efficient computation of post-Hartree-Fock electronic potential energy surfaces, which in many cases has been shown to be at density functional theory cost. Thus, by combining the advantages of molecular fragmentation with the tensor network formalism, the approach yields an on-the-fly quantum dynamics scheme where both the electronic potential calculation and nuclear propagation portion are enormously simplified through a single stroke. The method is demonstrated by computing approximations to the propagator and to potential surfaces for a set of coupled nuclear dimensions within a protonated water wire problem exhibiting the Grotthuss mechanism of proton transport. In all cases, our approach has been shown to reduce the complexity of representing the quantum propagator, and by extension action of the propagator on an initial wavepacket, by several orders, with minimal loss in accuracy.

Journal of Chemical Theory and Computation•Nov 4, 2022•11 citations

Quantum algorithms for electronic structure beyond ground state energies

Emiel Koridon

Quantum chemistry models atoms and molecules using quantum mechanics, with the electronic structure problem at its core. This problem, which determines the energy and properties of electrons in a molecule, is exponentially hard to solve exactly on classical computers. To approximate solutions, effective models introduce layers of simplifications. However, these approximations can fail for strongly correlated systems, necessitating alternative approaches. Quantum computers, capable of processing quantum information natively, offer a promising path to simulate molecular systems beyond classical reach, with potential applications in catalysis, materials science, and photochemistry. Despite rapid advancements in quantum hardware, practical quantum computations remain challenging due to limited resources. This thesis optimizes quantum resource usage in computational chemistry, introducing novel embedding techniques and exploring applications beyond ground-state energies. Chapter 1 establishes the foundation by reviewing quantum chemistry methods, from Hartree-Fock and Density Functional Theory (DFT) to active space approaches. It also provides an introduction to quantum computing for chemistry, focusing on near-term algorithms. The following chapters present novel methods aimed at reducing quantum resource requirements and tackling problems classical methods struggle with. Chapter 2 introduces a technique to reduce the $\lambda$-norm of the electronic structure Hamiltonian, a key measure of quantum resource demand. By transforming molecular orbitals, this method enhances sampling efficiency in Noisy Intermediate-Scale Quantum (NISQ) algorithms and reduces runtime in Fault-Tolerant Quantum Computing (FTQC). Localized orbitals outperform canonical ones, and an orbital-optimization scheme is proposed to minimize the $\lambda$-norm. Benchmarks on hydrogen chains, FeMoco, and Ruthenium complexes demonstrate its effectiveness. Chapter 3 presents the FragPT2 framework for simulating large systems with multiple interacting fragments. This method embeds each fragment in the mean field of others and applies multi-reference perturbation theory to capture inter-fragment correlations such as dispersion and charge transfer efficiently. The approach reduces computational overhead and enables scalable simulations, as shown in applications to \ce{N2} dimers, aromatic dimers, and butadiene. Chapter 4 focuses on photochemical systems, where multiple electronic states must be treated equally. The state-averaged orbital-optimized variational quantum eigensolver (SAOOVQE) is extended with analytical energy gradients and non-adiabatic couplings, enabling geometry optimizations and simulations of non-adiabatic dynamics on quantum hardware. This is demonstrated by locating the conical intersection in formaldimine, highlighting SAOOVQE’s potential for studying photoisomerization in biomolecules. Building on this, Chapter 5 develops a quantum algorithm to detect conical intersections, where the Born-Oppenheimer approximation breaks down. These intersections are characterized by a discrete Berry phase (0 or $\pi$), representing their topological nature. The algorithm extracts this phase as a single bit of information, ensuring resilience to noise. Analytical proof and numerical validation using a toy molecular model illustrate its effectiveness for studying light-perception biochemistry and related photochemical processes. Finally, Chapter 6 explores machine learning density functionals trained on noisy quantum data. While DFT is computationally efficient, its accuracy depends on approximated exchange-correlation functionals. This work proposes a neural network-based approach to learn the exact functional from quantum data, showing that training on noisy outputs from NISQ devices can mitigate sampling errors. Applications to the Fermi-Hubbard model and other systems demonstrate its potential to generalize and provide accurate results under noise. This thesis advances quantum computational chemistry by optimizing quantum resource usage, developing new embedding strategies, and expanding the scope of quantum simulations beyond ground-state properties. These contributions pave the way for practical quantum algorithms that could revolutionize molecular simulations in the near future.

•Apr 4, 2025•0 citations

Circuit-Depth Reduction of Unitary-Coupled-Cluster Ansatz by Energy Sorting

Yi Fan, Changsu Cao, Xusheng Xu +3 more

Quantum computation represents a revolutionary approach to solving problems in quantum chemistry. However, due to the limited quantum resources in the current noisy intermediate-scale quantum (NISQ) devices, quantum algorithms for large chemical systems remain a major task. In this work, we demonstrate that the circuit depth of the unitary coupled cluster (UCC) and UCC-based ansatzes in the algorithm of the variational quantum eigensolver can be significantly reduced by an energy-sorting strategy. Specifically, subsets of excitation operators are first prescreened from the operator pool according to its contribution to the total energy. The quantum circuit ansatz is then iteratively constructed until convergence of the final energy to a typical accuracy. For demonstration, this method has been successfully applied to molecular and periodic systems. Particularly, a reduction of 50%-98% in the number of operators is observed while retaining the accuracy of the original UCCSD operator pools. This method can be straightforwardly extended to general parametric variational ansatzes.

arXiv:2106.15210•The Journal of Physical Chemistry Letters•Oct 20, 2023•38 citations
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.
We present a procedure to reduce the depth of quantum circuits and improve the accuracy of results in computing post-Hartree–Fock electronic structure energies in large molecular systems. The method is based on molecular fragmentation where a molecular system is divided into overlapping fragments through a graph-theoretic procedure. This allows us to create a set of projection operators that decompose the unitary evolution of the full system into separate sets of processes, some of which can be treated on quantum hardware and others on classical hardware. Thus, we develop a procedure for an electronic structure that can be asynchronously spawned onto a potentially large ensemble of classical and quantum hardware systems. We demonstrate this method by computing Unitary Coupled Cluster Singles and Doubles (UCCSD) energies for a set of [H 2 ] n clusters, with n ranging from 4 to 128. We implement our methodology using quantum circuits, and when these quantum circuits are processed on a quantum simulator, we obtain energies in agreement with the UCCSD energies in the milli-hartree energy range. We also show that our circuit decomposition approach yields up to 9 orders of magnitude reduction in the number of CNOT gates and quantum circuit depth for the large-sized clusters when compared to a standard quantum circuit implementation available on IBM’s Quantum Information Science kit, known as Qiskit.
One of the most important application areas of molecular quantum chemistry is the study and prediction of chemical reactivity. Large-scale, fully error-tolerant quantum computers could provide exact or near-exact solutions to the underlying electronic structure problem with exponentially less effort than a classical computer thus enabling highly accurate predictions for comparably large molecular systems. In the nearer future, however, only “noisy” devices with a limited number of qubits that are subject to decoherence will be available. For such near-term quantum computers the hybrid quantum-classical variational quantum eigensolver algorithm in combination with the unitary coupled-cluster ansatz (UCCSD-VQE) [Peruzzo et al. Nat. Commun. 2014, 5, 4213 and McClean et al. New J. Phys. 2016, 18, 023023] has become an intensively discussed approach that could provide accurate results before the dawn of error-tolerant quantum computing. In this work we present an implementation of UCCSD-VQE that allows for the first time to treat both open- and closed-shell molecules. We study the accuracy of the obtained energies for nine small molecular systems as well as for four exemplary chemical reactions by comparing to well-established electronic structure methods like (nonunitary) coupled-cluster and density functional theory. Finally, we roughly estimate the required quantum hardware resources to obtain “useful” results for practical purposes.
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.
Molecular fragmentation methods have revolutionized quantum chemistry. Here, we use a graph-theoretically generated molecular fragmentation method, to obtain accurate and efficient representations for multidimensional potential energy surfaces and the quantum time-evolution operator, which plays a critical role in quantum chemical dynamics. In doing so, we find that the graph-theoretic fragmentation approach naturally reduces the potential portion of the time-evolution operator into a tensor network that contains a stream of coupled lower-dimensional propagation steps to potentially achieve quantum dynamics with reduced complexity. Furthermore, the fragmentation approach used here has previously been shown to allow accurate and efficient computation of post-Hartree-Fock electronic potential energy surfaces, which in many cases has been shown to be at density functional theory cost. Thus, by combining the advantages of molecular fragmentation with the tensor network formalism, the approach yields an on-the-fly quantum dynamics scheme where both the electronic potential calculation and nuclear propagation portion are enormously simplified through a single stroke. The method is demonstrated by computing approximations to the propagator and to potential surfaces for a set of coupled nuclear dimensions within a protonated water wire problem exhibiting the Grotthuss mechanism of proton transport. In all cases, our approach has been shown to reduce the complexity of representing the quantum propagator, and by extension action of the propagator on an initial wavepacket, by several orders, with minimal loss in accuracy.
Quantum chemistry models atoms and molecules using quantum mechanics, with the electronic structure problem at its core. This problem, which determines the energy and properties of electrons in a molecule, is exponentially hard to solve exactly on classical computers. To approximate solutions, effective models introduce layers of simplifications. However, these approximations can fail for strongly correlated systems, necessitating alternative approaches. Quantum computers, capable of processing quantum information natively, offer a promising path to simulate molecular systems beyond classical reach, with potential applications in catalysis, materials science, and photochemistry. Despite rapid advancements in quantum hardware, practical quantum computations remain challenging due to limited resources. This thesis optimizes quantum resource usage in computational chemistry, introducing novel embedding techniques and exploring applications beyond ground-state energies. Chapter 1 establishes the foundation by reviewing quantum chemistry methods, from Hartree-Fock and Density Functional Theory (DFT) to active space approaches. It also provides an introduction to quantum computing for chemistry, focusing on near-term algorithms. The following chapters present novel methods aimed at reducing quantum resource requirements and tackling problems classical methods struggle with. Chapter 2 introduces a technique to reduce the λ\lambdaλ-norm of the electronic structure Hamiltonian, a key measure of quantum resource demand. By transforming molecular orbitals, this method enhances sampling efficiency in Noisy Intermediate-Scale Quantum (NISQ) algorithms and reduces runtime in Fault-Tolerant Quantum Computing (FTQC). Localized orbitals outperform canonical ones, and an orbital-optimization scheme is proposed to minimize the λ\lambdaλ-norm. Benchmarks on hydrogen chains, FeMoco, and Ruthenium complexes demonstrate its effectiveness. Chapter 3 presents the FragPT2 framework for simulating large systems with multiple interacting fragments. This method embeds each fragment in the mean field of others and applies multi-reference perturbation theory to capture inter-fragment correlations such as dispersion and charge transfer efficiently. The approach reduces computational overhead and enables scalable simulations, as shown in applications to \ce{N2} dimers, aromatic dimers, and butadiene. Chapter 4 focuses on photochemical systems, where multiple electronic states must be treated equally. The state-averaged orbital-optimized variational quantum eigensolver (SAOOVQE) is extended with analytical energy gradients and non-adiabatic couplings, enabling geometry optimizations and simulations of non-adiabatic dynamics on quantum hardware. This is demonstrated by locating the conical intersection in formaldimine, highlighting SAOOVQE’s potential for studying photoisomerization in biomolecules. Building on this, Chapter 5 develops a quantum algorithm to detect conical intersections, where the Born-Oppenheimer approximation breaks down. These intersections are characterized by a discrete Berry phase (0 or π\piπ), representing their topological nature. The algorithm extracts this phase as a single bit of information, ensuring resilience to noise. Analytical proof and numerical validation using a toy molecular model illustrate its effectiveness for studying light-perception biochemistry and related photochemical processes. Finally, Chapter 6 explores machine learning density functionals trained on noisy quantum data. While DFT is computationally efficient, its accuracy depends on approximated exchange-correlation functionals. This work proposes a neural network-based approach to learn the exact functional from quantum data, showing that training on noisy outputs from NISQ devices can mitigate sampling errors. Applications to the Fermi-Hubbard model and other systems demonstrate its potential to generalize and provide accurate results under noise. This thesis advances quantum computational chemistry by optimizing quantum resource usage, developing new embedding strategies, and expanding the scope of quantum simulations beyond ground-state properties. These contributions pave the way for practical quantum algorithms that could revolutionize molecular simulations in the near future.
Quantum computation represents a revolutionary approach to solving problems in quantum chemistry. However, due to the limited quantum resources in the current noisy intermediate-scale quantum (NISQ) devices, quantum algorithms for large chemical systems remain a major task. In this work, we demonstrate that the circuit depth of the unitary coupled cluster (UCC) and UCC-based ansatzes in the algorithm of the variational quantum eigensolver can be significantly reduced by an energy-sorting strategy. Specifically, subsets of excitation operators are first prescreened from the operator pool according to its contribution to the total energy. The quantum circuit ansatz is then iteratively constructed until convergence of the final energy to a typical accuracy. For demonstration, this method has been successfully applied to molecular and periodic systems. Particularly, a reduction of 50%-98% in the number of operators is observed while retaining the accuracy of the original UCCSD operator pools. This method can be straightforwardly extended to general parametric variational ansatzes.