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

Pure and Applied Chemistry

Quantum chemistry – from the first steps to linear-scaling electronic structure methods

Daniel Gräf, Viktoria Drontschenko, Alexandra Stan-Bernhardt, Christian Ochsenfeld

Published Nov 1, 2025• 3 citations
Publisher

Abstract

We first give a brief, incomplete overview over historic milestones leading to the emergence of quantum chemistry, starting from John Dalton's earliest attempts to describe the atom in the early 19th century. After the formulation of the Schrödinger equation in 1926 and the first successful description of covalent bonding using the new theory, it became soon clear that the main challenge ahead was to find efficient approximations to the Schrödinger equation, as was famously stated by Paul A. M. Dirac in 1929. Since then, many quantum-chemical approximations have been introduced, with a key problem being the exponential increase of the computational cost with the system size when approaching the exact solution of the Schrödinger equation. In the second part, we will hence focus on selected techniques to overcome the scaling problem. Finally, we close with some insights into the new and challenging field of reaction network exploration, offering a glimpse into potential future directions of quantum chemistry.

DOI
10.1515/pac-2025-0603

Related papers

Accelerating Quantum Chemistry through Compressed Hamiltonian Representation and Efficient Quantum Analytic Energy Gradient Algorithms

Oumarou Oumarou

In ab-initio quantum chemistry, solving the electronic structure problem of a molecular system of interest to obtain an approximation of the ground and, in some cases, the excited state energies is a core and central task in various quantum chemistry processes. These include, but certainly not limited to, the calculation of the activation energy–that is the minimal energy required to launch a given chemical reaction–, the dipole and multipole moments which describe the polarity of the molecule, performing the optimization of the geometry of the molecule and searching for transition states. Furthermore, many quantum chemistry applications are predicated, not merely on the approximation of the ground state energy, but also on the corresponding first order derivatives. The body of literature of classical algorithms approximating the ground state energy and its first order derivative is extensively rich with a plethora of methods such as self-consistent mean-field methods, coupled-cluster methods, density matrix renormalization group and many more, each of which has intrinsic set of properties and characteristics that makes it suitable for specific tasks and cases. However, classical methods face a practically insurmountable challenge: the efficient computation of high accuracy approximation of ground state energies of large system sizes. This is fundamentally because the electronic structure problem provably belongs to the complexity class of QMA-hard problems. Which also means that it is out of reach for quantum algorithms as well in general. However, with certain assumptions that are expected to hold molecules of interest–that so far proved to be classically challenging because the required accuracy set by the standard of chemical accuracy threshold (generally held in quantum chemistry)– quantum algorithms can efficiently treat such cases. While originally theorized by Richard Feynmann as a potentially efficient way of simulating some classically intractable many-body systems, quantum computing has since proven to have a stronger and richer potential paving the way for the inception of new algorithms such as Shor’s algorithm for integer factorization, HHL for solving linear system of equation and Grover’s algorithm for constrained binary search, just to name a few. These algorithms provably exhibit an improvement rate that goes respectively exponentially and quadratically in the time complexity. Quantum chemistry is considered a prominent candidate to benefit from quantum computing given the variety of quantum algorithms put forth to solve the electronic structure problem of particular systems of interest. These quantum algorithm proposals can be broadly categorized in three main categories that span the spectrum: from noisy intermediate scale quantum (NISQ) computers to early and full scale fault tolerant quantum ((E)FTQC) computers. Firstly, the variational quantum eigensolver (VQE) family of quantum algorithms which variationally search for the ground state energy through the optimization of the energy of a parametrized state prepared in a quantum computer using an ansatz. Secondly, the quantum Krylov subspace diagonalization (QKSD) methods, which generate a subspace of the original Hilbert space and efficiently produce the lowest energy in said subspace as its output. Lastly, we have the quantum phase estimation (QPE) algorithms, which provably produce the ground state energy in Heisenberg scaling presenting hence a provable efficient solution. In this thesis, we firstly set to work on the problem of efficient Hamiltonian linear combination of unitaries (LCU) representation. This is mainly motivated by the wide-range impact an efficient compression of the Hamiltonian can potentially have on several quantum algorithms such as VQE, QPE...etc. We designed a method that efficiently compress the Hamiltonian representation in a way that is beneficially impactful across the set of the aforementioned quantum algorithms. Namely, we motivate and present in Sections 1.3 and 1.4 respectively, the regularized compressed double-factorization (RC-DF) and show how it reduces the energy measurement complexity both in terms of number of distinct observables and number of samples. Moreover, it also reduces the total depth of the quantum phase estimation circuit thanks to its low normalization factor. Secondly, given the importance of the energy derivatives, in Sections 2.1 and 2.2, we introduce and present an efficient quantum algorithm for the calculation of the analytic gradient of VQE energies of double-factorized Hamiltonians. Furthermore, in Section 2.1, we expand on the utility of RC-DF by presenting a quantum algorithm that determines the analytic gradient of energies measured with respect to RC-DF Hamiltonains. Third, in Section 3.1, we summarize the theoretical results of purification error-mitigation techniques, namely echo verification and virtual distillation. In Section 3.2, we report on the results of the experimental bench mark, of said techniques, performed on on Google’s Sycamore device to validate the theoretical scaling of error suppression and extrapolate the resources needed for classically intractable system sizes. Fourth, in Section 4 we establish the challenges of computing energy gradients in a quantum Krylov frame work. To overcome the problem, we provide, in Section 4.3, an efficient quantum algorithm for calculating energy derivative obtained through QKSD procedures. Our approach shows how the QKSD ground state can be prepared using quantum signal processing (QSP) and reduces the number of observables to O(1) per reduced density matrix (RDM). Lastly, in light of the importance of quantum RAMs due to their utility in a variety of quantum algorithms that require efficient initial state preparation, as explained in Section 5.5, we address the problematic exponential depth of the bucket-brigade QRAM (when decomposed). We present in Section 5.6 a very efficient Clifford+T decomposition of the bucket-brigade QRAM, which preserves the linear scaling of the depth of the circuit without introducing any additional ancilla.

