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

Journal of Chemical Theory and Computation

Dynamical Self-energy Mapping (DSEM) for Creation of Sparse Hamiltonians Suitable for Quantum Computing

Diksha Dhawan, Mekena Metcalf, Dominika Zgid

Published Nov 5, 2021• 4 citations
Publisher

Abstract

We present a two-step procedure called the dynamical self-energy mapping (DSEM) that allows us to find a sparse Hamiltonian representation for molecular problems. In the first part of this procedure, the approximate self-energy of a molecular system is evaluated using a low-level method and subsequently a sparse Hamiltonian is found that best recovers this low-level dynamic self-energy. In the second step, such a sparse Hamiltonian is used by a high-level method that delivers a highly accurate dynamical part of the self-energy that is employed in later calculations. The tests conducted on small molecular problems show that the sparse Hamiltonian parameterizations lead to very good total energies. DSEM has the potential to be used as a classical–quantum hybrid algorithm for quantum computing where the sparse Hamiltonian containing only O (n 2 ) terms on a Gaussian orbital basis, where n is the number of orbitals in the system, could reduce the depth of the quantum circuit by at least an order of magnitude when compared with simulations involving a full Hamiltonian.

DOI
10.1021/acs.jctc.1c00931

Related papers

Dynamical Self-energy Mapping (DSEM) for quantum computing

Diksha Dhawan, Mekena Metcalf, Dominika Zgid

For noisy intermediate-scale quantum (NISQ) devices only a moderate number of qubits with a limited coherence is available thus enabling only shallow circuits and a few time evolution steps in the currently performed quantum computations. Here, we present how to bypass this challenge in practical molecular chemistry simulations on NISQ devices by employing a classical-quantum hybrid algorithm allowing us to produce a sparse Hamiltonian which contains only $\mathcal{O}(n^2)$ terms in a Gaussian orbital basis when compared to the $\mathcal{O}(n^4)$ terms of a standard Hamiltonian, where $n$ is the number of orbitals in the system. Classical part of this hybrid entails parameterization of the sparse, fictitious Hamiltonian in such a way that it recovers the self-energy of the original molecular system. Quantum machine then uses this fictitious Hamiltonian to calculate the self-energy of the system. We show that the developed hybrid algorithm yields very good total energies for small molecular test cases while reducing the depth of the quantum circuit by at least an order of magnitude when compared with simulations involving a full Hamiltonian.

arXiv:2010.05441•Oct 12, 2020•7 citations

Hybrid quantum-classical clustering for preparing a prior distribution of eigenspectrum

Mengzhen Ren, Yu‐Cheng Chen, Ching-Jui Lai +2 more

Determining the energy gap in a quantum many-body system is critical to understanding its behavior and is important in quantum chemistry and condensed matter physics. The challenge of determining the energy gap requires identifying both the excited and ground states of a system. In this work, we consider preparing the prior distribution and circuits for the eigenspectrum of structured, time-independent Hamiltonians (e.g., local, sparse, or symmetry-constrained), which can benefit both classical and quantum algorithms for solving eigenvalue problems. The proposed algorithm unfolds in three strategic steps: Hamiltonian transformation, parameter representation, and classical clustering. These steps are underpinned by two key insights: the use of quantum circuits to approximate the ground state of transformed Hamiltonians and the analysis of parameter representation to distinguish between eigenvectors. The algorithm is showcased through applications to the 1D Heisenberg system and the LiH molecular system, highlighting its potential for both near-term quantum devices and fault-tolerant quantum devices, restricted to structured Hamiltonians where approximate state preparation is feasible. The paper also explores the scalability of the method and its performance across various settings, setting the stage for more resource-efficient quantum computations that are both accurate and fast. The findings presented here mark a new insight into hybrid algorithms, offering a pathway to overcoming current computational challenges.

arXiv:2407.00450•npj Quantum Information•Feb 24, 2026•1 citation

Hybrid Quantum-Classical Methods for Noisy Intermediate Scaling Quantum Machines

Diksha Dhawan

