ترغب بنشر مسار تعليمي؟ اضغط هنا

The standard two-dimensional Ising spin glass does not exhibit an ordered phase at finite temperature. Here, we investigate whether long-range correlated bonds change this behavior. The bonds are drawn from a Gaussian distribution with a two-point co rrelation 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 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/antiferromagnetic domains into the system. The length scale of ferro/antiferromagnetic order diverges exponentially as the correlation exponent approaches a critical value, $a to a_c = 0$. Thus, our results suggest that the system becomes a ferro/antiferromagnet only in the limit $a to 0$.
We study spin glass behavior in a random Ising Coulomb antiferromagnet in two and three dimensions using Monte Carlo simulations. In two dimensions, we find a transition at zero temperature with critical exponents consistent with those of the Edwards Anderson model, though with large uncertainties. In three dimensions, evidence for a finite-temperature transition, as occurs in the Edwards-Anderson model, is rather weak. This may indicate that the sizes are too small to probe the asymptotic critical behavior, or possibly that the universality class is different from that of the Edwards-Anderson model and has a lower critical dimension equal to three.
We study the typical (median) value of the minimum gap in the quantum version of the Exact Cover problem using Quantum Monte Carlo simulations, in order to understand the complexity of the quantum adiabatic algorithm (QAA) for much larger sizes than before. For a range of sizes, N <= 128, where the classical Davis-Putnam algorithm shows exponential median complexity, the QAA shows polynomial median complexity. The bottleneck of the algorithm is an isolated avoided crossing point of a Landau-Zener type (collision between the two lowest energy levels only).
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا