General Ising graph simulated annealing solver
Project description
> :warning: dwave-neal is deprecated in favor of dwave-samplers.
dwave-neal
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.
For more information, see Kirkpatrick, S.; Gelatt Jr, C. D.; Vecchi, M. P. (1983). “Optimization by Simulated Annealing”. Science. 220 (4598): 671–680
Example Usage
import neal
sampler = neal.SimulatedAnnealingSampler()
h = {0: -1, 1: -1}
J = {(0, 1): -1}
sampleset = sampler.sample_ising(h, J)
Installation
To install:
pip install dwave-neal
To build from source:
pip install -r requirements.txt
python setup.py build_ext --inplace
python setup.py install
License
Released under the Apache License 2.0. See LICENSE file.
Contributing
Ocean’s contributing guide has guidelines for contributing to Ocean packages.
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Hashes for dwave_neal-0.6.0-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 8b7d89f0c52de6ac80e0f580ec272f6409b1cf9edb12250d22429425a13bd935 |
|
MD5 | 0c369b3dd9232192d8557b187856c880 |
|
BLAKE2b-256 | 64f232c45bcc42196f69f101549abf35fc6019ef3488c8d4082fbcab22d77274 |