A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
From near to eternity: Spin-glass planting, tiling puzzles, and constraint-satisfaction problems
2018
Physical review. E
We present a methodology for generating Ising Hamiltonians of tunable complexity and with a priori known ground states based on a decomposition of the model graph into edge-disjoint subgraphs. The idea is illustrated with a spin-glass model defined on a cubic lattice, where subproblems, whose couplers are restricted to the two values -1,+1, are specified on unit cubes and are parametrized by their local degeneracy. The construction is shown to be equivalent to a type of three-dimensional
doi:10.1103/physreve.97.043303
pmid:29758754
fatcat:y2zr4x3jlbd4bcrdrmqdxge7wm