Computational hardness of spin-glass problems with tile-planted solutions.

  title={Computational hardness of spin-glass problems with tile-planted solutions.},
  author={Dilina Perera and Firas Hamze and Jack Raymond and Martin Weigel and Helmut G. Katzgraber},
  journal={Physical review. E},
  volume={101 2-1},
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 the ground state of the entire problem is known a priori. Using population annealing Monte Carlo, we compare the typical hardness… Expand
Computational Overhead of Locality Reduction in Binary Optimization Problems
Recently, there has been considerable interest in solving optimization problems by mapping these onto a binary representation, sparked mostly by the use of quantum annealing machines. Such binaryExpand
Adding color: Visualization of energy landscapes in spin glasses
A classification scheme is developed that categorizes highly-degenerate minima of spin glasses based on similarity and accessibility of the individual states to condense the information pertained in different dales of the energy landscape to a single representation. Expand
Quadratic Unconstrained Binary Optimisation via Quantum-Inspired Annealing
Joseph Bowles, Alexandre Dauphin, Patrick Huembeli, José Martinez, and Antonio Acin 4 ICFO Institut de Ciencies Fotoniques, The Barcelona Institute of Science and Technology, CastelldefelsExpand
Chook - A comprehensive suite for generating binary optimization problems with planted solutions
Chook is presented, an open-source Python-based tool to generate discrete optimization problems of tunable complexity with a priori known solutions for higher-order (beyond quadratic) binary optimization problems. Expand
Boosting Monte Carlo simulations of spin glasses using autoregressive neural networks.
A neural autoregressive distribution estimator (NADE) is employed to boost Markov chain Monte Carlo (MCMC) simulations of a paradigmatic classical model of spin-glass theory, namely, the two-dimensional Edwards-Anderson Hamiltonian. Expand


From near to eternity: Spin-glass planting, tiling puzzles, and constraint-satisfaction problems.
By varying the proportions of subproblem types, the Hamiltonian can span a dramatic range of typical computational complexity, from fairly easy to many orders of magnitude more difficult than prototypical bimodal and Gaussian spin glasses in three space dimensions. Expand
Patch-planting spin-glass solution for benchmarking.
An algorithm to generate spin-glass instances with planted solutions of arbitrary size and structure is introduced and the scaling of the typical computational complexity of these planted instances with various numbers of patches and patch sizes is investigated and compared to random instances. Expand
Probing for quantum speedup in spin-glass problems with planted solutions
The availability of quantum annealing devices with hundreds of qubits has made the experimental demonstration of a quantum speedup for optimization problems a coveted, albeit elusive goal. GoingExpand
Practical engineering of hard spin-glass instances
Recent technological developments in the field of experimental quantum annealing have made prototypical annealing optimizers with hundreds of qubits commercially available. The experimentalExpand
Optimization of population annealing Monte Carlo for large-scale spin-glass simulations
Various ways of optimizing population annealing Monte Carlo are presented using 2-local spin-glass Hamiltonians as a case study to demonstrate how the algorithm can be optimized from an implementation, algorithmic accelerator, as well as scalable parallelization point of view. Expand
Quantum annealing with manufactured spins
This programmable artificial spin network bridges the gap between the theoretical study of ideal isolated spin networks and the experimental investigation of bulk magnetic samples, and may provide a practical physical means to implement a quantum algorithm, possibly allowing more-effective approaches to solving certain classes of hard combinatorial optimization problems. Expand
The 2D±J Ising spin glass: exact partition functions in polynomial time
Abstract We describe an exact integer algorithm to compute the partition function of a two-dimensional ±J Ising spin glass. The algorithm takes as input a set of quenched random bonds on the squareExpand
Equation Planting: A Tool for Benchmarking Ising Machines
  • I. Hen
  • Computer Science, Physics
  • 2019
It is shown how the proposed technique, which is referred to as `equation planting,' can serve as a useful tool for evaluating the utility of Ising solvers functioning either as optimizers or as ground-state samplers, and further argues that equation-planted problems can be used to probe the mechanisms underlying the operation of ising machines. Expand
On the computational complexity of Ising spin glass models
In a spin glass with Ising spins, the problems of computing the magnetic partition function and finding a ground state are studied. In a finite two-dimensional lattice these problems can be solved byExpand
Optimised simulated annealing for Ising spin glasses
A generic code for any choice of couplings, an optimised code for bipartite graphs, and highly optimised implementations using multi-spin coding for graphs with small maximum degree and discrete couplings with a finite range are provided. Expand