🍰 Compiling your code to an Ising Hamiltonian so you don't have to!
This library was a final project for Stanford's graduate statistical mechanics class. The Ising model, despite its simplicity, has a rich array of properties that allow for universal computation. Each elementary Boolean logic gate can be implemented as an Ising system of 2-4 spins. This library allows you to compile a sequence of Boolean logic gates into a spin system where the result of the computation is encoded in the ground state of the Hamiltonian. I provide several demonstrations of compiling complex circuits into Ising spin systems and use Monte Carlo simulations to show that the compiled circuits encode the desired computations.
See the paper for more details.
See this example notebook for demonstrations of how this library can be used.