An implementation of a simulated annealing sampler.
A simulated annealing sampler can be used for approximate Boltzmann
sampling or heuristic optimization. This implementation approaches
the equilibrium distribution by performing updates at a sequence of
increasing beta values, beta_schedule, terminating at the target
beta. Each spin is updated once in a fixed order per point in the
beta_schedule according to a Metropolis- Hastings update. When beta
is large the target distribution concentrates, at equilibrium,
over ground states of the model. Samples are guaranteed to match
the equilibrium for long 'smooth' beta schedules.
This requires: dimod
Maintained by: William PC
Keywords: quantum,quantum annealing,boltzmann sampling,heuristic optimization,annealing sampler,dwave,d-wave
ChangeLog: dwave-neal
Homepage:
https://github.com/dwavesystems/dwave-neal
Download SlackBuild:
dwave-neal.tar.gz
dwave-neal.tar.gz.asc (FAQ)
(the SlackBuild does not include the source)
Individual Files: |
README |
dwave-neal.SlackBuild |
dwave-neal.info |
slack-desc |
© 2006-2024 SlackBuilds.org Project. All rights reserved.
Slackware® is a registered trademark of
Patrick Volkerding
Linux® is a registered trademark of
Linus Torvalds