Take the 2-minute tour ×
Programmers Stack Exchange is a question and answer site for professional programmers interested in conceptual questions about software development. It's 100% free, no registration required.

From that question about differences between Quantum annealing and simulated annealing, we found (in comments to answer) that physical implementation of quantum annealing exists (D-Wave quantum computers).

Can anyone explain that algorithm in terms of quantum gates and quantum algorithms, or in physical terms (a part of algorithm that depends on quantum hardware)?

share|improve this question
Possibly more suited to: scicomp.stackexchange.com or cstheory.stackexchange.com ? –  Ozz Apr 15 '13 at 13:17
add comment

1 Answer

From Wikipedia:

Quantum annealing can be compared to simulated annealing (SA), whose "temperature" parameter plays a similar role to QA's tunneling field strength. However, in SA the neighborhood stays the same throughout the search, and the temperature determines the probability of moving to a state of higher "energy". In QA, the tunneling field strength determines instead the neighborhood radius, i.e. the mean distance between the next candidate state and the current candidate state.

In other words, the "tunneling field" and, indeed, the term "quantum" are just metaphors for the finer points of a completely classical (although randomized) algorithm. QA is not inherently connected with actual quantum computers, it just borrows terms from physics to make a point about computational properties.

share|improve this answer
From another question we found that physical implementation of quantum annealing exists (D-Wave quantum computers). I talking about physical implementation, not about metaphors. –  Pavel Katunin Apr 11 '13 at 7:45
add comment

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.