While sufficiently large and accurate quantum computers are expected to exploit quantum effects such as superposition and entanglement to gain an advantage over their classical counterparts for specific problems, it is unclear whether near- and medium-term quantum devices can provide such an advantage. For the problem of ground-state energy estimation, which is of particular interest as a first step into quantum chemistry, small-scale proof-of-principle experiments have been performed on current noisy devices, but scaling to larger problem instances has been hindered by noise inherent in today's quantum hardware making it difficult to achieve the required precision. In this thesis, we investigate the use of Hamiltonian moments for improving on ground-state energy estimates from quantum devices, finding that the additional information incorporated into moments-corrected ground-state energy estimates allows accuracy beyond what would normally be possible for a given quantum circuit depth. This, combined with the inherent error robustness of the moments-based method, allowed us to perform calculations for Hydrogen chains beyond the Hartree-Fock approximation (Chapter 2), and subsequently, the largest quantum chemical calculation to date to achieve millihartree accuracy on existing quantum hardware (Chapter 3) - computing the ground-state energy of the water molecule on 8 qubits. We then consider extensions to the moments-based method allowing for estimation of non-energetic properties, obtaining the electric dipole moment of the water molecule to an error of 2% (Chapter 4) and qualitatively accurate molecular forces over a range of molecular geometries from a single quantum calculation (Chapter 5). Finally, we examine the scaling of the Hamiltonian moments evaluation through three different methods and verify the analytic results with numerical simulation (Chapter 6). While the methods do not scale as well as quantum phase estimation in the asymptotic limit, and further work is needed to provide concrete resource estimates, the hope is that the required circuit depths will be more reasonable for early fault-tolerant quantum devices.
While sufficiently large and accurate quantum computers are expected to exploit quantum effects such as superposition and entanglement to gain an advantage over their classical counterparts for specific problems, it is unclear whether near- and medium-term quantum devices can provide such an advantage. For the problem of ground-state energy estimation, which is of particular interest as a first step into quantum chemistry, small-scale proof-of-principle experiments have been performed on current noisy devices, but scaling to larger problem instances has been hindered by noise inherent in today's quantum hardware making it difficult to achieve the required precision. In this thesis, we investigate the use of Hamiltonian moments for improving on ground-state energy estimates from quantum devices, finding that the additional information incorporated into moments-corrected ground-state energy estimates allows accuracy beyond what would normally be possible for a given quantum circuit depth. This, combined with the inherent error robustness of the moments-based method, allowed us to perform calculations for Hydrogen chains beyond the Hartree-Fock approximation (Chapter 2), and subsequently, the largest quantum chemical calculation to date to achieve millihartree accuracy on existing quantum hardware (Chapter 3) - computing the ground-state energy of the water molecule on 8 qubits. We then consider extensions to the moments-based method allowing for estimation of non-energetic properties, obtaining the electric dipole moment of the water molecule to an error of 2% (Chapter 4) and qualitatively accurate molecular forces over a range of molecular geometries from a single quantum calculation (Chapter 5). Finally, we examine the scaling of the Hamiltonian moments evaluation through three different methods and verify the analytic results with numerical simulation (Chapter 6). While the methods do not scale as well as quantum phase estimation in the asymptotic limit, and further work is needed to provide concrete resource estimates, the hope is that the required circuit depths will be more reasonable for early fault-tolerant quantum devices.
Quantum computers hold promise to circumvent the limitations of conventional computing for difficult molecular problems. However, the accumulation of quantum logic errors on real devices represents a major challenge, particularly in the pursuit of chemical accuracy requiring the inclusion of electronic correlation effects. In this work we implement the quantum computed moments (QCM) approach for hydrogen chain molecular systems up to H[Formula: see text]. On a superconducting quantum processor, Hamiltonian moments, [Formula: see text] are computed with respect to the Hartree-Fock state, which are then employed in Lanczos expansion theory to determine an estimate for the ground-state energy which incorporates electronic correlations and manifestly improves on the direct energy measurement. Post-processing purification of the raw QCM data takes the estimate below the Hartree-Fock energy to within 99.9% of the exact electronic ground-state energy for the largest system studied, H[Formula: see text]. Calculated dissociation curves indicate precision at about 10mH for this system and as low as 0.1mH for molecular hydrogen, H[Formula: see text], over a range of bond lengths. In the context of stringent precision requirements for chemical problems, these results provide strong evidence for the error suppression capability of the QCM method, particularly when coupled with post-processing error mitigation. While calculations based on the Hartree-Fock state are tractable to classical computation, these results represent a first step towards implementing the QCM method in a quantum chemical trial circuit. Greater emphasis on more efficient representations of the Hamiltonian and classical preprocessing steps may enable the solution of larger systems on near-term quantum processors.
With rapid progress being made in the development of platforms for quantum computation, there has been considerable interest in whether present-day and near-term devices can be used to solve problems of relevance. A commonly cited application area is the domain of quantum chemistry. While most experimental demonstrations of quantum chemical calculations on quantum devices have focused on the ground-state electronic energy of the system, other properties of the ground state, such as the electric dipole moment, are also of interest. Here, we employ the quantum-computed-moments method, based on the Lanczos cluster expansion, to estimate the dipole moment of the water molecule on an IBM Quantum superconducting quantum device. The noise-mitigated results agree with full-configuration-interaction calculations to within 0.03 ± 0.007 D ( 2 % ± 0.5 % ), compared with direct expectation-value determination (i.e., variational quantum eigensolver, VQE) with errors of the order of 0.07 D (5%), even when the VQE calculation is performed without noise. This demonstrates that moments-based energy-estimation techniques can be adapted to noise-robust evaluation of nonenergetic ground-state properties of chemical systems. We emphasize that the dipole moment is chosen as an example of such a property, but the method applies to any property determined by one- or two-body interactions.
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.
The accurate computation of properties of large molecular systems is classically infeasible and is one of the applications in which it is hoped that quantum computers will demonstrate an advantage over classical devices. However, due to the limitations of present-day quantum hardware, variational-hybrid algorithms introduced to tackle these problems struggle to meet the accuracy and precision requirements of chemical applications. Here, we apply the quantum computed moments (QCM) approach combined with a variety of noise-mitigation techniques to an eight qubit and spin-orbital representation of the water molecule (H2O). A noise-stable improvement on the variational result for a four-excitation trial state (circuit depth 25, 22 cz gates) was obtained, with the ground-state energy computed to be within $1.0\ifmmode\pm\else\textpm\fi{}0.8$ mHa of exact diagonalization in the 14 spin-orbital basis. Thus, the QCM approach, despite an increased number of measurements and noisy quantum hardware (cz error rates c.0.3% corresponding to expected error rates on the trial-state circuit of order 7%), is able to determine the ground-state energy of a nontrivial molecular system at the required accuracy (c.0.05%). To the best of our knowledge, these results are the largest calculations performed on a physical quantum computer to date to achieve millihartree agreement with exact diagonalization, and a promising indicator of how such hybrid approaches might scale to problems of interest in the low-error and fault-tolerant regimes as quantum computers develop.
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.
With quantum computers on the horizon, it is essential to understand what problems they can be used to solve. One potential application is simulating quantum systems, in particular, systems with many interacting electrons. However, there is a disparity between the computational resources required to study these problems and the capabilities of modern experimental quantum devices. In this thesis, we make progress toward closing this gap by reducing the cost of quantum simulation of quantum chemistry on a number of fronts. In the first half, we develop three improved quantum simulation algorithms by approximating time evolution under the Hamiltonian using a truncated Taylor series rather than the Trotter-Suzuki decomposition. We do this first for the molecular electronic structure Hamiltonian in two representations, obtaining asymptotic improvements in terms of both the number of orbitals and the required precision. We also apply the truncated Taylor series paradigm to quantum simulation in real space, where we consider simulation of general wave functions discretized on a uniform grid. In the second half, by working with Hamiltonians tailored specifically to quantum algorithms, we demonstrate that Trotter steps of the electronic structure Hamiltonian can be simulated in exactly N depth and with only linear connectivity, where N is the number of spin-orbitals. This resolves the problem of non-locality in fermion-to-qubit mappings, and has wide-ranging applications for variational and phase estimation-based quantum simulation of quantum chemistry. We further study this algorithm on an error-corrected quantum computer using the surface code. Benchmarking it alongside other product formula approaches, we show that quantum simulation of scientifically important instances of the electronic structure problem that are classically intractable can be performed with only a few hundred thousand physical qubits and fewer than one billion costly fault-tolerant gates. Finally, we study the effect of using randomized Hamiltonians in iterative phase estimation, and how this allows us to reduce the costs of simulation as well as to exploit knowledge of the ground state in how we design our simulation algorithm.