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

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

2010-08-25

arxiv.org/abs/1008.4294v2

Physics

Quantum Physics

4 pages

Scientific paper

Estimating the ground state energy of a multiparticle system with relative error $\e$ using deterministic classical algorithms has cost that grows exponentially with the number of particles. The problem depends on a number of state variables $d$ that is proportional to the number of particles and suffers from the curse of dimensionality. Quantum computers can vanquish this curse. In particular, we study a ground state eigenvalue problem and exhibit a quantum algorithm that achieves relative error $\e$ using a number of qubits $C^\prime d\log \e^{-1}$ with total cost (number of queries plus other quantum operations) $Cd\e^{-(3+\delta)}$, where $\delta>0$ is arbitrarily small and $C$ and $C^\prime$ are independent of $d$ and $\e$. Thus, the number of qubits and the total cost are linear in the number of particles.

Affiliated with

Also associated with

No associations

Rating

A fast algorithm for approximating the ground state energy on a quantum computer does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A fast algorithm for approximating the ground state energy on a quantum computer, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A fast algorithm for approximating the ground state energy on a quantum computer will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-525485