Quantum annealing with Jarzynski equality

Details Quantum annealing with Jarzynski equality Quantum annealing with Jarzynski equality

2010-07-08

arxiv.org/abs/1007.1277v1

Phys. Rev. Lett. 105, 050401 (2010)

Physics

Quantum Physics

4 pages, to appear in Phys. Rev. Lett

Scientific paper

10.1103/PhysRevLett.105.050401

We show a practical application of the Jarzynski equality in quantum computation. Its implementation may open a way to solve combinatorial optimization problems, minimization of a real single-valued function, cost function, with many arguments. We consider to incorpolate the Jarzynski equality into quantum annealing, which is one of the generic algorithms to solve the combinatorial optimization problem. The ordinary quantum annealing suffers from non-adiabatic transitions whose rate is characterized by the minimum energy gap $\Delta_{\rm min.}$ of the quantum system under consideration. The quantum sweep speed is therefore restricted to be extremely slow for the achievement to obtain a solution without relevant errors. However, in our strategy shown in the present study, we find that such a difficulty would not matter.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-102164