Abstract Digital quantum computers provide a computational framework for solving the Schrödinger equation for a variety of many‐particle systems. Quantum computing algorithms for the quantum simulation of these systems have recently witnessed remarkable growth, notwithstanding the limitations of existing quantum hardware, especially as a tool for electronic structure computations in molecules. In this review, we provide a self‐contained introduction to emerging algorithms for the simulation of Hamiltonian dynamics and eigenstates, with emphasis on their applications to the electronic structure in molecular systems. Theoretical foundations and implementation details of the method are discussed, and their strengths, limitations, and recent advances are presented. This article is categorized under: Quantum Computing > Algorithms Electronic Structure Theory > Ab Initio Electronic Structure Methods Quantum Computing > Theory Development
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
λ-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
λ-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
π), 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.
Computational quantum chemistry is a theoretical approach that utilizes the principles of quantum mechanics to perform computations on the electronic structure of molecules and atoms. This method enables the prediction of properties such as molecular structure, energy, electron orbitals, and electron density. In the field of the first principles, or ab initio, which relies solely on computation and not on experimental data, mathematical understanding allows even those without a background in chemistry to perform molecular orbital computations. The computation of quantum chemistry is computationally intensive, making them highly applicable in the field of high-performance computing. However, initiating quantum chemistry can be challenging for newcomers due to the numerous specialized terms and complex equations from quantum mechanics and chemistry. Therefore, this paper aims to provide a clear and accessible compilation of the fundamental and essential algorithm of the Hartree- Fock method, from theory to implementation. The goal is to offer the minimum required knowledge, in an approachable manner, serving as a starting point for those interested in computational quantum chemistry.
In the past two decades, myriad algorithms to elucidate the characteristics and dynamics of molecular systems have been developed for quantum computers. In this dissertation, we explore how these algorithms can be adapted to other fields, both to closely related subjects such as materials science, and more surprising subjects such as information theory. Special emphasis is placed on the Variational Quantum Eigensolver algorithm adapted to solve band structures of a periodic system; three distinct implementations are developed, each with its own advantages and disadvantages. We also see how unitary quantum circuits designed to model individual electron excitations within a molecule can be modified to prepare a quantum states strictly orthogonal to a space of known states, an important component to solve problems in thermodynamics and spectroscopy. Finally, we see how the core behavior in several quantum algorithms originally developed for quantum chemistry can be adapted to implement compressive sensing, a protocol in information theory for extrapolating large amounts of information from relatively few measurements. This body of work demonstrates that quantum algorithms developed to study molecules have immense interdisciplinary uses in fields as varied as materials science and information theory.
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.
Computer simulation is central to understanding the behaviour of matter. Yet, more than a century after the development of quantum theory, first-principles simulation of chemistry remains a daunting challenge, owing to the exponential growth in memory required to represent interacting quantum particles such as electrons in molecules. Quantum computing offers, in principle, a fundamentally more efficient paradigm for simulating quantum systems, with quantum chemistry often cited as a flagship application. However, many quantum algorithms face intrinsic limitations, and any genuine quantum advantage must surpass the strong baseline set by decades of progress in classical algorithms and hardware. While classical methods often suffice for simulating weakly correlated systems, systems with many strongly correlated electrons remain a challenge for both classical and quantum approaches. In this thesis, we develop quantum algorithms for solving the time-independent Schrödinger equation, with a focus on molecular systems with strongly correlated electrons. We introduce a framework for identifying a compact set of states that parametrise the many-body wavefunction by capturing the correlation due to spin coupling between localised electrons. This representation requires very few variational parameters but incurs a very high memory cost on classical computers. To overcome this, we design quantum circuits that efficiently prepare such states by exploiting their symmetry, encoding the dominant entanglement structure of electronic wavefunctions into the initial qubit states. Through theoretical analysis and classical simulations of quantum computers, we show that this substantially reduces the quantum resources required to accurately compute ground- and excitedstate properties. Finally, we develop an approach for approximating the optimal ansatz within the variational quantum eigensolver, an algorithm designed for near-term quantum devices. Our method constructs wavefunctions from products of symmetrypreserving unitary operators and couples discrete and continuous optimisation to yield highly compact representations of strongly correlated electrons using shallow quantum circuits. Together, these results establish complementary directions for embedding problemspecific structure into quantum simulation algorithms, advancing the practical simulation of strongly correlated electrons.