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

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.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.

[1]  Jacob biamonte,et al.  Quantum machine learning , 2016, Nature.

[2]  Andrew M. Childs,et al.  Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision , 2015, SIAM J. Comput..

[3]  D. Poulin,et al.  Preparing ground States of quantum many-body systems on a quantum computer. , 2008, Physical review letters.

[4]  Seung Woo Shin,et al.  Quantum Hamiltonian Complexity , 2014, Found. Trends Theor. Comput. Sci..

[5]  Sangchul Oh,et al.  Quantum computational method of finding the ground-state energy and expectation values , 2007, 0712.0789.

[6]  Theodore J. Yoder,et al.  Fixed-point quantum search with an optimal number of queries. , 2014, Physical review letters.

[7]  Alessandro Silva,et al.  Colloquium: Nonequilibrium dynamics of closed interacting quantum systems , 2010, 1007.5331.

[8]  S. Lloyd,et al.  Quantum Algorithm Providing Exponential Speed Increase for Finding Eigenvalues and Eigenvectors , 1998, quant-ph/9807070.

[9]  Avinatan Hassidim,et al.  Quantum state restoration and single-copy tomography for ground states of Hamiltonians. , 2009, Physical review letters.

[10]  Seth Lloyd,et al.  Universal Quantum Simulators , 1996, Science.

[11]  Andrew M. Childs,et al.  Simulating Hamiltonian dynamics with a truncated Taylor series. , 2014, Physical review letters.

[12]  R. Feynman.  Simulating physics with computers , 1999 .

[13]  I. Chuang,et al.  Optimal Hamiltonian Simulation by Quantum Signal Processing. , 2016, Physical review letters.

[14]  M. Ruskai,et al.  Bounds for the adiabatic approximation with applications to quantum computation , 2006, quant-ph/0603175.

[15]  R. Mises,et al.  Praktische Verfahren der Gleichungsauflösung . , 1929 .

[16]  Sergio Boixo,et al.  Introduction to Quantum Algorithms for Physics and Chemistry , 2012, 1203.1331.

[17]  Dmitry A. Abanin,et al.  Recent progress in many‐body localization , 2017, 1705.09103.

[18]  M. Rigol,et al.  From quantum chaos and eigenstate thermalization to statistical mechanics and thermodynamics , 2015, 1509.06411.