Quantum Simulated Annealing

Details Quantum Simulated Annealing Quantum Simulated Annealing

2007-12-06

arxiv.org/abs/0712.1008v1

Physics

Quantum Physics

8 pages, 2 figure

Scientific paper

We develop a quantum algorithm to solve combinatorial optimization problems through quantum simulation of a classical annealing process. Our algorithm combines techniques from quantum walks, quantum phase estimation, and quantum Zeno effect. It can be viewed as a quantum analogue of the discrete-time Markov chain Monte Carlo implementation of classical simulated annealing. Our implementation scales with the inverse of the square root of the minimum spectral gap of the stochastic matrix used in the classical simulation. The quantum algorithm outperforms the classical one, which scales with the inverse of the gap.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-92345