Related papers: Near-optimal ground state preparation
The determination of ground state properties of quantum systems is a fundamental problem in physics and chemistry, and is considered a key application of quantum computers. A common approach is to prepare a trial ground state on the quantum…
A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. For this task, there is a well-studied quantum algorithm that performs quantum phase estimation on an initial trial state that…
Considering recent advancements and successes in the development of efficient quantum algorithms for electronic structure calculations --- alongside impressive results using machine learning techniques for computation --- hybridizing…
Preparing low energy states is a central challenge in quantum computing and quantum complexity theory. Several known approaches to prepare low energy states often get stuck in suboptimal states, such as high energy eigenstates (or low…
Calculating the energy spectrum of a quantum system is an important task, for example to analyse reaction rates in drug discovery and catalysis. There has been significant progress in developing algorithms to calculate the ground state…
A new method is proposed for determining the ground state wave function of a quantum many-body system on a quantum computer, without requiring an initial trial wave function that has good overlap with the true ground state. The technique of…
One of the main applications of future quantum computers will be the simulation of quantum models. While the evolution of a quantum state under a Hamiltonian is straightforward (if sometimes expensive), using quantum computers to determine…
Quantum computing offers potential solutions for finding ground states in condensed-matter physics and chemistry. However, achieving effective ground state preparation is also computationally hard for arbitrary Hamiltonians. It is necessary…
For any local Hamiltonian H, I construct a local CPT map and stopping condition which converges to the ground state subspace of H. Like any ground state preparation algorithm, this algorithm necessarily has exponential run-time in general…
We propose a quantum inverse iteration algorithm which can be used to estimate the ground state properties of a programmable quantum device. The method relies on the inverse power iteration technique, where the sequential application of the…
Quantum computers can accurately compute ground state energies using phase estimation, but this requires a guiding state that has significant overlap with the true ground state. For large molecules and extended materials, it becomes…
Quantum computing is believed to be particularly useful for the simulation of chemistry and materials, among the various applications. In recent years, there have been significant advancements in the development of near-term quantum…
We study design challenges associated with realizing a ground state quantum computer. In such a computer, the energy gap between the ground state and first excited state must be sufficiently large to prevent disruptive excitations. Here, an…
We give a quasi-polynomial time classical algorithm for estimating the ground state energy and for computing low energy states of quantum impurity models. Such models describe a bath of free fermions coupled to a small interacting subsystem…
Low-energy estimation and state preparation for general $k$-local Hamiltonians are fundamental challenges in quantum complexity theory. For constant relative accuracy, Buhrman et al. (PRL 2025) recently broke the natural Grover bound…
We investigate the feasibility of early fault-tolerant quantum algorithms focusing on ground-state energy estimation problems. In particular, we examine the computation of the cumulative distribution function (CDF) of the spectral measure…
The simulation of the dynamics of a system coupled to a low-temperature environment is a promising application of quantum computers to determine ground-state properties of physical systems. However, this approach requires not only the…
We present a novel method for improving the quantum simulation of the ground state energy of molecules. We perform a pre-processing step classically, which reduces the dimensionality of the problem by generating a custom mapping which…
Finding eigenstates of a given many-body Hamiltonian is a long-standing challenge due to the perceived computational complexity. Leveraging on the hardware of a quantum computer accommodating the exponential growth of the Hilbert space size…
The current state of quantum computing is commonly described as the Noisy Intermediate-Scale Quantum era. Available computers contain a few dozens of qubits and can perform a few dozens of operations before the inevitable noise erases all…