The accurate and efficient simulation of many body systems has been a long-standing challenge for quantum chemists and physicists. At the heart of this challenge lies the correlation between quantum particles, which is crucial in understanding various physical phenomena, but is numerically hard to calculate. Over the decades, there has been remarkable progress in simplifying this problem aided by mathematical and chemical approximations and the availability of powerful computers. However, an exact solution to the problem still remains intractable as it requires exponential re- sources with respect to the system size. Recent advances in the field of quantum computing have shown promise in Feynman’s idea of simulating quantum mechanics on quantum computers. It has been proposed that an ideal fault-tolerant quantum computer can reduce the scaling of these sim- ulations from exponential to polynomial. However, initial quantum algorithms have shown that there is a large gap between the capabilities of current hardware and the resources required for simulating quantum systems of interest. The work of this thesis focuses on reducing this gap by introducing two novel algorithms for quantum xiv chemistry simulations, which are suitable for near-term hardware. First, we intro- duce a hybrid algorithm to decrease the total number of operations required for the quantum simulations. We use a classical computer to generate an effective Hamilto- nian containing O(n2) terms compared to the O(n4) terms of the full Hamiltonian, where n is the number of orbitals. This sparse Hamiltonian can then be used with a high-level method to recover the ground state energies. We demonstrate that this sparsification of the Hamiltonian reduces the number of quantum operations required for the simulation by an order of magnitude, thus making it accessible for the near- term Hardware. Our second algorithm aims to make the calculation of dynamic correlation functions (Green’s functions) more feasible on these quantum machines. This algorithm is designed with the motive of avoiding the use of time-evolution and reduced use of two-qubit gates. We demonstrate that we can reproduce the Green’s function within reasonable error limits using this approach. We have also discussed the use of re-sampling techniques for proper error-propagation of the stochastic data obtained from the quantum machines. The general structure of this thesis is as follows. We begin by motivating this work in Chapter 1. Chapters 2 and 3 provide a general introduction of quantum computing and Green’s function based methods, respectively. In chapter 4, the development of effective Hamiltonian is discussed in detail. Chapter 5 demonstrates the use of these effective Hamiltonians on the quantum machine for time evolution. In chapter 6, we have discussed the algorithm to calculate Green’s functions on a quantum machine. This is followed by conclusions and future directions in Chapters 7 and 8, respectively.

•Jan 1, 2022•0 citations

More quantum chemistry with fewer qubits

Jakob Günther, Alberto Baiardi, Markus Reiher +1 more

Quantum computation is one of the most promising new paradigms for the simulation of physical systems composed of electrons and atomic nuclei, with applications in chemistry, solid-state physics, materials science, and molecular biology. This requires a truncated representation of the electronic structure Hamiltonian using a finite number of orbitals. While it is, in principle, obvious how to improve on the representation by including more orbitals, this is usually unfeasible in practice (e.g., because of the limited number of qubits available) and severely compromises the accuracy of the obtained results. Here, we propose a quantum algorithm that improves on the representation of the physical problem by virtue of second-order perturbation theory. In particular, our quantum algorithm evaluates the second-order energy correction through a series of time-evolution steps under the unperturbed Hamiltonian. An important application is to go beyond the active-space approximation, allowing to include corrections of virtual orbitals, known as multireference perturbation theory. Here, we exploit the fact that the unperturbed Hamiltonian is diagonal for virtual orbitals and show that the number of qubits is independent of the number of virtual orbitals. This gives rise to more accurate energy estimates without increasing the number of qubits. Moreover, we demonstrate numerically for realistic chemical systems that the total runtime has highly favorable scaling in the number of virtual orbitals compared to previous studies. Numerical calculations confirm the necessity of the multireference perturbation theory energy corrections to reach accurate ground-state energy estimates. Our perturbation theory quantum algorithm can also be applied to symmetry-adapted perturbation theory. As such, we demonstrate that perturbation theory can help to reduce the quantum hardware requirements for quantum chemistry. Published by the American Physical Society 2024

arXiv:2308.16873•Physical Review Research•Oct 7, 2024•10 citations

System-bath model for quantum chemistry

Dmitry S. Golubev, Reza G. Shirazi, Vladimir V. Rybkin +3 more

We propose an approximate mapping of a molecular Hamiltonian to a Hamiltonian of qubits, which allows for high accuracy quantum chemistry calculations of vertical excitation energies of some molecules. The mapping is based on separating of a very small active space of only two orbitals and on modeling the electronic excitations in the remaining orbitals by a set of qubits or, equivalently, by a set of oscillators. This approach is inspired by the Random Phase Approximation (RPA), in which the excitations of electron gas are described by bosonic degrees of freedom. As a result, the Hamiltonian of the molecule is reduced to that of a system-bath model. The "system" part of the Hamiltonian describes the two molecular orbitals -- the highest occupied molecular orbital (HOMO) and the lowest unoccupied molecular orbital (LUMO) -- which are populated by two electrons. Two qubits are sufficient to encode the Hamiltonian of such a system. The "bath" consists of oscillators or, equivalently, of two level systems with each of them corresponding to an electron excitation from a doubly occupied orbital below the Fermi level to an empty orbital above the Fermi level. We hope that this mapping can inspire new approaches and algorithms aimed at calculating excitation energies of molecules on near term quantum computers.

quant-pharXiv:2603.09631•Mar 11, 2026•0 citations

Quantum Simulation of Classical Dynamical Systems using Variational Quantum Eigensolvers

Jincheng Zhang

