اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSolving Spin Glasses with Optimized Trees of Clustered Spins
137
0
0.0
(
0
)
تأليف
Itay Hen
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We present an algorithm for the optimization and thermal equilibration of spin glasses - or more generally, cost functions of the Ising form $H=sum_{langle i jrangle} J_{ij} s_i s_j + sum_i h_i s_i$, defined on graphs with arbitrary connectivity. The algorithm consists of two repeated steps: i) the optimized construction of a random tree of spin clusters on the input problem graph, and ii) the thermal sampling of the generated tree. The randomly generated trees are constructed so as to optimize a balance between the size of the tree and the complexity required to draw Boltzmann samples from it. We benchmark the algorithm on several classes of problems and demonstrate its advantages over existing approaches.
قيم البحث
اقرأ أيضاً
We propose a mechanism for solving the `negative sign problem---the inability to assign non-negative weights to quantum Monte Carlo configurations---for a toy model consisting of a frustrated triplet of spin-$1/2$ particles interacting antiferromagne
tically. The introduced technique is based on the systematic grouping of the weights of the recently developed off-diagonal series expansion of the canonical partition function [Phys. Rev. E 96, 063309 (2017)]. We show that while the examined model is easily diagonalizable, the sign problem it encounters can nonetheless be very pronounced, and we offer a systematic mechanism to resolve it. We discuss the generalization of the suggested scheme and the steps required to extend it to more general and larger spin models.
Motivated by the recent success of tensor networks to calculate the residual entropy of spin ice and kagome Ising models, we develop a general framework to study frustrated Ising models in terms of infinite tensor networks %, i.e. tensor networks tha
t can be contracted using standard algorithms for infinite systems. This is achieved by reformulating the problem as local rules for configurations on overlapping clusters chosen in such a way that they relieve the frustration, i.e. that the energy can be minimized independently on each cluster. We show that optimizing the choice of clusters, including the weight on shared bonds, is crucial for the contractibility of the tensor networks, and we derive some basic rules and a linear program to implement them. We illustrate the power of the method by computing the residual entropy of a frustrated Ising spin system on the kagome lattice with next-next-nearest neighbour interactions, vastly outperforming Monte Carlo methods in speed and accuracy. The extension to finite-temperature is briefly discussed.
Spin chains with open boundaries, such as the transverse field Ising model, can display coherence times for edge spins that diverge with the system size as a consequence of almost conserved operators, the so-called strong zero modes. Here, we discuss
the fate of these coherence times when the system is perturbed in two different ways. First, we consider the effects of a unitary coupling connecting the ends of the chain; when the coupling is weak and non-interacting, we observe stable long-lived harmonic oscillations between the strong zero modes. Second, and more interestingly, we consider the case when dynamics becomes dissipative. While in general dissipation induces decoherence and loss of information, here we show that particularly simple environments can actually enhance correlation times beyond those of the purely unitary case. This allows us to generalise the notion of strong zero modes to irreversible Markovian time-evolutions, thus defining conditions for {em dissipative strong zero maps}. Our results show how dissipation could, in principle, play a useful role in protocols for storing information in quantum devices.
We solve the growing asymmetric Ising model [Phys. Rev. E 89, 012105 (2014)] in the topologies of deterministic and stochastic (random) scale-free trees predicting its non-monotonous behavior for external fields smaller than the coupling constant $J$
. In both cases we indicate that the crossover temperature corresponding to maximal magnetization decays approximately as $(ln ln N)^{-1}$, where $N$ is the number of nodes in the tree.
Parisis formal replica-symmetry--breaking (RSB) scheme for mean-field spin glasses has long been interpreted in terms of many pure states organized ultrametrically. However, the early version of this interpretation, as applied to the short-range Edwa
rds-Anderson model, runs into problems because as shown by Newman and Stein (NS) it does not allow for chaotic size dependence, and predicts non-self-averaging that cannot occur. NS proposed the concept of the metastate (a probability distribution over infinite-size Gibbs states in a given sample that captures the effects of chaotic size dependence) and a non-standard interpretation of the RSB results in which the metastate is non-trivial and is responsible for what was called non-self-averaging. Here we use the effective field theory of RSB, in conjunction with the rigorous definitions of pure states and the metastate in infinite-size systems, to show that the non-standard picture follows directly from the RSB mean-field theory. In addition, the metastate-averaged state possesses power-law correlations throughout the low temperature phase; the corresponding exponent $zeta$ takes the value $4$ according to the field theory in high dimensions $d$, and describes the effective fractal dimension of clusters of spins. Further, the logarithm of the number of pure states in the decomposition of the metastate-averaged state that can be distinguished if only correlations in a window of size $W$ can be observed is of order $W^{d-zeta}$. These results extend the non-standard picture quantitatively; we show that arguments against this scenario are inconclusive.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
