The dynamics of the non-equilibrium Ising model with parallel updates is investigated using a generalized mean field approximation that incorporates multiple two-site correlations at any two time steps, which can be obtained recursively. The proposed method shows significant improvement in predicting local system properties compared to other mean field approximation techniques, particularly in systems with symmetric interactions. Results are also evaluated against those obtained from Monte Carlo simulations. The method is also employed to obtain parameter values for the kinetic inverse Ising modeling problem, where couplings and local field values of a fully connected spin system are inferred from data.
The dynamics of the non-equilibrium Ising model with parallel updates is investigated using a generalized mean field approximation that incorporates multiple two-site correlations at any two time steps, which can be obtained recursively. The proposed method shows significant improvement in predicting local system properties compared to other mean field approximation techniques, particularly in systems with symmetric interactions. Results are also evaluated against those obtained from Monte Carlo simulations. The method is also employed to obtain parameter values for the kinetic inverse Ising modeling problem, where couplings and local field values of a fully connected spin system are inferred from data.
We study a novel variational approach to solve the dynamics of Ising-like discrete spin systems. The equations are derived under mean-field approximations based on the cluster variational method. Comparison with the actual Glauber dynamics of models defined on Erdos-R\\'enyi random graphs show that some of these approximations are extremely accurate, both at equilibrium and in the off-equilibrium regime, providing the same result of the Monte Carlo simulation in a much shorter time. The models studied are the ferromagnetic kinetic Ising model (both with symmetric and partially asymmetric interactions), the random field Ising model and the Viana-Bray model. Only for the latter model we find some small discrepancies in the very low temperature phase, probably due to the existence of a large number of metastable states.
We consider the problem of predicting the spin states in a kinetic Ising model when spin trajectories are observed for only a finite fraction of sites. In a Bayesian setting, where the probabilistic model of the spin dynamics is assumed to be known, the optimal prediction can be computed from the conditional (posterior) distribution of unobserved spins given the observed ones. Using the replica method, we compute the error of the Bayes optimal predictor for parallel discrete time dynamics in a fully connected spin system with non-symmetric random couplings. The results, exact in the thermodynamic limit, agree very well with simulations of finite spin systems.
The inverse Ising problem consists in inferring the coupling constants of an Ising model given the correlation matrix. The fastest methods for solving this problem are based on mean-field approximations, but which one performs better in the general case is still not completely clear. In the first part of this work, I summarize the formulas for several mean- field approximations and I derive new analytical expressions for the Bethe approximation, which allow to solve the inverse Ising problem without running the Susceptibility Propagation algorithm (thus avoiding the lack of convergence). In the second part, I compare the accuracy of different mean field approximations on several models (diluted ferromagnets and spin glasses) defined on random graphs and regular lattices, showing which one is in general more effective. A simple improvement over these approximations is proposed. Also a fundamental limitation is found in using methods based on TAP and Bethe approximations in presence of an external field.
We use a recently developed quantum simulation approach to study the properties of a three-dimensional Ising model consisting of S = 1/2 quantum spins localized at the sites of a simple cubic lattice. We assume nearest-neighbor interaction between spins with an exchange interaction that can be either ferromagnetic or antiferromagnetic. It is found that the computational method quickly converges towards the expected equilibrium spin configurations. The resulting spontaneous magnetization curves corresponding to the two types of magnetic interactions under consideration were found to be almost identical to the ones obtained via quantum mean field theory at all temperatures. The derived total energies, total free energies, magnetic entropies and specific heats per mole of spins show no sizeable differences from known theoretical values. Furthermore, the results of the simulations for two different 3D Ising systems containing 4×4×4 and 20×20×20 spins localized at the sites of a simple cubic lattice were found to be almost identical to each other. This finding suggests that the self-consistent algorithm approach of the current simulation method allows one to obtain the physical bulk properties of a large magnetic system by relying on simulations of a much smaller spin system sample. Therefore, the method presently considered appears to be not only very accurate as gauged by comparison to mean field theory, but also able to greatly increase the speed of simulations.
Because of its complexity, the 3D Ising model has not been given an exact analytic solution so far, as well as the 2D Ising in non zero external field conditions. In real materials the phase transition creates a discontinuity. We analysed the Ising model that presents similar discontinuities. We use Monte Carlo methods with a single spin change or a spin cluster change to calculate macroscopic quantities, such as specific heat and magnetic susceptibility. We studied the differences between these methods. Local MC algorithms (such as Metropolis) perform poorly for large lattices because they update only one spin at a time, so it takes many iterations to get a statistically independent configuration. More recent spin cluster algorithms use clever ways of finding clusters of sites that can be updated at once. The single cluster method is probably the best sequential cluster algorithm. We also used the entropic sampling method to simulate the density of states. This method takes into account all possible configurations, not only the most probable. The entropic method also gives good results in the 3D case. We studied the usefulness of distributed computing for Ising model. We established a parallelization strategy to explore Metropolis Monte Carlo simulation and Swendsen-Wang Monte Carlo simulation of this spin model using the data parallel languages on different platform. After building a computer cluster we made a Monte Carlo estimation of 2D and 3D Ising thermodynamic properties and compare the results with the sequential computing. In the same time we made quantitative analysis such as speed up and efficiency for different sets of combined parameters (e.g. lattice size, parallel algorithms, chosen model).
The study of quantum dynamics is an increasingly important aspect of atomic, molecular and optical physics, as well as condensed-matter physics and other disciplines. It is essential in order to understand non-equilibrium phenomena which do not fit within the framework of equilibrium thermodynamics, such as many-body localization, dynamical quantum phase transitions, and non-equilibrium steady states in driven-dissipative systems. However, the exact calculation of dynamical observables is extremely difficult in general for several reasons, which makes it challenging for theoretical predictions and analyses to keep pace with rapidly advancing experiments. In this thesis I use and develop several computational methods to investigate the dynamics of quantum many-body systems, with the two goals of better understanding the evolution of local observables and correlation functions in spin and Fermion systems as well as creating and testing more effective numerical methods for solving quantum dynamics problems. I explore quantum dynamics by using Hamiltonian parameter quenches in several commonly-used models in AMO physics and elsewhere: the Fermi-Hubbard model, the XXZ model, and the transverse-Ising model. The first represents a system of short-range interacting Fermions, while the latter two represent spin systems with different spin-spin couplings and magnetic field terms. All of these models can be realized in current experiments. First, I derive an exact solution for an extreme interaction quench in the Fermi-Hubbard model, from a strongly-interacting initial state to a noninteracting final Hamiltonian. From this result I show that there are nontrivial transient connected correlations, despite the fact that the system has very high temperature and a noninteracting Hamiltonian. Those features would suppress such correlations in equilibrium, but the dynamical correlations are still significant. Then, I develop and examine two numerical methods for solving dynamics of the spin expectation values and correlation functions in the transverse-Ising and XXZ models. Both methods rely on approximating a thermodynamically large system with a much smaller and more computationally tractable cluster of lattice sites, or a series of clusters. The first method is a dynamical numerical linked cluster expansion (NLCE). NLCEs have already been used successfully on systems in thermodynamic equilibrium, and I extended the technique to directly compute the dynamics of an observable after a quantum quench. I review the general NLCE method, describe my dynamical variant of it, and compute the quench dynamics of spin and correlation observables in the transverse-Ising and XXZ models. The second method, which I term the adaptive-boundary cluster method, relies on recently refined bounds on information propagation in quantum systems to choose a cluster of lattice sites that minimizes the finite size error bound of a dynamical computation. I briefly review these bounds, and describe a new algorithm which uses them to construct a cluster whose boundary is chosen according to a related error estimate. Such an adaptive-boundary cluster has the property that there exists a computable upper bound on the finite size error of observables measured at the cluster center, and this error bound is nearly minimal when compared to that of other clusters of the same size. I then compute the quench dynamics of spin and correlation observables in the transverse-Ising model using the adaptive boundary clusters. I apply this method to both uniform and strongly disordered systems. To evaluate the effectiveness of both dynamical NLCE and adaptive-boundary clusters, I compare the results obtained using them to results from a standard and general purpose numerical method: exact solvers applied a rectangular cluster with periodic boundary conditions. Both of the new methods usually converge faster and are more accurate than the standard method for comparable cluster sizes. This thesis illustrates that choosing numerical methods which take advantage of the geometric and entanglement structure of the initial state and Hamiltonian can substantially enhance our ability to study quantum dynamics, by reducing the computational cost of numerically exact solutions. I conclude with a discussion of various avenues for future research to build on this work.