Near-optimal ground state preparation

02/28/2020
by   Lin Lin, et al.
0

Preparing the ground state of a given Hamiltonian and estimating its ground energy are important but computationally hard tasks. However, given some additional information, these problems can be solved efficiently on a quantum computer. We assume an initial state with non-trivial overlap with the ground state can be efficiently prepared, and the spectral gap between the ground energy and first excited energy is bounded from below. With these assumptions we design an algorithm that prepares the ground state when an upper bound of the ground energy is known, whose runtime has exponentially better dependence on the desired precision than phase estimation. When such upper bound is unknown, we propose a hybrid quantum-classical algorithm to estimate the ground energy, where the dependence of the number of queries to the initial state on precision is exponentially improved compared to the current state-of-the-art algorithm proposed in [Ge et al. 2019]. This estimated ground state energy is then combined with the first algorithm to prepare a ground state without knowing an upper bound of the ground energy. We also prove that our algorithms reach the complexity lower bounds by applying it to the unstructured search problem and the quantum approximate counting problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/08/2023

Tight Bounds for Quantum Phase Estimation and Related Problems

Phase estimation, due to Kitaev [arXiv'95], is one of the most fundament...
research
07/22/2020

The importance of the spectral gap in estimating ground-state energies

The field of quantum Hamiltonian complexity lies at the intersection of ...
research
07/21/2022

Improved Hardness Results for the Guided Local Hamiltonian Problem

Estimating the ground state energy of a local Hamiltonian is a central p...
research
10/10/2018

Quantum adiabatic optimization without heuristics

Quantum adiabatic optimization (QAO) is performed using a time-dependent...
research
05/03/2021

Improved approximation algorithms for bounded-degree local Hamiltonians

We consider the task of approximating the ground state energy of two-loc...
research
09/22/2021

Bounds on approximating Max kXOR with quantum and classical local algorithms

We consider the power of local algorithms for approximately solving Max ...

Please sign up or login with your details

Forgot password? Click here to reset