arXiv subjects

Ran Yaacoby

Publications and source records attributed to Ran Yaacoby.

5 recordsLinked to original sources

arXiv2023

Metastability of Discrete-Symmetry Flocks

We study the stability of the ordered phase of flocking models with a scalar order parameter. Using both the active Ising model and a hydrodynamic description, we show that droplets of particles moving in the direction opposite to that of the ordered phase nucleate and grow. We characterize analytically this self-similar growth and demonstrate that droplets spread ballistically in all directions. Our results imply that, in the thermodynamic limit, discrete-symmetry flocks -- and, by extension, continuous-symmetry flocks with rotational anisotropy -- are metastable in all dimensions.

cond-mat.soft↗

arXiv2022

Eigenvalue crossing as a phase transition in relaxation dynamics

When a system's parameter is abruptly changed, a relaxation towards the new equilibrium of the system follows. We show that a crossing between the second and third eigenvalues of the relaxation matrix results in a relaxation trajectory singularity, which is analogous to a first-order equilibrium phase transition. We demonstrate this in a minimal 4-state system and in the thermodynamic limit of the 1D Ising model.

cond-mat.stat-mech↗

arXiv2022

Far from equilibrium relaxation in the weak coupling limit

It is commonly assumed that a large system, weakly coupled to a thermal environment through its boundaries, relaxes quasistatically towards the new equilibrium even when the temperature of the environment changes abruptly. Here we show how this intuitive picture can break down for discrete energy systems, even in the case of infinitely weak coupling. We provide an example in the Ising chain, showing how the interaction among degrees of freedom can create corrugated energy landscapes that are responsible for far-from-equilibrium and allow anomalous relaxation effects to survive infinitely weak couplings.

cond-mat.stat-mech↗

arXiv2021

Relaxation shortcuts through boundary coupling

When a hot system cools down faster than an equivalent cold one, it exhibits the Mpemba Effect. This counterintuitive phenomenon was observed in several systems including water, magnetic alloys and polymers. In most experiments the system is coupled to the bath through its boundaries, but all theories so far assumed bulk coupling. Here we build a general framework for boundary coupling relaxation and show that the Mpemba effect persists in these cases. Surprisingly, it can survive even an arbitrarily weak couplings. An example is given in the Ising antiferromagnetic chain.

cond-mat.stat-mech↗

arXiv2021

A comparison between D-wave and a classical approximation algorithm and a heuristic for computing the ground state of an Ising spin glass

Finding the ground state of an Ising-spin glass on general graphs belongs to the class of NP-hard problems, widely believed to have no efficient polynomial-time algorithms for solving them. An approach developed in computer science for dealing with such problems is to devise approximation algorithms that run in polynomial time, and provide solutions with provable guarantees on their quality in terms of the optimal unknown solution. Recently, several algorithms for the Ising-spin glass problem on a graph that provide different approximation guarantees were introduced albeit without implementation. Also recently, D-wave company constructed a physical realization of an adiabatic quantum computer, and enabled researchers to access it. D-wave is particularly suited for computing an approximation for the ground state of an Ising spin glass on its chimera graph -- a graph with bounded degree. In this work, we compare the performance of a recently developed approximation algorithm for solving the Ising spin glass problem on graphs of bounded degree against the D-wave computer. We also compared a heuristic tailored specifically to handle the fixed D-wave chimera graph. D-wave computer was able to find better approximations to all the random instances we studied. Furthermore the convergence times of D-wave were also significantly better. These results indicate the merit of D-wave computer under certain specific instances. More broadly, our method is relevant to other performance comparison studies. We suggest that it is important to compare the performance of quantum computers not only against exact classical algorithms with exponential run-time scaling, but also to approximation algorithms with polynomial run-time scaling and a provable guarantee on performance.

cond-mat.dis-nn↗