Speed-up via Quantum Sampling

Details Speed-up via Quantum Sampling Speed-up via Quantum Sampling

2008-04-26

arxiv.org/abs/0804.4259v3

Physics

Quantum Physics

8 pages, fixed some minor typos

Scientific paper

10.1103/PhysRevA.78.042336

The Markov Chain Monte Carlo method is at the heart of efficient approximation schemes for a wide range of problems in combinatorial enumeration and statistical physics. It is therefore very natural and important to determine whether quantum computers can speed-up classical mixing processes based on Markov chains. To this end, we present a new quantum algorithm, making it possible to prepare a quantum sample, i.e., a coherent version of the stationary distribution of a reversible Markov chain. Our algorithm has a significantly better running time than that of a previous algorithm based on adiabatic state generation. We also show that our methods provide a speed-up over a recently proposed method for obtaining ground states of (classical) Hamiltonians.

Affiliated with

Also associated with

No associations

Rating

Speed-up via Quantum Sampling 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 Speed-up via Quantum Sampling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Speed-up via Quantum Sampling will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-114298