arXiv:1712.03193 · Journal of Mathematical Physics

Faster ground state preparation and high-precision ground energy estimation with fewer qubits

Yimin Ge, Jordi Tura, J. I. Cirac

Published Feb 1, 2019• 154 citations

Abstract

We propose a general-purpose quantum algorithm for preparing ground states of quantum Hamiltonians from a given trial state. The algorithm is based on techniques recently developed in the context of solving the quantum linear system problem. We show that, compared to algorithms based on phase estimation, the runtime of our algorithm is exponentially better as a function of the allowed error, and at least quadratically better as a function of the overlap with the trial state. We also show that our algorithm requires fewer ancilla qubits than existing algorithms, making it attractive for early applications of small quantum computers. Additionally, it can be used to determine an unknown ground energy faster than with phase estimation if a very high precision is required.

DOI: 10.1063/1.5027484

Related papers

Quantum algorithm for ground state energy estimation using circuit depth with exponentially improved dependence on precision

Guoming Wang, Daniel Stilck França, Ruizhe Zhang +2 more

A milestone in the field of quantum computing will be solving problems in quantum chemistry and materials faster than state-of-the-art classical methods. The current understanding is that achieving quantum advantage in this area will require some degree of fault tolerance. While hardware is improving towards this milestone, optimizing quantum algorithms also brings it closer to the present. Existing methods for ground state energy estimation are costly in that they require a number of gates per circuit that grows exponentially with the desired number of bits in precision. We reduce this cost exponentially, by developing a ground state energy estimation algorithm for which this cost grows linearly in the number of bits of precision. Relative to recent resource estimates of ground state energy estimation for the industrially-relevant molecules of ethylene-carbonate and PF 6 − , the estimated gate count and circuit depth is reduced by a factor of 43 and 78, respectively. Furthermore, the algorithm can use additional circuit depth to reduce the total runtime. These features make our algorithm a promising candidate for realizing quantum advantage in the era of early fault-tolerant quantum computing.

arXiv:2209.06811QuantumNov 6, 202360 citations

Near-optimal ground state preparation

Lin Lin, Yu Tong

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 that an initial state with non-trivial overlap with the ground state can be efficiently prepared, and the spectral gap between the ground energy and the 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 a logarithmic dependence on the inverse error. When such an upper bound is not known, 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 the desired precision is exponentially improved compared to the current state-of-the-art algorithm proposed in [Ge et al. 2019]. These two algorithms can then be combined 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.

arXiv:2002.12508QuantumDec 14, 2020189 citations

Heisenberg-Limited Ground-State Energy Estimation for Early Fault-Tolerant Quantum Computers

Lin Lin, Yu Tong

Under suitable assumptions, the quantum-phase-estimation (QPE) algorithm is able to achieve Heisenberg-limited precision scaling in estimating the ground-state energy.However, QPE requires a large number of ancilla qubits and a large circuit depth, as well as the ability to perform inverse quantum Fourier transform, making it expensive to implement on an early fault-tolerant quantum computer.We propose an alternative method to estimate the ground-state energy of a Hamiltonian with Heisenberglimited precision scaling, which employs a simple quantum circuit with one ancilla qubit, and a classical postprocessing procedure.Besides the ground-state energy, our algorithm also produces an approximate cumulative distribution function of the spectral measure, which can be used to compute other spectral properties of the Hamiltonian.

arXiv:2102.11340PRX QuantumFeb 2, 2022176 citations

Even Shorter Quantum Circuit for Phase Estimation on Early Fault-Tolerant Quantum Computers with Applications to Ground-State Energy Estimation

Zhiyan Ding, Lin Lin

We develop a phase-estimation method with a distinct feature: its maximal run time (which determines the circuit depth) is δ/ , where is the target precision, and the preconstant δ can be arbitrarily close to 0 as the initial state approaches the target eigenstate.The total cost of the algorithm satisfies the Heisenberg-limited scaling O( -1 ).As a result, our algorithm may significantly reduce the circuit depth for performing phase-estimation tasks on early fault-tolerant quantum computers.The key technique is a simple subroutine called quantum complex exponential least squares (QCELS).Our algorithm can be readily applied to reduce the circuit depth for estimating the ground-state energy of a quantum Hamiltonian, when the overlap between the initial state and the ground state is large.If this initial overlap is small, we can combine our method with the Fourier-filtering method developed in [Lin and Tong, PRX Quantum 3, 010318, 2022], and the resulting algorithm provably reduces the circuit depth in the presence of a large relative overlap compared to .The relative-overlap condition is similar to a spectral-gap assumption but it is aware of the information in the initial state and is therefore applicable to certain Hamiltonians with small spectral gaps.We observe that the circuit depth can be reduced by around 2 orders of magnitude in numerical experiments under various settings.

arXiv:2211.11973PRX QuantumMay 26, 202380 citations

Initial State Preparation for Quantum Chemistry on Quantum Computers

Stepan Fomichev, Kasra Hejazi, Modjtaba Shokrian Zini +8 more

Quantum algorithms for ground-state energy estimation of chemical systems require a high-quality initial state. However, initial state preparation is commonly either neglected entirely, or assumed to be solved by a simple product state like Hartree-Fock. Even if a nontrivial state is prepared, strong correlations render ground-state overlap inadequate for quality assessment. In this work, we address the initial state preparation problem with an end-to-end algorithm that and the quality of initial states, accomplishing the latter with a new metric—the energy distribution. To be able to prepare more complicated initial states, we introduce an implementation technique for states in the form of a sum of Slater determinants that exhibits significantly better scaling than all prior approaches. We also propose low-precision quantum phase estimation (QPE) for further state quality refinement. The complete algorithm is capable of generating high-quality states for energy estimation, and is shown in select cases to lower the overall estimation cost by several orders of magnitude when compared with the best single product state ansatz. More broadly, the energy distribution picture suggests that the goal of QPE should be reinterpreted as generating improvements compared to the energy of the initial state and other classical estimates: such an improvement can still be achieved even if QPE does not project directly onto the ground state. Finally, we show how the energy distribution can help in identifying potential quantum advantage. Published by the American Physical Society 2024

arXiv:2310.18410PRX QuantumDec 9, 202456 citations

Efficient ground-state-energy estimation and certification on early fault-tolerant quantum computers

Guoming Wang, Daniel Stilck França, Gumaro Rendon +1 more

A major thrust in quantum algorithm development over the past decade has been the search for the quantum algorithms that will deliver practical quantum advantage first. Today's quantum computers---and even early fault-tolerant quantum computers---are limited in the number of operations they can implement per circuit. We introduce quantum algorithms for ground-state-energy estimation (GSEE) that accommodate this design constraint. The first algorithm estimates ground-state energies, offering a quadratic improvement on the ground-state overlap parameter compared to other methods in this regime. The second algorithm certifies that the estimated ground-state energy is within a specified error tolerance of the true ground-state energy, addressing the issue of gap estimation that beleaguers several ground-state preparation and energy estimation algorithms. We note, however, that the scaling of this certification technique is currently less favorable than that of the GSEE algorithm. To develop the certification algorithm, we propose an alternative use of quantum computers to facilitate rejection sampling. After a classical computer generates initial samples, the quantum computer is used to accept or reject these samples, resulting in a set of accepted samples that approximate draws from a target distribution. Although we apply this technique specifically for ground-state-energy certification, it may find broader applications. Our paper pushes the boundaries of what operation-limited quantum computers can achieve, bringing the prospect of quantum advantage closer to realization.

arXiv:2304.09827Physical Review AJan 17, 20258 citations