This paper explores the potential of Variational Quantum Eigensolvers (VQEs) for simulating classical dynamical systems. Traditional numerical methods for simulating dynamical systems often struggle with complex systems exhibiting sparse interactions or requiring high computational resources. We propose a novel algorithm that utilizes the optimization capabilities of VQEs to approximate the time evolution of these systems. The core idea is to map the system's state vector onto a qubit representation and then iteratively minimize the energy functional derived from the dynamical system's equations, effectively simulating the system's evolution. We specifically target systems with sparse interactions, where the optimization landscape is expected to be more amenable to VQE's strengths. This approach offers a potentially scalable solution for simulating dynamical systems on near-term quantum computers. This work demonstrates the feasibility of employing VQEs as a tool for tackling previously intractable problems in fields such as molecular dynamics, fluid dynamics, and chaos theory.

•Sep 6, 2026•0 citations
We present a two-step procedure called the dynamical self-energy mapping (DSEM) that allows us to find a sparse Hamiltonian representation for molecular problems. In the first part of this procedure, the approximate self-energy of a molecular system is evaluated using a low-level method and subsequently a sparse Hamiltonian is found that best recovers this low-level dynamic self-energy. In the second step, such a sparse Hamiltonian is used by a high-level method that delivers a highly accurate dynamical part of the self-energy that is employed in later calculations. The tests conducted on small molecular problems show that the sparse Hamiltonian parameterizations lead to very good total energies. DSEM has the potential to be used as a classical–quantum hybrid algorithm for quantum computing where the sparse Hamiltonian containing only O (n 2 ) terms on a Gaussian orbital basis, where n is the number of orbitals in the system, could reduce the depth of the quantum circuit by at least an order of magnitude when compared with simulations involving a full Hamiltonian.
For noisy intermediate-scale quantum (NISQ) devices only a moderate number of qubits with a limited coherence is available thus enabling only shallow circuits and a few time evolution steps in the currently performed quantum computations. Here, we present how to bypass this challenge in practical molecular chemistry simulations on NISQ devices by employing a classical-quantum hybrid algorithm allowing us to produce a sparse Hamiltonian which contains only O(n2)\mathcal{O}(n^2)O(n2) terms in a Gaussian orbital basis when compared to the O(n4)\mathcal{O}(n^4)O(n4) terms of a standard Hamiltonian, where nnn is the number of orbitals in the system. Classical part of this hybrid entails parameterization of the sparse, fictitious Hamiltonian in such a way that it recovers the self-energy of the original molecular system. Quantum machine then uses this fictitious Hamiltonian to calculate the self-energy of the system. We show that the developed hybrid algorithm yields very good total energies for small molecular test cases while reducing the depth of the quantum circuit by at least an order of magnitude when compared with simulations involving a full Hamiltonian.
Determining the energy gap in a quantum many-body system is critical to understanding its behavior and is important in quantum chemistry and condensed matter physics. The challenge of determining the energy gap requires identifying both the excited and ground states of a system. In this work, we consider preparing the prior distribution and circuits for the eigenspectrum of structured, time-independent Hamiltonians (e.g., local, sparse, or symmetry-constrained), which can benefit both classical and quantum algorithms for solving eigenvalue problems. The proposed algorithm unfolds in three strategic steps: Hamiltonian transformation, parameter representation, and classical clustering. These steps are underpinned by two key insights: the use of quantum circuits to approximate the ground state of transformed Hamiltonians and the analysis of parameter representation to distinguish between eigenvectors. The algorithm is showcased through applications to the 1D Heisenberg system and the LiH molecular system, highlighting its potential for both near-term quantum devices and fault-tolerant quantum devices, restricted to structured Hamiltonians where approximate state preparation is feasible. The paper also explores the scalability of the method and its performance across various settings, setting the stage for more resource-efficient quantum computations that are both accurate and fast. The findings presented here mark a new insight into hybrid algorithms, offering a pathway to overcoming current computational challenges.
The accurate and efficient simulation of many body systems has been a long-standing challenge for quantum chemists and physicists. At the heart of this challenge lies the correlation between quantum particles, which is crucial in understanding various physical phenomena, but is numerically hard to calculate. Over the decades, there has been remarkable progress in simplifying this problem aided by mathematical and chemical approximations and the availability of powerful computers. However, an exact solution to the problem still remains intractable as it requires exponential re- sources with respect to the system size. Recent advances in the field of quantum computing have shown promise in Feynman’s idea of simulating quantum mechanics on quantum computers. It has been proposed that an ideal fault-tolerant quantum computer can reduce the scaling of these sim- ulations from exponential to polynomial. However, initial quantum algorithms have shown that there is a large gap between the capabilities of current hardware and the resources required for simulating quantum systems of interest. The work of this thesis focuses on reducing this gap by introducing two novel algorithms for quantum xiv chemistry simulations, which are suitable for near-term hardware. First, we intro- duce a hybrid algorithm to decrease the total number of operations required for the quantum simulations. We use a classical computer to generate an effective Hamilto- nian containing O(n2) terms compared to the O(n4) terms of the full Hamiltonian, where n is the number of orbitals. This sparse Hamiltonian can then be used with a high-level method to recover the ground state energies. We demonstrate that this sparsification of the Hamiltonian reduces the number of quantum operations required for the simulation by an order of magnitude, thus making it accessible for the near- term Hardware. Our second algorithm aims to make the calculation of dynamic correlation functions (Green’s functions) more feasible on these quantum machines. This algorithm is designed with the motive of avoiding the use of time-evolution and reduced use of two-qubit gates. We demonstrate that we can reproduce the Green’s function within reasonable error limits using this approach. We have also discussed the use of re-sampling techniques for proper error-propagation of the stochastic data obtained from the quantum machines. The general structure of this thesis is as follows. We begin by motivating this work in Chapter 1. Chapters 2 and 3 provide a general introduction of quantum computing and Green’s function based methods, respectively. In chapter 4, the development of effective Hamiltonian is discussed in detail. Chapter 5 demonstrates the use of these effective Hamiltonians on the quantum machine for time evolution. In chapter 6, we have discussed the algorithm to calculate Green’s functions on a quantum machine. This is followed by conclusions and future directions in Chapters 7 and 8, respectively.
Quantum computation is one of the most promising new paradigms for the simulation of physical systems composed of electrons and atomic nuclei, with applications in chemistry, solid-state physics, materials science, and molecular biology. This requires a truncated representation of the electronic structure Hamiltonian using a finite number of orbitals. While it is, in principle, obvious how to improve on the representation by including more orbitals, this is usually unfeasible in practice (e.g., because of the limited number of qubits available) and severely compromises the accuracy of the obtained results. Here, we propose a quantum algorithm that improves on the representation of the physical problem by virtue of second-order perturbation theory. In particular, our quantum algorithm evaluates the second-order energy correction through a series of time-evolution steps under the unperturbed Hamiltonian. An important application is to go beyond the active-space approximation, allowing to include corrections of virtual orbitals, known as multireference perturbation theory. Here, we exploit the fact that the unperturbed Hamiltonian is diagonal for virtual orbitals and show that the number of qubits is independent of the number of virtual orbitals. This gives rise to more accurate energy estimates without increasing the number of qubits. Moreover, we demonstrate numerically for realistic chemical systems that the total runtime has highly favorable scaling in the number of virtual orbitals compared to previous studies. Numerical calculations confirm the necessity of the multireference perturbation theory energy corrections to reach accurate ground-state energy estimates. Our perturbation theory quantum algorithm can also be applied to symmetry-adapted perturbation theory. As such, we demonstrate that perturbation theory can help to reduce the quantum hardware requirements for quantum chemistry. Published by the American Physical Society 2024
We propose an approximate mapping of a molecular Hamiltonian to a Hamiltonian of qubits, which allows for high accuracy quantum chemistry calculations of vertical excitation energies of some molecules. The mapping is based on separating of a very small active space of only two orbitals and on modeling the electronic excitations in the remaining orbitals by a set of qubits or, equivalently, by a set of oscillators. This approach is inspired by the Random Phase Approximation (RPA), in which the excitations of electron gas are described by bosonic degrees of freedom. As a result, the Hamiltonian of the molecule is reduced to that of a system-bath model. The "system" part of the Hamiltonian describes the two molecular orbitals -- the highest occupied molecular orbital (HOMO) and the lowest unoccupied molecular orbital (LUMO) -- which are populated by two electrons. Two qubits are sufficient to encode the Hamiltonian of such a system. The "bath" consists of oscillators or, equivalently, of two level systems with each of them corresponding to an electron excitation from a doubly occupied orbital below the Fermi level to an empty orbital above the Fermi level. We hope that this mapping can inspire new approaches and algorithms aimed at calculating excitation energies of molecules on near term quantum computers.
This paper explores the potential of Variational Quantum Eigensolvers (VQEs) for simulating classical dynamical systems. Traditional numerical methods for simulating dynamical systems often struggle with complex systems exhibiting sparse interactions or requiring high computational resources. We propose a novel algorithm that utilizes the optimization capabilities of VQEs to approximate the time evolution of these systems. The core idea is to map the system's state vector onto a qubit representation and then iteratively minimize the energy functional derived from the dynamical system's equations, effectively simulating the system's evolution. We specifically target systems with sparse interactions, where the optimization landscape is expected to be more amenable to VQE's strengths. This approach offers a potentially scalable solution for simulating dynamical systems on near-term quantum computers. This work demonstrates the feasibility of employing VQEs as a tool for tackling previously intractable problems in fields such as molecular dynamics, fluid dynamics, and chaos theory.