•Aug 8, 2026•0 citations

Quantum Computing Beyond Ground-State Electronic Structure: A Review of Progress Toward Quantum Chemistry Out of the Ground State

Alan Bidart, Prateek Vaish, Tilas Kabengele +3 more

Quantum computing offers the promise of revolutionizing quantum chemistry by enabling the solution of chemical problems for substantially less computational cost. While most demonstrations of quantum computation to date have focused on resolving the energies of the electronic ground states of small molecules, the field of quantum chemistry is far broader than ground-state chemistry; equally important to practicing chemists are chemical reaction dynamics and reaction mechanism prediction. Here, we review progress toward and the potential of quantum computation for understanding quantum chemistry beyond the ground state, including for reaction mechanisms, reaction dynamics, and finite-temperature quantum chemistry. We discuss algorithmic and other considerations these applications share, as well as differences that make them unique. We also highlight the potential speedups these applications may realize and challenges they may face. We hope that this discussion stimulates further research into how quantum computation may better inform experimental chemistry in the future.

arXiv:2509.19709•Annual Review of Physical Chemistry•Feb 27, 2026•7 citations

Quantum Chemistry: An Introduction

Michael Springborg, Meijuan Zhou

This textbook introduces the reader to quantum theory and quantum chemistry. The textbook is meant for 2 nd – 3 rd year bachelor students of chemistry or physics, but also for students of related disciplines like materials science, pharmacy, and bioinformatics. At first, quantum theory is introduced, starting with experimental results that made it inevitable to go beyond classical physics. Subsequently, the Schrödinger equation is discussed in some detail. Some few examples for which the Schrödinger equation can be solved exactly are treated with special emphasis on relating the results to real systems and interpreting the mathematical results in terms of experimental observations. Ultimately, approximate methods are presented that are used when applying quantum theory in the field of quantum chemistry for the study of real systems like atoms, molecules, and crystals. Both the foundations for the different methods and a broader range of examples of their applications are presented. The textbook assumes no prior knowledge in quantum theory. Moreover, special emphasis is put on interpreting the mathematical results and less on an exact mathematical derivations of those. Finally, each chapter closes with a number of questions and exercises that help in focusing on the main results of the chapter. Many of the exercises include answers.

De Gruyter eBooks•Aug 23, 2021•0 citations

Quantum Theory and Quantum Chemistry: Past, Present and Future

Zhigang Shuai

