Morphology of ground states of two-dimensional frustration model

Ordering behavior of the two-dimensional Ising spin glass with long-range correlated disorder

The standard short-range two-dimensional Ising spin glass is numerically well accessible, in particular, because there are polynomial-time ground-state algorithms. On the other hand, in contrast to higher dimensional spin glasses, it does not exhibit a rich behavior, i.e., no ordered phase at finite temperature. Here, we investigate whether long-range correlated bonds change this behavior. This would still keep the model numerically well accessible while exhibiting a more interesting behavior. The bonds are drawn from a Gaussian distribution with a two-point correlation for bonds at distance r that decays as (1+r^{2})^{-a/2}, a≥0. We study numerically with exact algorithms the ground-state and domain-wall excitations. Our results indicate that the inclusion of bond correlations still does not lead to a spin-glass order at any finite temperature. A further analysis reveals that bond correlations have a strong effect at local length scales, inducing ferro- and antiferromagnetic domains into the system. The length scale of ferro- and antiferromagnetic order diverges exponentially as the correlation exponent approaches a critical value, a→a_{crit}=0. Thus, our results suggest that the system becomes a ferro- or antiferromagnet only in the limit a→0.

Low-energy states, ground states, and variable frustrations of the finite-size dipolar Cairo lattices

To investigate the influence of geometric frustration on the properties of low-energy configurations of systems of ferromagnetic nanoislands located on the edges of the Cairo lattice, the model of interacting Ising-like magnetic dipoles is used. By the method of complete enumeration, the densities of states of the Cairo pentagonal lattices of a finite number of Ising-like point dipoles are calculated. The calculated ground and low-energy states for systems with a small number of dipoles can be used to solve the problem of searching for the ground states in a system with a relatively large number of dipoles. It is shown that the ground-state energy of the Cairo pentagonal lattices exhibits nonmonotonic behavior on one of the lattice parameters. The lattice parameters can be used to control the degree of geometric frustration. For the studied lattices of a finite number of Ising dipoles on the Cairo lattice in the ground-state configurations, a number of closed pentagons is observed, which are different from the obtained maximum closed pentagons. The magnetic order in the ground-state configurations obeys the ice rule and the quasi-ice rules.

Slow spin dynamics and self-sustained clusters in sparsely connected systems

To identify emerging microscopic structures in low-temperature spin glasses, we study self-sustained clusters (SSC) in spin models defined on sparse random graphs. A message-passing algorithm is developed to determine the probability of individual spins to belong to SSC. We then compare the predicted SSC associations with the dynamical properties of spins obtained from numerical simulations and show that SSC association identifies individual slow-evolving spins. Studies of Erdos-Renyi (ER) and random regular (RR) graphs show that spins belonging to SSC are more stable with respect to spin-flip fluctuations, as suggested by the analysis of fully connected models. Further analyses show that SSC association outperforms local fields in predicting the spin dynamics, specifically the group of slow- and fast-evolving spins in RR graphs, for a wide temperature range close to the spin-glass transition. This insight gives rise to a powerful approach for predicting individual spin dynamics from a single snapshot of an equilibrium spin configuration, namely from limited static information. It also implies that single-sample SSC association carries more information than local fields in describing the state of individual spins, when little information can be extracted from the system's topology.

Backbone structure of the Edwards-Anderson spin-glass model

We study the ground-state spatial heterogeneities of the Edwards-Anderson spin-glass model with both bimodal and Gaussian bond distributions. We characterize these heterogeneities by using a general definition of bond rigidity, which allows us to classify the bonds of the system into two sets, the backbone and its complement, with very different properties. This generalizes to continuous distributions of bonds the well-known definition of a backbone for discrete bond distributions. By extensive numerical simulations we find that the topological structure of the backbone for a given lattice dimensionality is very similar for both discrete and continuous bond distributions. We then analyze how these heterogeneities influence the equilibrium properties at finite temperature and we discuss the possibility that a suitable backbone picture can be relevant to describe spin-glass phenomena.

Preparing ground States of quantum many-body systems on a quantum computer

Preparing the ground state of a system of interacting classical particles is an NP-hard problem. Thus, there is in general no better algorithm to solve this problem than exhaustively going through all N configurations of the system to determine the one with lowest energy, requiring a running time proportional to N. A quantum computer, if it could be built, could solve this problem in time sqrt[N]. Here, we present a powerful extension of this result to the case of interacting quantum particles, demonstrating that a quantum computer can prepare the ground state of a quantum system as efficiently as it does for classical systems.

Exact ground states of large two-dimensional planar Ising spin glasses

Studying spin-glass physics through analyzing their ground-state properties has a long history. Although there exist polynomial-time algorithms for the two-dimensional planar case, where the problem of finding ground states is transformed to a minimum-weight perfect matching problem, the reachable system sizes have been limited both by the needed CPU time and by memory requirements. In this work, we present an algorithm for the calculation of exact ground states for two-dimensional Ising spin glasses with free boundary conditions in at least one direction. The algorithmic foundations of the method date back to the work of Kasteleyn from the 1960s for computing the complete partition function of the Ising model. Using Kasteleyn cities, we calculate exact ground states for huge two-dimensional planar Ising spin-glass lattices (up to 3000;{2} spins) within reasonable time. According to our knowledge, these are the largest sizes currently available. Kasteleyn cities were recently also used by Thomas and Middleton in the context of extended ground states on the torus. Moreover, they show that the method can also be used for computing ground states of planar graphs. Furthermore, we point out that the correctness of heuristically computed ground states can easily be verified. Finally, we evaluate the solution quality of heuristic variants of the L. Bieche approach.

