SlackBuilds Repository

15.0 > Academic > penaltymodel (1.0.2)

  One approach to solve a constraint satisfaction problem (CSP) using
an Ising model or a QUBO, is to map each individual constraint in
the CSP to a "small" Ising model or QUBO. This mapping is called
a penalty model.

Imagine that we want to map an AND clause to a QUBO. In other words,
we want the solutions to the QUBO (the solutions that minimize the
energy) to be exactly the valid configurations of an AND gate. Let z =
AND(x_1, x_2).

Optional building mode set with environment variables:
- TESTS=yes, performs tests. Requires: dimod, python3-numpy,
networkx, python3-scipy, homebase, lapack.

Maintained by: William PC
Keywords: quantum,quantum annealing,constraint satisfaction problem,Ising model,QUBO,dwave,d-wave
ChangeLog: penaltymodel


Source Downloads:
penaltymodel-1.0.2.tar.gz (26c6d33ac5a17620c4d6de76985cc552)

Download SlackBuild:
penaltymodel.tar.gz.asc (FAQ)

(the SlackBuild does not include the source)

Validated for Slackware 15.0

See our HOWTO for instructions on how to use the contents of this repository.

Access to the repository is available via:
ftp git cgit http rsync

© 2006-2023 Project. All rights reserved.
Slackware® is a registered trademark of Patrick Volkerding
Linux® is a registered trademark of Linus Torvalds