Abstract Chemistry is about the atom and molecule, motion of which follows quantum mechanics established 100 years ago by Werner Heisenberg, inspired by a number of milestone findings including Max Planck’s first quanta concept for black body radiation, Albert Einstein’s photon concept for photoelectric effect and oscillator quanta for heat capacity of solid, and Niels Bohr’s quantum model for atomic structure. Independently, inspired by Louis de Broglie’s particle-wave duality, Erwin Schrödinger established wave mechanics, which is shown to be equivalent to Heisenberg’s mechanics by Paul Dirac. The latter further established the relativistic quantum mechanics, and then claimed that the underlying physical laws necessary for the mathematical theory of a large part of physics and the whole of chemistry are thus completely known, and the difficulty is only that the exact application of these laws lead to equations much too complicated to be soluble. In the occasion of celebrating The International Year of Quantum Science and Technology (IYQ 2025, quantum2025.org), we will present a heuristic review of the development of quantum theory and its application to chemistry, namely, quantum chemistry (QC). Then, we will discuss some of the current challenges and the future developments, especially on the quantum computing for quantum chemistry (QCQC).

Chemistry International•Jul 1, 2025•0 citations

Quantum chemistry simulation on quantum computers: theories and experiments

Dawei Lu, Boruo Xu, Nanyang Xu +5 more

It has been claimed that quantum computers can mimic quantum systems efficiently in the polynomial scale. Traditionally, those simulations are carried out numerically on classical computers, which are inevitably confronted with the exponential growth of required resources, with the increasing size of quantum systems. Quantum computers avoid this problem, and thus provide a possible solution for large quantum systems. In this paper, we first discuss the ideas of quantum simulation, the background of quantum simulators, their categories, and the development in both theories and experiments. We then present a brief introduction to quantum chemistry evaluated via classical computers followed by typical procedures of quantum simulation towards quantum chemistry. Reviewed are not only theoretical proposals but also proof-of-principle experimental implementations, via a small quantum computer, which include the evaluation of the static molecular eigenenergy and the simulation of chemical reaction dynamics. Although the experimental development is still behind the theory, we give prospects and suggestions for future experiments. We anticipate that in the near future quantum simulation will become a powerful tool for quantum chemistry over classical computations.

Physical Chemistry Chemical Physics•Jan 1, 2012•43 citations

Quantum Chemistry

Kolla Bhanu Prakash

The simulation of quantum chemical systems is widely regarded as the "killer app" for quantum computing.While classical computers have made tremendous strides in computational chemistry-earning the 1998 Nobel Prize for Density Functional Theory (DFT)-they face a fundamental wall: the "Exponential Catastrophe." The Hilbert space of a quantum many-body system scales exponentially with the number of particles.For a system of orbitals, the dimension is 1.To store the wavefunction of a molecule with just 50 electrons exactly would require more classical bits than there are atoms in the Milky Way [121].Quantum computers bypass this limit by mapping the quantum system of electrons directly onto the quantum system of qubits.This chapter provides a definitive guide to this field, moving from the foundational Schrödinger equation to the cutting-edge of Variational Quantum Eigensolvers (VQE) and beyond [191]. Theoretical Foundations of Electronic StructureTo program a quantum computer for chemistry, one must first understand the physics we are trying to simulate.The central problem is finding the stationary states of the Schrödinger equation [122]. The Many-Body HamiltonianThe non-relativistic, time-independent Schrödinger equation is given by:Here, Ĥ is the Hamiltonian operator representing the total energy of the molecular system.

