Computational hardness of spin-glass problems with tile-planted solutions
Computational hardness of spin-glass problems with tile-planted solutions
We investigate the computational hardness of spin-glass instances on a square lattice, generated via a recently introduced tunable and scalable approach for planting solutions. The method relies on partitioning the problem graph into edge-disjoint subgraphs, and planting frustrated, elementary subproblems that share a common local ground state, which guarantees that …