This paper establishes the applicability of density functional theory methods to quantum computing systems. We show that ground state and time-dependent density functional theory can be applied to quantum computing systems by proving the Hohenberg-Kohn and Runge-Gross theorems for a fermionic representation of an
N qubit system. As a first demonstration of this approach, time-dependent density functional theory is used to determine the minimum energy gap $\ensuremath{\Delta}(N)$ arising when the quantum adiabatic evolution algorithm is used to solve instances of the nondeterministic-polynomial-complete problem MAXCUT. It is known that the computational efficiency of this algorithm is largely determined by the large-
N scaling behavior of $\ensuremath{\Delta}(N)$, and so determining this behavior is of fundamental significance. As density functional theory has been used to study quantum systems with $N\ensuremath{\sim}{10}^{3}$ interacting degrees of freedom, the approach introduced in this paper raises the realistic prospect of evaluating the gap $\ensuremath{\Delta}(N)$ for systems with $N\ensuremath{\sim}{10}^{3}$ qubits. Although the calculation of $\ensuremath{\Delta}(N)$ serves to illustrate how density functional theory methods can be applied to problems in quantum computing, the approach has a much broader range and shows promise as a means for determining the properties of very large quantum computing systems.
Accurate descriptions of the electronic properties of molecules, solids and other materials are crucial in the development of many modern technologies, and are therefore the subject of much scientific research. In tandem with experimental research, computational simulations play a huge role. Density functional theory (DFT) is the most popular method for performing ground-state electronic structure calculations due to its accuracy in many situations along with its computational efficiency. Its time-dependent extension (TDDFT) allows the modelling of the dynamics of systems of interacting electrons. (TD)DFT is an exact theory in principle, but requires approximations in practice, specifically to the many-body effects of electron exchange and correlation (xc), which are described by some unknown universal functional. Despite much success, it often proves inadequate in many scenarios of increasing interest. Therefore, we aim to contribute to the development of improved approximate density functionals. \n \nIn this thesis, we take the approach of studying small model systems for which we can compute the exact functionals. These systems are designed to exhibit the key features present in realistic quantum systems, such as atoms and molecules, which the exact universal (TD)DFT functional is capable of describing, but are often ill-described by the commonly used approximations. By analysing the nature of these exact functionals, we gain valuable insight into their fundamental properties, together with identifying where the current approximations are lacking, thereby allowing us to suggest how these approximations may be improved.
Density-functional theory (DFT) is shown to provide a conceptual and computational framework for entanglement in interacting many-body quantum systems. DFT can, in particular, shed light on the intriguing relationship between quantum phase transitions and entanglement. We use DFT concepts to express entanglement measures in terms of the first or second derivative of the ground-state energy. We illustrate the versatility of the DFT approach via a variety of analytically solvable models. As a further application we discuss entanglement and quantum phase transitions in the case of mean-field approximations for realistic models of many-body systems.
While quantum computers have shown significant promise for electronic structure calculations, their potential to accelerate density functional theory (DFT) calculations remains unclear. In this work, we present a qubit-efficient encoding scheme for wavefunctions in Kohn--Sham (KS) DFT, together with a quantum algorithm that computes all occupied orbitals simultaneously. We further show that our algorithm is particularly well suited to the Harris functional, enabling the total energy to be evaluated with a potential exponential speedup over classical approaches by entirely avoiding the costly readout of the electronic density. In addition, we propose a second method for achieving self-consistent DFT calculations using multiple copies of the wavefunction, which likewise circumvents density readout. The applicability of our algorithms is demonstrated through several numerical examples, and their efficiency is compared with that of existing approaches.
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.
Quantum computers open up new avenues for modelling the physical properties of materials and molecules. Density Functional Theory (DFT) is the gold standard classical algorithm for predicting these properties, but relies on approximations of the unknown universal functional, limiting its general applicability for many fundamental and technologically relevant systems. In this work we develop a hybrid quantum/classical algorithm called quantum enhanced DFT (QEDFT) that systematically constructs quantum approximations of the universal functional using data obtained from a quantum computer. We benchmark the QEDFT algorithm on the Fermi-Hubbard model, both numerically and on data from experiments on real quantum hardware. We find that QEDFT surpasses the quality of groundstate results obtained from Hartree-Fock DFT, as well as from direct application of conventional quantum algorithms such as VQE. Furthermore, we demonstrate that QEDFT works even when only noisy, low-depth quantum computation is available, by benchmarking the algorithm on data obtained from Google's quantum computer. We further show how QEDFT also captures quintessential properties of strongly correlated Mott physics for large Fermi-Hubbard systems using functionals generated on much smaller system sizes. Our results indicate that QEDFT can be applied to realistic materials and molecular systems, and has the potential to outperform the direct application of either DFT or VQE alone, without the requirement of large scale or fully fault-tolerant quantum computers.