Inference from matrix products: a heuristic spin-glass algorithm

We present an algorithm for finding ground states of two-dimensional spin-glass systems based on ideas from matrix product states in quantum information theory. The algorithm works directly at zero temperature and defines an approximation to the energy whose accuracy depends on a parameter k. We test the algorithm against exact methods on random field and random bond Ising models, and we find that accurate results require a k which scales roughly polynomially with the system size. The algorithm also performs well when tested on small systems with arbitrary interactions, where no fast, exact algorithms exist. The time required is significantly less than Monte Carlo schemes.

Strong dynamical heterogeneities in the violation of the fluctuation-dissipation theorem in spin glasses

We analyze numerically the violation of the fluctuation-dissipation theorem (FDT) in the +/-J Edwards-Anderson (EA) spin-glass model. Using single spin probability densities we reveal the presence of strong dynamical heterogeneities, which correlate with ground-state information. The physical interpretation of the results shows that the spins can be divided into two sets. In 3D, one set forms a compact structure which presents a coarseninglike behavior with its characteristic violation of the FDT, while the other asymptotically follows the FDT. Finally, we compare the dynamical behavior observed in 3D with 2D.

Signature of the ground-state topology in the low-temperature dynamics of spin glasses

We numerically address the issue of how the ground-state topology is reflected in the finite temperature dynamics of the +/-J Edwards-Anderson spin glass model. In this system a careful study of the ground-state configurations allows us to classify spins into two sets: solidary and nonsolidary spins. We show that these sets quantitatively account for the dynamical heterogeneities found in the mean flipping time distribution at finite low temperatures. The results highlight the relevance of taking into account the ground-state topology in the analysis of the finite temperature dynamics of spin glasses.

Checking for optimal solutions in some NP-complete problems

For some weighted NP-complete problems, checking whether a proposed solution is optimal is a nontrivial task. Such is the case for the traveling salesman problem, or the spin-glass problem in three dimensions. In this Letter, we consider the weighted tripartite matching problem, a well known NP-complete problem. We write mean-field finite temperature equations for this model and derive their zero temperature limit. We show that any solution of the zero temperature equations provides an exact absolute ground state of the system. As a consequence, we propose a criterion which can be checked in polynomial time, and such that given a putative optimal solution, if the criterion is satisfied, then the solution is indeed optimal. This criterion is generalized to a class of variants of the multiple traveling salesmen problems.

Worm algorithm for two-dimensional spin glasses

A worm algorithm is proposed for the two-dimensional spin glasses. The method is based on a low-temperature expansion of the partition function. The low-temperature configurations of the spin glass on square lattice can be viewed as strings connecting pairs of frustrated plaquettes. The worm algorithm directly manipulates these strings. It is shown that the worm algorithm is efficient, particularly if free boundary conditions are used. We obtain accurate low-temperature specific heat data consistent with a form c approximately T-2 exp [-2J/( kB T) ] , where T is temperature and J is coupling constant, for the two-dimensional +/- J spin glass.

Spin domains generate hierarchical ground state structure in J = +/-1 spin glasses

Unbiased samples of ground states were generated for the short-range Ising spin glass with J(ij) = +/-1, in three dimensions. Clustering the ground states revealed their hierarchical structure, which is explained by correlated spin domains, serving as cores for macroscopic zero energy "excitations."

Ground-state degeneracies of Ising spin glasses on diamond hierarchical lattices

The total number of ground states for short-range Ising spin glasses, defined on diamond hierarchical lattices of fractal dimensions d=2, 3, 4, 5, and 2.58, is estimated by means of analytic calculations (three last hierarchy levels of the d=2 lattice) and numerical simulations (lower hierarchies for d=2 and all remaining cases). It is shown that in the case of continuous probability distributions for the couplings, the number of ground states is finite in the thermodynamic limit. However, for a bimodal probability distribution (+/-J with probabilities p and 1-p, respectively), the average number of ground states is maximum for a wide range of values of p around p=1 / 2 and depends on the total number of sites at hierarchy level n, Nn. In this case, for all lattices investigated, it is shown that the ground-state degeneracy behaves like exp[h(d)Nn], in the limit Nn large, where h(d) is a positive number which depends on the lattice fractal dimension. The probability of finding frustrated cells at a given hierarchy level n, Fn(p), is calculated analytically (three last hierarchy levels for d=2 and the last hierarchy of the d=3 lattice, with 0<or=p<or=1), as well as numerically (all other cases, with p=1 / 2). Except for d=2, in which case Fn(1 / 2) increases by decreasing the hierarchy level, all other dimensions investigated present an exponential decrease in Fn(1 / 2) for decreasing values of n. For d=2 our results refer to the paramagnetic phase, whereas for all other dimensions considered [which are greater than the lower critical dimension dl (dl approximately 2.5)], our results refer to the spin-glass phase at zero temperature; in the latter cases h(d) increases with the fractal dimension. For n>>1, only the last hierarchies contribute significantly to the ground-state degeneracy; such a dominant behavior becomes stronger for high fractal dimensions. The exponential increase of the number of ground states with the total number of sites is in agreement with the mean-field picture of spin glasses.

Complexity of protein folding

It is believed that the native folded three-dimensional conformation of a protein is its lowest free energy state, or one of its lowest. It is shown here that both a two- and three-dimensional mathematical model describing the folding process as a free energy minimization problem is NP-hard. This means that the problem belongs to a large set of computational problems, assumed to be very hard ("conditionally intractable"). Some of the possible ramifications of this result are speculated upon.