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.
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.
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.
One of the first practical applications of quantum computers is expected to be molecular modelling. Performing this task would profoundly affect areas such as chemistry, materials science and drug synthesis. Modelling of molecules, which are classically intractable, can be achieved with just over 30 qubits, whereas state of the art quantum computers already have more than 50 qubits. The Variational Quantum Eigensolver (VQE) algorithm and VQE based protocols, are promising candidates to enable this task on emerging Noisy Intermediate-Scale Quantum (NISQ) computers. These protocols require short quantum circuits and short coherence times, and are particularly resilient to quantum errors. Nevertheless, there is still a significant gap between the accuracy and the coherence times of current NISQ computers, and the hardware requirements of VQE protocols to simulate practically interesting molecules. In this thesis, I present my contribution to narrowing this gap by developing VQE protocols for molecular modelling that are less demanding on quantum hardware. The VQE relies on the Rayleigh-Ritz variational principle to estimate the eigenvalues of a Hamiltonian operator, by minimizing its expectation value with respect to a trial quantum state, prepared by an ansatz. A major challenge for the practical realisation of VQE protocols on NISQ computers is to construct an ansatz that: (1) can accurately approximate the eigenstates of the Hamiltonian; (2) is easy to optimize; and (3) can be implemented by a shallow circuit, within the capabilities of a NISQ computer. The most widely used, unitary coupled cluster (UCC), type of ans\"atze mathematically correspond to a product of unitary evolutions of fermionic excitation operators. Owing to their fermionic structure, UCC ans\"atze preserve the symmetries of electronic wavefunctions, and thus are accurate and easy to optimize. Nevertheless, UCC ans\"atze are implemented by high depth circuits, which severely limit the size of the molecules that can be reliably simulated on NISQ computers. In this thesis, I begin by constructing efficient quantum circuits to perform evolutions of fermionic excitation operators. The circuits are optimized in the number of two-qubit entangling gates, which are the current bottleneck of NISQ computers. Compared to the standard circuits used to implement evolutions of fermionic excitation operators, the circuits derived in this thesis reduce the number of two-qubit entangling gates by more than 70% on average. As an intermediate result, I also derive efficient circuits to perform evolutions of qubit excitation operators (excitation operators that account for qubit, rather than fermionic commutation relations). Even with the fermionic-excitation-evolution circuits derived here, UCC ans\"atze still require very long circuits, with a particularly large number of two-qubit entangling gates. In this thesis, I consider the use of alternative VQE ans\"atze, based on evolutions of qubit excitation operators. Due to not accounting for fermionic anticommutation, evolutions of qubit excitation operators can be performed by circuits that require asymptotically fewer two-qubit entangling gates. Furthermore, qubit excitation operators preserve many of the physical properties of fermionic excitation operators. Performing a number of classical numerical VQE simulations for small molecules, I show that qubit-excitation-based ans\"atze can approximate molecular electronic wavefunctions almost as accurately as fermionic-excitation-based ans\"atze. Hence, I argue that evolutions of qubit excitation operators are more suitable to construct molecular ans\"atze than evolutions of fermionic excitation operators, especially in the era of NISQ computers. Motivated by the advantage of qubit-excitation-based ans\"atze, I introduce the qubit-excitation-based adaptive variational quantum eigensolver (QEB-ADAPT-VQE). The QEB-ADAPT-VQE belongs to a family of ADAPT-VQE protocols for molecular modelling that grow a problem-tailored ansatz by iteratively appending unitary operators sampled from a predefined finite-size pool of operators. The operator at each iteration is sampled based on an ansatz-growing strategy, which aims to achieve the lowest estimate for the Hamiltonian expectation value at each iteration. In this way, ADAPT-VQE protocols construct shallow-circuit, few-parameter ans\"atze tailored specifically to the molecular systems of interest. In the case of the QEB-ADAPT-VQE, the operator pool is defined by a set of evolutions of single and double qubit excitation operators. I benchmark the performance of the QEB-ADAPT-VQE, by performing classical numerical simulations. I demonstrate that it can construct ans\"atze that are several orders of magnitude more accurate, and require significantly shallower circuits, than standard UCC ans\"atze. I also compare the QEB-ADAPT-VQE against the original fermionic-ADAPT-VQE, which utilizes a pool of fermionic excitation evolutions, and the qubit-ADAPT-VQE, which utilizes a pool of Pauli-string evolutions. I demonstrate that, in terms of circuit efficiency and convergence speed, the QEB-ADAPT-VQE systematically outperforms the qubit-ADAPT-VQE, which to my knowledge was the previous most circuit-efficient, scalable VQE protocol for molecular modeling. The QEB-ADAPT-VQE protocol, therefore represents a significant improvement in the field of VQE protocols for molecular modelling and brings us closer to achieving practical quantum advantage. Lastly, I outline a modified version of the QEB-ADAPT-VQE, the excited-QEB-ADAPT-VQE, designed to estimate energies of excited molecular states. The excited-QEB-ADAPT-VQE is more robust to initial simulation conditions, at the expense of increased computational complexity.
The performance of quantum algorithms for eigenvalue problems, such as computing Hamiltonian spectra, depends strongly on the overlap of the initial wave function and the target eigenvector. In a basis of Slater determinants, the representation of energy eigenstates of systems with N strongly correlated electrons requires a number of determinants that scales exponentially with N . On classical processors, this restricts simulations to systems where N is small. Here, we show that quantum computers can efficiently simulate strongly correlated molecular systems by directly encoding the dominant entanglement structure in the form of spin-coupled initial states. This avoids resorting to expensive classical or quantum state preparation heuristics and instead exploits symmetries in the wave function. We provide quantum circuits for deterministic preparation of a family of spin eigenfunctions with ( N N / 2 ) Slater determinants with depth O ( N ) and O ( N 2 ) local gates. Their use as highly entangled initial states in quantum algorithms reduces the total runtime of quantum phase estimation and related fault-tolerant methods by orders of magnitude. Furthermore, we assess the application of spin-coupled wave functions as initial states for a range of heuristic quantum algorithms, namely, the variational quantum eigensolver, adiabatic state preparation, and different versions of quantum subspace diagonalization (QSD) including QSD based on real-time-evolved states. We also propose a QSD algorithm that exploits states obtained through adaptive quantum eigensolvers. For all algorithms, we demonstrate that using spin-coupled initial states drastically reduces the quantum resources required to simulate strongly correlated ground and excited states. Our work provides a crucial component for enabling scalable quantum simulation of classically challenging electronic systems.
Accurate prediction of molecular structures and properties is vital for chemistry; materials science, and drug discovery, yet classical electronic-structure methods often fail for strongly correlated systems, large basis sets, and complex potential-energy landscapes. Quantum technology encompassing quantum computing, quantum machine learning, and hybrid quantum classical strategies offers a fundamentally new paradigm by encoding many-electron wave functions directly on qubits and exploiting superposition and entanglement to explore exponentially large Hilbert spaces. This review synthesizes recent algorithmic and hardware advances relevant to molecular modelling, including the Variational Quantum Eigensolver (VQE), Quantum Phase Estimation (QPE), quantum unitary coupled-cluster (q-UCC) families, equation-of-motion and subspace methods for excited states, tensor-network hybrids, and quantum kernel and variational QML approaches. We examine noise-aware hybrid workflows, error-mitigation techniques, symmetry-preserving ansätze, and operator-factorization methods that reduce measurement and gate overhead. Representative applications are discussed: ground- and excited-state energy prediction, potential-energy surface mapping, geometry and transition-state optimization, spectroscopic property estimation (IR, UV–Vis, NMR, EPR), and reaction-dynamics scenarios where non-adiabatic effects and conical intersections dominate. Resource estimates and scaling analyses clarify current NISQ limitations qubit counts, circuit depth, shot complexity and delineate the roadmap to fault-tolerant QPE for chemical accuracy. We compare quantum approaches with classical baselines (DFT, CCSD (T), multireference methods), identifying domains where quantum methods already show promise (strong correlation, multi-reference dissociation, spin-state ordering) and where classical methods remain competitive. Finally, we highlight near-term industrial opportunities in drug design, catalysis, CO2 capture, and energy materials, and outline critical research directions: algorithmic reductions in measurement/precision cost, hardware improvements in fidelity and connectivity, scalable ansatz design, and integrated software stacks for reproducible hybrid simulations. Together, these developments indicate that while practical, large-scale quantum advantage for general chemistry remains future work, quantum technologies are rapidly maturing into powerful tools for targeted molecular problems that are intractable with existing classical techniques.
Abstract Quantum computers promise to revolutionise molecular electronic simulations by overcoming the exponential memory scaling. While electronic wave functions can be represented using a product of fermionic unitary operators, the best ansatz for strongly correlated electronic systems is far from clear. In this contribution, we construct universal wave functions from gate-efficient, spin symmetry-preserving fermionic operators by introducing an algorithm that globally optimises the wave function in the discrete ansatz design and continuous parameter spaces. Our approach maximises the accuracy that can be obtained with near-term quantum circuits and provides a practical route for designing ansätze in the future. Numerical simulations for strongly correlated molecules, including water and molecular nitrogen, and the condensed-matter Hubbard model, demonstrate the improved accuracy of gate-efficient quantum circuits for simulating strongly correlated chemistry.
The study of quantum many-body systems is crucial to our understanding of nature at the microscopic scale. As analytical solutions quickly become intractable, the development of efficient computational simulation techniques is indispensable to predict the behaviour of quantum systems. This task is particularly challenging as the dimension of the underlying Hilbert space grows exponentially with the system size. While classical computational methods have achieved remarkable success in specific regimes, their applicability is fundamentally limited by this exponential scaling. Quantum computers offer a natural platform for representing and simulating quantum systems, but current devices are constrained by noise and limited qubit counts, drastically restricting the algorithms that can be run. In this context, hybrid quantum-classical algorithms provide a promising approach to combine the strengths of both paradigms. This thesis develops hybrid quantum-classical algorithms for the simulation of quantum many-body systems. The key idea is to perform classically difficult tasks on near-term quantum devices, while leveraging classical computational power to control, correct, and extend the obtained results. Within this framework, we introduce two complementary approaches for the simulation of quantum dynamics. The first method employs circuit knitting techniques to distribute variational quantum simulations across multiple quantum devices. The entanglement between weakly coupled clusters of highly correlated spins is recovered in classical post-processing, where the overhead is controlled through a constrained optimisation problem. The second method combines a simplified, Trotterised quantum dynamics simulation with a parametrised classical ansatz trained to correct for the approximations made on the quantum device. We show that this method can be employed to correct Trotter errors, implement long-range gates with hardware-efficient circuits, or simulate larger systems by incorporating additional degrees of freedom purely classically. In addition, we present a hybrid approach to computing thermal properties of quantum many-body systems via the Quantum Finite Temperature Lanczos Method. A Krylov subspace is generated on a quantum computer by combining the efficient preparation of typical states with real-time evolution. A classical computer then diagonalises the system in the low-dimensional subspace and estimates the finite-temperature expectation values through trace estimation. The results presented in this thesis demonstrate that hybrid quantum-classical algorithms can expand the range of systems that can be studied on near-term quantum devices. Conversely, we show that incorporating quantum subroutines into classical simulation techniques can improve their efficiency. These results suggest that, rather than treating classical and quantum simulation as competing paradigms, their careful integration can provide a more effective route toward practical quantum many-body simulation.