We prove classical simulation hardness, under the generalized $\mathsf{P}\neq\mathsf{NP}$ conjecture, for quantum circuit families with applications in near-term molecular electronic ground and excited state estimation. The proof exploits a connection to particle number conserving matchgate circuits with fermionic magic state inputs, which are shown to be universal for quantum computation under postselection, and are therefore not classically simulable in the worst case, in either the strong (multiplicative) or weak (sampling) sense. We apply these results to non-orthogonal quantum eigensolvers designed for near-term hardware by ruling out sample-based dequantization strategies to additively approximate the off-diagonal matrix elements between orbital-rotated correlated reference states that satisfy an irreducible fermionic magic property, which combines anticoncentration in any orbital basis with an average-case multiplicative approximation hardness conjecture for the associated matrix polynomials. We apply this complexity analysis to two choices of ansatz that incorporate both static and dynamic correlations to model the electronic eigenstates of molecular systems. These are linear combinations of orbital-rotated matrix product states, which are preparable in linear depth, and linear combinations of states prepared by generalized unitary coupled cluster with singles and doubles or unitary cluster Jastrow circuits of polynomial depth, for which computing the expectation values of local fermionic observables up to a constant additive error is $\mathsf{BQP}$-complete. We discuss the implications for achieving practical quantum advantage in resolving the electronic structure of catalytic systems composed from multivalent transition metal atoms using near-term quantum hardware.
We prove classical simulation hardness, under the generalized P=NP conjecture, for quantum circuit families with applications in near-term molecular electronic ground and excited state estimation. The proof exploits a connection to particle number conserving matchgate circuits with fermionic magic state inputs, which are shown to be universal for quantum computation under postselection, and are therefore not classically simulable in the worst case, in either the strong (multiplicative) or weak (sampling) sense. We apply these results to non-orthogonal quantum eigensolvers designed for near-term hardware by ruling out sample-based dequantization strategies to additively approximate the off-diagonal matrix elements between orbital-rotated correlated reference states that satisfy an irreducible fermionic magic property, which combines anticoncentration in any orbital basis with an average-case multiplicative approximation hardness conjecture for the associated matrix polynomials. We apply this complexity analysis to two choices of ansatz that incorporate both static and dynamic correlations to model the electronic eigenstates of molecular systems. These are linear combinations of orbital-rotated matrix product states, which are preparable in linear depth, and linear combinations of states prepared by generalized unitary coupled cluster with singles and doubles or unitary cluster Jastrow circuits of polynomial depth, for which computing the expectation values of local fermionic observables up to a constant additive error is BQP-complete. We discuss the implications for achieving practical quantum advantage in resolving the electronic structure of catalytic systems composed from multivalent transition metal atoms using near-term quantum hardware.
Significant advances have been made in the study of quantum advantage both in theory and experiment, although these have mostly been limited to artificial setups. In this work, we extend the scope to address quantum advantage in tasks relevant to chemistry and physics. Specifically, we consider the unitary cluster Jastrow (UCJ) ansatz-a variant of the unitary coupled cluster ansatz, which is widely used to solve the electronic structure problem on quantum computers-to show that sampling from the output distributions of quantum circuits implementing the UCJ ansatz is likely to be classically hard. More specifically, we show that there exist UCJ circuits for which classical simulation of sampling cannot be performed in polynomial time, under a reasonable complexity-theoretical assumption that the polynomial hierarchy does not collapse. Our main contribution is to show that a class of UCJ circuits can be used to perform arbitrary instantaneous quantum polynomial-time (IQP) computations, which are already known to be classically hard to simulate under the same complexity assumption. As a side result, we also show that UCJ equipped with post-selection can generate the class post-BQP. Our demonstration, worst-case nonsimulatability of UCJ, would potentially imply quantum advantage in quantum algorithms for chemistry and physics using unitary coupled cluster type ansatzes, such as the variational quantum eigensolver and quantum-selected configuration interaction.
Establishing the precise computational boundary between classically tractable fermionic systems and those capable of genuine quantum advantage is a central challenge in quantum simulation. While injecting non-Gaussian ``magic" inputs into free-fermion circuits is widely expected to generate intractable complexity, we identify a physically motivated intermediate regime. We prove that for block-product paired non-Gaussian fermionic states, essential quantum simulation primitives -- transition amplitudes, overlaps, and arbitrary-weight number correlators -- can be efficiently approximated to additive error under free-fermionic dynamics. This tractability stems from an algebraic reduction that compresses exponentially large multiparticle interference into a single coefficient of a multivariate Pfaffian polynomial. Because these classical estimators match the intrinsic O(1/K) statistical uncertainty of quantum hardware utilizing K measurement shots, they constitute a practical benchmark. Building on this foundation, we construct an additive-error estimator for high-weight Wilson observables in the noninteracting quench of recent trapped-ion experiments, providing a rigorous classical benchmark. Extending this to quantum chemistry, we demonstrate that core overlap-based subroutines for antisymmetrized products of strongly orthogonal geminals admit efficient additive-error Pfaffian-kernel estimators. Ultimately, these results sharpen the boundary of quantum advantage, establishing that the paired-electron scaffold is dequantized and clarifying where quantum resources are indispensable.
Abstract Quantum simulations are bound to be one of the main applications of near-term quantum computers. Quantum chemistry and condensed matter physics are expected to benefit from these technological developments. Several quantum simulation methods are known to prepare a state on a quantum computer and measure the desired observables. The most resource economic procedure is the variational quantum eigensolver (VQE), which has traditionally employed unitary coupled cluster as the ansatz to approximate ground states of many-body fermionic Hamiltonians. A significant caveat of the method is that the initial state of the procedure is a single reference product state from a classical Hartree–Fock calculation with no pairing correlations, hence it cannot represent superconducting states. In this work, we propose to improve the method by initializing the algorithm with a more general fermionic Gaussian state, an idea borrowed from the field of nuclear physics. We show how this Gaussian reference state can be prepared with a linear-depth circuit of quantum matchgates. By augmenting the set of available gates with nearest-neighbor phase coupling, we generate a low-depth circuit ansatz that can accurately prepare the ground state of correlated fermionic systems. This extends the range of applicability of the VQE to systems with strong pairing correlations such as superconductors, atomic nuclei, and topological materials.
We consider the question of how correlated the system hardness is between classical algorithms of electronic structure theory in ground state estimation and quantum algorithms. To define the system hardness for classical algorithms, we employ empirical criterion based on the deviation of electronic energies produced by coupled cluster and configuration interaction methods from the exact ones along multiple bonds dissociation in a set of molecular systems. For quantum algorithms, we have selected the Variational Quantum Eigensolver (VQE) and Quantum Phase Estimation (QPE) methods. As characteristics of the system hardness for quantum methods, we analyzed circuit depths for the state preparation, the number of quantum measurements needed for the energy expectation value, and various cost characteristics for the Hamiltonian encodings via Trotter approximation and linear combination of unitaries (LCU). Our results show that the quantum resource requirements are mostly unaffected by classical hardness, with the only exception being the state preparation part, which contributes to both VQE and QPE algorithm costs. However, there are clear indications that constructing the initial state with a significant overlap with the true ground state is easier than obtaining the state with an energy expectation value within chemical precision. These results support optimism regarding the identification of a molecular system where a quantum algorithm excels over its classical counterpart, as quantum methods can maintain efficiency in classically challenging systems.
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 exist today that are capable of performing calculations that challenge the largest classical supercomputers. Now the great challenge is to make use of these devices, or their successors, to perform calculations of independent interest. This thesis focuses on a family of algorithms that aim to accomplish this goal, known as variational quantum algorithms, and the challenges that they face. We frame these challenges in terms of two kinds of resources, the number of operations that we can afford to perform in a single quantum circuit, and the overall number of circuit repetitions required. Before turning to our specific contributions, we provide a review of the electronic structure problem, which serves as a central example for our work. We also provide a self-contained introduction to the field of quantum computing and the notion of a variational quantum algorithm.We begin the main body of the thesis by studying a generalization of the standard unitary coupled cluster ansatz. We present a sparse version of unitary coupled cluster and show that it can accurately represent the ground and excited states of small molecular systems using fewer quantum gates than the full unitary coupled cluster. We then introduce a strategy for representing molecular ground states as linear combinations of parameterized wavefunctions, allowing for a tradeoff between the number of operations required for each circuit and the number of circuit repetitions. We provide circuit primitives that allow for the efficient measurement of the required matrix elements between these wavefunctions. Subsequently, we show how the cost of estimating the energy of a quantum chemical wavefunction on a near-term quantum computer can be dramatically reduced by using a factorization of the two-electron integraltensor. Furthermore, we explain how this measurement strategy helps mitigate against errors during state preparation and measurement. We then present a Monte Carlo version of a classical algorithm for calculating the partition function of two-dimensional lattice models that shows a similar kind of tradeoff between two resources, albeit in a different context. Finally, we show how ideas based on tensor networks can inform the design of quantum circuits for machine learning tasks. We argue that this application is especially tolerant to noise and present numerical data substantiating this argument. We conclude by explaining explicitly how our work addresses the problems of the limited resources available to near-term quantum computers and offering some optimism about the future of the field.