To maximize the value of fault-tolerant quantum computers, it is essential to develop concrete applications beyond well-established domains such as chemistry and condensed-matter physics. Here we construct and compile quantum algorithms to simulate the structure of atomic nuclei -- a topic that has received relatively little attention from the quantum computing community despite its similarities to the electronic structure problem in chemistry -- via effective shell-model Hamiltonians and no-core-shell-model Hamiltonians with three-body interactions derived from chiral effective field theory. Furthermore, we provide quantum resource estimates, in terms of Toffoli gate and qubit counts, for these algorithms, which, to our knowledge, are the first such estimates for fault-tolerant quantum simulation of atomic nuclei. Notably, the estimates for $^{32}$Mg and $^{219}$At shell-model Hamiltonians are comparable to recent estimates of Femoco simulations, a standard benchmark in chemistry. For no-core-shell-model Hamiltonians suitable for light nuclei (up to $^{40}$Ca or so), we find that resource requirements are significantly higher, suggesting that more bespoke strategies are required to make such simulations practicable. Throughout this work, we draw upon the similarities between nuclear and electronic structure problems, while also highlighting challenges that are specific to the former. We hope this work will spur long-term collaborations between the nuclear and quantum computing community with the ultimate goal of realizing useful nuclear simulations on quantum computers.
To maximize the value of fault-tolerant quantum computers, it is essential to develop concrete applications beyond well-established domains such as chemistry and condensed-matter physics. Here we construct and compile quantum algorithms to simulate the structure of atomic nuclei -- a topic that has received relatively little attention from the quantum computing community despite its similarities to the electronic structure problem in chemistry -- via effective shell-model Hamiltonians and no-core-shell-model Hamiltonians with three-body interactions derived from chiral effective field theory. Furthermore, we provide quantum resource estimates, in terms of Toffoli gate and qubit counts, for these algorithms, which, to our knowledge, are the first such estimates for fault-tolerant quantum simulation of atomic nuclei. Notably, the estimates for 32Mg and 219At shell-model Hamiltonians are comparable to recent estimates of Femoco simulations, a standard benchmark in chemistry. For no-core-shell-model Hamiltonians suitable for light nuclei (up to 40Ca or so), we find that resource requirements are significantly higher, suggesting that more bespoke strategies are required to make such simulations practicable. Throughout this work, we draw upon the similarities between nuclear and electronic structure problems, while also highlighting challenges that are specific to the former. We hope this work will spur long-term collaborations between the nuclear and quantum computing community with the ultimate goal of realizing useful nuclear simulations on quantum computers.
We present a framework for benchmarking quantum algorithms for nuclear many-body systems based on realistic nuclear Hamiltonians such as chiral effective field theory. To this end, we introduce a workflow that maps nuclear interactions in second quantization formalism to qubit Hamiltonians. This enables the systematic construction of benchmark instances spanning no-core and valence-space formulations with two-body (NN) and selected three-body (3N) interactions. Then, we proceed to provide resource estimates for three representative eigenvalue algorithms: Quantum Phase Estimation, Quantum Krylov methods, and Observable Dynamic Mode Decomposition. We compare their resource requirements in terms of T-gate counts and system size, and examine the impact of model-space choices and many-body interactions. The primitives included in our analysis are Trotterization, Qubitization, and Quantum Singular Value Transformation. Our results quantify scaling trends across algorithms and problem classes, and provide a basis for consistent comparisons of quantum approaches to nuclear many-body problems. The implementation is provided by the NuQuLib software stack.
Abstract We present a comprehensive end-to-end framework for simulating the real-time dynamics of chemical systems on a fault-tolerant quantum computer, incorporating both electronic and nuclear quantum degrees of freedom. An all-particle simulation is nominally efficient on a quantum computer, but practically infeasible. Hence, central to our approach is the construction of a first-quantized plane-wave algorithm making use of pseudoions. The latter consolidate chemically inactive electrons and the nucleus into a single effective dynamical ionic entity, extending the well-established concept of pseudopotentials in quantum chemistry to a two-body interaction. We explicitly describe efficient quantum circuits for initial state preparation across all degrees of freedom, as well as for block-encoding the Hamiltonian describing interacting pseudoions and chemically active electrons, by leveraging recent advances in quantum rejection sampling to optimize the implementations. To extract useful chemical information, we first design molecular fingerprints by combining density-functional calculations with machine learning techniques, and subsequently validate them through surrogate classical molecular dynamics simulations. These fingerprints are then coherently encoded on a quantum computer for efficient molecular identification via amplitude estimation. We provide an extensive analysis of the cost of running the algorithm on a fault-tolerant quantum computer for several chemically interesting systems. As an illustration, simulating the interaction between NH3 and BF3 (a 40-particle system) requires 808 logical qubits to encode the problem, and approximately 10^11 Toffoli gates per femtosecond of time evolution. Our results establish a foundation for further quantum algorithm development targeting chemical and material dynamics.
The nuclear shell model is one of the prime many-body methods to study the structure of atomic nuclei, but it is hampered by an exponential scaling on the basis size as the number of particles increases. We present a shell-model quantum circuit design strategy to find nuclear ground states by exploiting an adaptive variational quantum eigensolver algorithm. Our circuit implementation is in excellent agreement with classical shell-model simulations for a dozen of light and medium-mass nuclei, including neon and calcium isotopes. We quantify the circuit depth, width and number of gates to encode realistic shell-model wavefunctions. Our strategy also addresses explicitly energy measurements and the required number of circuits to perform them. Our simulated circuits approach the benchmark results exponentially with a polynomial scaling in quantum resources for each nucleus. This work paves the way for quantum computing shell-model studies across the nuclear chart and our quantum resource quantification may be used in configuration-interaction calculations of other fermionic systems.
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.
The first-principles quantum simulation of the full electronic Hamiltonian of a material model of realistic size appears daunting even in a future era of fully fault-tolerant quantum computers. In contrast, classical simulations of material excited states rely on heuristic quasiparticle frameworks, such as the GW approximation and Bethe-Salpeter equation, where only a few quasiparticles are explicitly considered. Here we give a detailed description of quasiparticle quantum simulation for multi-excitonic states within the BSE. We develop an explicit first-quantized, orbital-based block encoding of the multi-exciton BSE Hamiltonian for qubitization, and reduce its cost using integral factorization and crystal symmetries. For a materials model of size N, and a fixed number of quasiparticles, the resulting algorithms require O(N) Toffoli gates and O(logN) logical qubits, or, using space-time tradeoffs, O(N) Toffoli gates and O(N) logical qubits, achieving up to a sixth power reduction in Toffoli count, or up to exponential reduction in qubit count, versus standard full Hamiltonian simulation techniques that have been explored in materials simulation. Resource estimates for the classically challenging problem of triexcitonic eigenvalue estimation across a range of semiconductor models of a realistic physical size of O(103) atoms, show that our Toffoli-optimized implementation reduces the Toffoli count by 106−107 relative to full Hamiltonian simulation estimates, while a qubit-optimized implementation requires only a few hundred logical qubits. More broadly, these results show that classical heuristic frameworks will be essential in the design of future fault-tolerant quantum algorithms for materials.
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.