Wiley eBooks•Aug 17, 2026•0 citations
We first give a brief, incomplete overview over historic milestones leading to the emergence of quantum chemistry, starting from John Dalton's earliest attempts to describe the atom in the early 19th century. After the formulation of the Schrödinger equation in 1926 and the first successful description of covalent bonding using the new theory, it became soon clear that the main challenge ahead was to find efficient approximations to the Schrödinger equation, as was famously stated by Paul A. M. Dirac in 1929. Since then, many quantum-chemical approximations have been introduced, with a key problem being the exponential increase of the computational cost with the system size when approaching the exact solution of the Schrödinger equation. In the second part, we will hence focus on selected techniques to overcome the scaling problem. Finally, we close with some insights into the new and challenging field of reaction network exploration, offering a glimpse into potential future directions of quantum chemistry.
In ab-initio quantum chemistry, solving the electronic structure problem of a molecular system of interest to obtain an approximation of the ground and, in some cases, the excited state energies is a core and central task in various quantum chemistry processes. These include, but certainly not limited to, the calculation of the activation energy–that is the minimal energy required to launch a given chemical reaction–, the dipole and multipole moments which describe the polarity of the molecule, performing the optimization of the geometry of the molecule and searching for transition states. Furthermore, many quantum chemistry applications are predicated, not merely on the approximation of the ground state energy, but also on the corresponding first order derivatives. The body of literature of classical algorithms approximating the ground state energy and its first order derivative is extensively rich with a plethora of methods such as self-consistent mean-field methods, coupled-cluster methods, density matrix renormalization group and many more, each of which has intrinsic set of properties and characteristics that makes it suitable for specific tasks and cases. However, classical methods face a practically insurmountable challenge: the efficient computation of high accuracy approximation of ground state energies of large system sizes. This is fundamentally because the electronic structure problem provably belongs to the complexity class of QMA-hard problems. Which also means that it is out of reach for quantum algorithms as well in general. However, with certain assumptions that are expected to hold molecules of interest–that so far proved to be classically challenging because the required accuracy set by the standard of chemical accuracy threshold (generally held in quantum chemistry)– quantum algorithms can efficiently treat such cases. While originally theorized by Richard Feynmann as a potentially efficient way of simulating some classically intractable many-body systems, quantum computing has since proven to have a stronger and richer potential paving the way for the inception of new algorithms such as Shor’s algorithm for integer factorization, HHL for solving linear system of equation and Grover’s algorithm for constrained binary search, just to name a few. These algorithms provably exhibit an improvement rate that goes respectively exponentially and quadratically in the time complexity. Quantum chemistry is considered a prominent candidate to benefit from quantum computing given the variety of quantum algorithms put forth to solve the electronic structure problem of particular systems of interest. These quantum algorithm proposals can be broadly categorized in three main categories that span the spectrum: from noisy intermediate scale quantum (NISQ) computers to early and full scale fault tolerant quantum ((E)FTQC) computers. Firstly, the variational quantum eigensolver (VQE) family of quantum algorithms which variationally search for the ground state energy through the optimization of the energy of a parametrized state prepared in a quantum computer using an ansatz. Secondly, the quantum Krylov subspace diagonalization (QKSD) methods, which generate a subspace of the original Hilbert space and efficiently produce the lowest energy in said subspace as its output. Lastly, we have the quantum phase estimation (QPE) algorithms, which provably produce the ground state energy in Heisenberg scaling presenting hence a provable efficient solution. In this thesis, we firstly set to work on the problem of efficient Hamiltonian linear combination of unitaries (LCU) representation. This is mainly motivated by the wide-range impact an efficient compression of the Hamiltonian can potentially have on several quantum algorithms such as VQE, QPE...etc. We designed a method that efficiently compress the Hamiltonian representation in a way that is beneficially impactful across the set of the aforementioned quantum algorithms. Namely, we motivate and present in Sections 1.3 and 1.4 respectively, the regularized compressed double-factorization (RC-DF) and show how it reduces the energy measurement complexity both in terms of number of distinct observables and number of samples. Moreover, it also reduces the total depth of the quantum phase estimation circuit thanks to its low normalization factor. Secondly, given the importance of the energy derivatives, in Sections 2.1 and 2.2, we introduce and present an efficient quantum algorithm for the calculation of the analytic gradient of VQE energies of double-factorized Hamiltonians. Furthermore, in Section 2.1, we expand on the utility of RC-DF by presenting a quantum algorithm that determines the analytic gradient of energies measured with respect to RC-DF Hamiltonains. Third, in Section 3.1, we summarize the theoretical results of purification error-mitigation techniques, namely echo verification and virtual distillation. In Section 3.2, we report on the results of the experimental bench mark, of said techniques, performed on on Google’s Sycamore device to validate the theoretical scaling of error suppression and extrapolate the resources needed for classically intractable system sizes. Fourth, in Section 4 we establish the challenges of computing energy gradients in a quantum Krylov frame work. To overcome the problem, we provide, in Section 4.3, an efficient quantum algorithm for calculating energy derivative obtained through QKSD procedures. Our approach shows how the QKSD ground state can be prepared using quantum signal processing (QSP) and reduces the number of observables to O(1) per reduced density matrix (RDM). Lastly, in light of the importance of quantum RAMs due to their utility in a variety of quantum algorithms that require efficient initial state preparation, as explained in Section 5.5, we address the problematic exponential depth of the bucket-brigade QRAM (when decomposed). We present in Section 5.6 a very efficient Clifford+T decomposition of the bucket-brigade QRAM, which preserves the linear scaling of the depth of the circuit without introducing any additional ancilla.
Quantum computing offers the promise of revolutionizing quantum chemistry by enabling the solution of chemical problems for substantially less computational cost. While most demonstrations of quantum computation to date have focused on resolving the energies of the electronic ground states of small molecules, the field of quantum chemistry is far broader than ground-state chemistry; equally important to practicing chemists are chemical reaction dynamics and reaction mechanism prediction. Here, we review progress toward and the potential of quantum computation for understanding quantum chemistry beyond the ground state, including for reaction mechanisms, reaction dynamics, and finite-temperature quantum chemistry. We discuss algorithmic and other considerations these applications share, as well as differences that make them unique. We also highlight the potential speedups these applications may realize and challenges they may face. We hope that this discussion stimulates further research into how quantum computation may better inform experimental chemistry in the future.
This textbook introduces the reader to quantum theory and quantum chemistry. The textbook is meant for 2 nd – 3 rd year bachelor students of chemistry or physics, but also for students of related disciplines like materials science, pharmacy, and bioinformatics. At first, quantum theory is introduced, starting with experimental results that made it inevitable to go beyond classical physics. Subsequently, the Schrödinger equation is discussed in some detail. Some few examples for which the Schrödinger equation can be solved exactly are treated with special emphasis on relating the results to real systems and interpreting the mathematical results in terms of experimental observations. Ultimately, approximate methods are presented that are used when applying quantum theory in the field of quantum chemistry for the study of real systems like atoms, molecules, and crystals. Both the foundations for the different methods and a broader range of examples of their applications are presented. The textbook assumes no prior knowledge in quantum theory. Moreover, special emphasis is put on interpreting the mathematical results and less on an exact mathematical derivations of those. Finally, each chapter closes with a number of questions and exercises that help in focusing on the main results of the chapter. Many of the exercises include answers.
Abstract Chemistry is about the atom and molecule, motion of which follows quantum mechanics established 100 years ago by Werner Heisenberg, inspired by a number of milestone findings including Max Planck’s first quanta concept for black body radiation, Albert Einstein’s photon concept for photoelectric effect and oscillator quanta for heat capacity of solid, and Niels Bohr’s quantum model for atomic structure. Independently, inspired by Louis de Broglie’s particle-wave duality, Erwin Schrödinger established wave mechanics, which is shown to be equivalent to Heisenberg’s mechanics by Paul Dirac. The latter further established the relativistic quantum mechanics, and then claimed that the underlying physical laws necessary for the mathematical theory of a large part of physics and the whole of chemistry are thus completely known, and the difficulty is only that the exact application of these laws lead to equations much too complicated to be soluble. In the occasion of celebrating The International Year of Quantum Science and Technology (IYQ 2025, quantum2025.org), we will present a heuristic review of the development of quantum theory and its application to chemistry, namely, quantum chemistry (QC). Then, we will discuss some of the current challenges and the future developments, especially on the quantum computing for quantum chemistry (QCQC).
It has been claimed that quantum computers can mimic quantum systems efficiently in the polynomial scale. Traditionally, those simulations are carried out numerically on classical computers, which are inevitably confronted with the exponential growth of required resources, with the increasing size of quantum systems. Quantum computers avoid this problem, and thus provide a possible solution for large quantum systems. In this paper, we first discuss the ideas of quantum simulation, the background of quantum simulators, their categories, and the development in both theories and experiments. We then present a brief introduction to quantum chemistry evaluated via classical computers followed by typical procedures of quantum simulation towards quantum chemistry. Reviewed are not only theoretical proposals but also proof-of-principle experimental implementations, via a small quantum computer, which include the evaluation of the static molecular eigenenergy and the simulation of chemical reaction dynamics. Although the experimental development is still behind the theory, we give prospects and suggestions for future experiments. We anticipate that in the near future quantum simulation will become a powerful tool for quantum chemistry over classical computations.
The simulation of quantum chemical systems is widely regarded as the "killer app" for quantum computing.While classical computers have made tremendous strides in computational chemistry-earning the 1998 Nobel Prize for Density Functional Theory (DFT)-they face a fundamental wall: the "Exponential Catastrophe." The Hilbert space of a quantum many-body system scales exponentially with the number of particles.For a system of orbitals, the dimension is 1.To store the wavefunction of a molecule with just 50 electrons exactly would require more classical bits than there are atoms in the Milky Way [121].Quantum computers bypass this limit by mapping the quantum system of electrons directly onto the quantum system of qubits.This chapter provides a definitive guide to this field, moving from the foundational Schrödinger equation to the cutting-edge of Variational Quantum Eigensolvers (VQE) and beyond [191]. Theoretical Foundations of Electronic StructureTo program a quantum computer for chemistry, one must first understand the physics we are trying to simulate.The central problem is finding the stationary states of the Schrödinger equation [122]. The Many-Body HamiltonianThe non-relativistic, time-independent Schrödinger equation is given by:Here, Ĥ is the Hamiltonian operator representing the total energy of the molecular system.