Eigenvector approximation leading to exponential speedup of quantum eigenvalue calculation.

  title={Eigenvector approximation leading to exponential speedup of quantum eigenvalue calculation.},
  author={Peter Jaksch and Anargyros Papageorgiou},
  journal={Physical review letters},
  volume={91 25},
We present an efficient method for preparing the initial state required by the eigenvalue approximation quantum algorithm of Abrams and Lloyd. Our method can be applied when solving continuous Hermitian eigenproblems, e.g., the Schrödinger equation, on a discrete grid. We start with a classically obtained eigenvector for a problem discretized on a coarse grid, and we efficiently construct, quantum mechanically, an approximation of the same eigenvector on a fine grid. We use this approximation… 

Measures of quantum computing speedup

It is proved that approximating the ground state energy of an instance of the time-independent Schr\"odinger equation, with $d$ degrees of freedom, large, enjoys strong exponential quantum speedup.

Preparation of Approximate Eigenvector by Unitary Operations on Eigenstate in Abrams-Lloyd Quantum Algorithm

This work implemented the method involving orthogonalization of the eigenstate obtained in a trial on the programming language model of quantum computation and tested it on a unitary matrix representing the time evolution operator of a small spin chain.

A fast algorithm for approximating the ground state energy on a quantum computer

A quantum algorithm is exhibited that achieves relative error " using a number of qubits C 0 d log" 1 with total cost (number of queries plus other quantum operations) Cd" (3+ ) , where > 0 is arbitrarily small and C and C 0 are inde.

Quantum Algorithms and Complexity for Continuous Problems

High-dimensional integration, path Integration, Feynman path integration, the smallest eigenvalue of a differential equation, approximation, partial differential equations, ordinary differential equations and gradient estimation are reported on.

Quantum Algorithms for Continuous Problems and Their Applications

A brief introduction to quantum algorithms is given and a wide range of applications including high dimensional integration, path integration, Hamiltonian simulation, and ground state energy estimation are reported on.

Simulating chemistry using quantum computers.

This review discusses to what extent the ideas in quantum computation, now a well-established field, have been applied to chemical problems and describes algorithms that achieve significant advantages for the electronic-structure problem, the simulation of chemical dynamics, protein folding, and other tasks.

Quantum phase estimation for a class of generalized eigenvalue problems

Quantum phase estimation provides a path to quantum computation of solutions to Hermitian eigenvalue problems $Hv = \lambda v$, such as those occurring in quantum chemistry. It is natural to ask

Quantum Algorithms and Complexity for Numerical Problems

This thesis designs an adiabatic quantum algorithm for the counting problem, and derives the optimal order of convergence, given e and the cost of the resulting algorithm, which is close to the best lower bound on query complexity known for the classical PAC learning model.

Introduction to Quantum Algorithms for Physics and Chemistry

An enormous number of model chemistries are used in computational chemistry to solve or approximately solve the Schrodinger equation; each with their own drawbacks. One key limitation is that the



Quantum computation and quantum information

This chapter discusses quantum information theory, public-key cryptography and the RSA cryptosystem, and the proof of Lieb's theorem.


  • Rev. Lett. 83, 5162
  • 1999

Quantum Amplitude Amplification and Estimation

Consider a Boolean function $\chi: X \to \{0,1\}$ that partitions set $X$ between its good and bad elements, where $x$ is good if $\chi(x)=1$ and bad otherwise. Consider also a quantum algorithm

Science 273

  • 1073
  • 1996

Eigenvalue Problems (in Handbook of Numerical Analysis

  • 1991

In fact, we can weaken this condition by considering the numerical error in solving the coarsely discretized problem. It suffices to assume that we have an approximation |Û