SEARCH · Engineering Papers
Results for “Ising models”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Learning Planar Ising Models Software
Learning Planar Ising Models is a software package written in Matlab for learning relationships among variable in a dataset using graphical models. The software package implements a generally-applicable algorithm for learning planar Ising models from any multivariate dataset. The code provides an algorithm for learning the best planar Ising model to approximate an arbitrary collection of binary random variables (possibly from sample data). Given the set of all pairwise correlations among variables, we select a planar graph and optimal planar Ising model defined on this graph to best approximate that set of correlations. The software includes demonstrations of the algorithm in simulations and for applications on publicly available datasets. Details of the algorithm, demonstration simulations, and applications are given in Johnson, et al; 2016. Reference: Johnson, J. K., Oyen, D., Chertkov, M., and Netrapalli, P. (2016). Learning planar Ising models. Journal of Machine Learning Research.
Majorana chain and Ising model - (non-invertible) translations, anomalies, and emanant symmetries
We study the symmetries of closed Majorana chains in 1+1d, including the translation, fermion parity, spatial parity, and time-reversal symmetries. The algebra of the symmetry operators is realized projectively on the Hilbert space, signaling anomalies on the lattice, and constraining the long-distance behavior. In the special case of the free Hamiltonian (and small deformations thereof), the continuum limit is the 1+1d free Majorana CFT. Its continuum chiral fermion parity (-1)^{F_L} ( − 1 ) F L emanates from the lattice translation symmetry. We find a lattice precursor of its mod 8 ’t Hooft anomaly. Using a Jordan-Wigner transformation, we sum over the spin structures of the lattice model (a procedure known as the GSO projection), while carefully tracking the global symmetries. In the resulting bosonic model of Ising spins, the Majorana translation operator leads to a non-invertible lattice translation symmetry at the critical point. The non-invertible Kramers-Wannier duality operator of the continuum Ising CFT emanates from this non-invertible lattice translation of the transverse-field Ising model.
Paradigm for approaching the forbidden spontaneous phase transition in the one-dimensional Ising model at a fixed finite temperature
The Ising model describes collective behaviors such as phase transitions and critical phenomena in various physical, biological, economical, and social systems. It is well known that spontaneous phase transition at finite temperature does not exist in the Ising model with short-range interactions in one dimension. Yet, little is known about whether this forbidden phase transition can be approached arbitrarily closely—at fixed finite temperature. Here I use symmetry analysis of the transfer matrix to reveal the existence of spontaneous ultranarrow phase crossover (UNPC) at finite temperature in one class of one-dimensional Ising models on decorated two-leg ladders, in which the crossover temperature T 0 is determined solely by on-rung interactions and decorations, while the crossover width 2 δ T is independently, exponentially reduced ( δ T = 0 means a genuine phase transition) by on-leg interactions and decorations. These findings establish a simple ideal paradigm for realizing an infinite number of one-dimensional Ising systems with spontaneous UNPC at desirable T 0 , which would be characterized in routine laboratory measurements as a genuine first-order phase transition with large latent heat thanks to the ultranarrow δ T (say less than one nanokelvin), paving a way to push the limit in our understanding of phase transitions and the dynamical actions of frustration arbitrarily close to the forbidden regime. Published by the American Physical Society 2024
Tractable minor-free generalization of planar zero-field Ising models
In this work, we present a new family of zero-field Ising models over N binary variables/spins obtained by consecutive 'gluing' of planar and O(1)-sized components and subsets of at most three vertices into a tree. The polynomial time algorithm of the dynamic programming type for solving exact inference (computing partition function) and exact sampling (generating i.i.d. samples) consists of sequential application of an efficient (for planar) or brute-force (for O(1)-sized) inference and sampling to the components as a black box. To illustrate the utility of the new family of tractable graphical models, we first build a polynomial algorithm for inference and sampling of zero-field Ising models over K 33 -minor-free topologies and over K 5 -minor-free topologies—both of which are extensions of the planar zero-field Ising models—which are neither genus- nor treewidth-bounded. Second, we empirically demonstrate an improvement in the approximation quality of the NP-hard problem of inference over the square-grid Ising model in a node-dependent nonzero 'magnetic' field.
Topological and magnetic phase transitions in the bilayer Kitaev-Ising model
We investigate the phase diagram of a bilayer Kitaev honeycomb model with Ising interlayer interactions, deriving effective models via perturbation theory and performing Majorana mean-field theory calculations. We show that a diverse array of magnetic and topological phase transitions occur, depending on the direction of the interlayer Ising interaction and the relative sign of Kitaev interactions. When two layers have the same sign of the Kitaev interaction, a first-order transition from a Kitaev spin liquid to a magnetically ordered state takes place. The magnetic order points along the Ising axis and it is (anti)ferromagnetic for (anti)ferromagnetic Kitaev interactions. However, when two layers have opposite signs of the Kitaev interaction, we observe a notable weakening of magnetic ordering tendencies and the Kitaev spin liquid survives up to a remarkably larger interlayer exchange. Our mean-field analysis suggests the emergence of an intermediate gapped ℤ 2 spin-liquid state, which eventually becomes unstable upon vison condensation. The confined phase is described by a highly frustrated 120° compass model. We furthermore use perturbation theory to study the model with the Ising axis pointing along the $\hat{z}$ axis or lying in the 𝑥𝑦 plane. In both cases, our analysis reveals the formation of one-dimensional Ising chains, which remain decoupled in perturbation theory, resulting in a subextensive ground-state degeneracy. Our results highlight the interplay between topological order and magnetic ordering tendencies in bilayer quantum spin liquids.
Simulating Heisenberg interactions in the Ising model with strong drive fields
The time evolution of an Ising model with large driving fields over discrete time intervals is shown to be reproduced by an effective XXZ-Heisenberg model at leading order in the inverse field strength. For specific orientations of the drive field, the dynamics of the XXX-Heisenberg model is reproduced. Finally, these approximate equivalences, valid above a critical driving field strength set by dynamical phase transitions in the Ising model, are expected to enable quantum devices that natively evolve qubits according to the Ising model to simulate more complex systems.
A Note on Exponential Decay in the Random Field Ising Model
For the two-dimensional random field Ising model (RFIM) with bimodal (i.e., two-valued) external field, we prove exponential decay of correlations either (i) when the temperature is larger than the critical temperature of the Ising model without external field and the magnetic field strength is small or (ii) at any temperature when the magnetic field strength is sufficiently large. Unlike previous work on exponential decay, our approach is not based on cluster expansions but rather on arguably simpler methods; these combine an analysis of the Kertész line and a coupling of Ising measures (and also their random cluster representations) with different boundary conditions. We also show similar but weaker results for the RFIM with a general field distribution and in any dimension.
Learning planar Ising models
Inference and learning of graphical models are both well-studied problems in statistics and machine learning that have found many applications in science and engineering. However, exact inference is intractable in general graphical models, which suggests the problem of seeking the best approximation to a collection of random variables within some tractable family of graphical models. In this paper, we focus on the class of planar Ising models, for which exact inference is tractable using techniques of statistical physics. Based on these techniques and recent methods for planarity testing and planar embedding, we propose a greedy algorithm for learning the best planar Ising model to approximate an arbitrary collection of binary random variables (possibly from sample data). Given the set of all pairwise correlations among variables, we select a planar graph and optimal planar Ising model defined on this graph to best approximate that set of correlations. Finally, we demonstrate our method in simulations and for two applications: modeling senate voting records and identifying geo-chemical depth trends from Mars rover data.
Computing the Critical Temperature of the Affine-Transformed $D=3$ Ising Model Using Masked Autoregressive Flow
The simple Ising model provides a rich environment to build and study lattice field theories. As part of an ongoing project to construct a conformal field theory (CFT) on an arbitrarily curved manifold, in this work we develop methods to measure the critical temperature $β_c$ of the affine-transformed Ising model on the face-centered cubic (FCC) lattice. The main challenge in this endeavor is finding a computationally efficient and accurate method of interpolating and extrapolating Monte Carlo observables with respect to coupling coefficients and temperature. Herein, we compare two such methods. A traditional statistical approach uses the multiple histogram (MH) method, while a newer machine learning approach uses a masked autoregressive flow (MAF) to estimate the underlying probability density function of a set of observables. While the MH method is specifically designed to interpolate and extrapolate Monte Carlo observables, we find that MAF is a viable alternative for measuring $β_c$ with a computational cost that scales more favorably. Furthermore, we comment on additional advantages of MAF relevant to our work, such as extrapolating in system volume.
Record acceleration of the two-dimensional Ising model using a high-performance wafer-scale engine
The versatility and wide-ranging applicability of the Ising model, originally introduced to study phase transitions in magnetic materials, have made it a cornerstone in statistical physics and a valuable tool for evaluating the performance of emerging computer hardware. Here, we present a novel implementation of the two-dimensional Ising model on Cerebras Wafer-Scale Engine (WSE) – a revolutionary processor that is opening new frontiers in computing. In our deployment of the checkerboard algorithm, we optimized the Ising model to take advantage of the unique WSE architecture. Specifically, we employed a compressed bit representation storing 16 spins on each int16 word, and efficiently distributed the spins over the processing units enabling seamless weak scaling and limiting communications to only immediate neighboring units. Our implementation can handle up to 754 simulations in parallel, achieving an aggregate of over 61.8 trillion flip attempts per second for Ising models with up to 200 million spins. This represents a gain of up to 148 times over previously reported single-devices with a highly optimized implementation on NVIDIA V100 and up to 88 times in productivity compared to NVIDIA H100. Our findings highlight the significant potential of the WSE in scientific computing, particularly in the field of materials modeling.
Quantum Simulation of an Open System: A Dissipative 1+1D Ising Model
The 1+1D Ising model is an ideal benchmark for quantum algorithms, as it is very well understood theoretically. This is true even when expanding the model to include complex coupling constants. In this work, we implement quantum algorithms designed for the simulation of open or complex coupling quantum field theories on IBM devices with a focus on the measurement of the Lee-Yang edge singularity. This feature corresponds (at large volumes) to a phase transition, and our successful reproduction of the transition represents a non-trivial test for current hardware and its ability to distinguish features of interest in quantum field theories.
Optimal structure and parameter learning of Ising models
Reconstruction of the structure and parameters of an Ising model from binary samples is a problem of practical importance in a variety of disciplines, ranging from statistical physics and computational biology to image processing and machine learning. The focus of the research community shifted toward developing universal reconstruction algorithms that are both computationally efficient and require the minimal amount of expensive data. Here, we introduce a new method, interaction screening, which accurately estimates model parameters using local optimization problems. The algorithm provably achieves perfect graph structure recovery with an information-theoretically optimal number of samples, notably in the low-temperature regime, which is known to be the hardest for learning. Here, the efficacy of interaction screening is assessed through extensive numerical tests on synthetic Ising models of various topologies with different types of interactions, as well as on real data produced by a D-Wave quantum computer. Finally, this study shows that the interaction screening method is an exact, tractable, and optimal technique that universally solves the inverse Ising problem.
Classical combinatorial optimization scaling for random Ising models on 2D heavy-hex graphs
Motivated by near term quantum computing hardware limitations, combinatorial optimization problems that can be addressed by current quantum algorithms and noisy hardware with little or no overhead are used to probe capabilities of quantum algorithms such as the quantum approximate optimization algorithm. In this study, a specific class of near term quantum computing hardware defined combinatorial optimization problems, Ising models on heavy-hex graphs both with and without geometrically local cubic terms, are examined for their classical computational hardness via empirical computation time scaling quantification. Specifically the time-to-solution (TTS) metric using the classical heuristic simulated annealing is measured for finding optimal variable assignments (ground states), as well as the time required for the optimization software Gurobi to find an optimal variable assignment. Because of the sparsity of these Ising models, the classical algorithms are able to find optimal solutions efficiently even for large instances (i.e. 100 000 spin variables). The Ising models both with and without geometrically local cubic terms exhibit average-case linear-time or weakly quadratic scaling when solved exactly using Gurobi, and the Ising models with no cubic terms show evidence of exponential-time TTS scaling when sampled using simulated annealing. These findings point to the necessity of developing and testing more complex, namely more densely connected, optimization problems in order for quantum computing to ever have a practical advantage over classical computing. Our results are another illustration that different classical algorithms can indeed have exponentially different running times, thus making the identification of the best practical classical technique important in any quantum computing vs. classical computing comparison.
The random-bond Ising model in 2.01 and 3 dimensions
We consider the Ising model between 2 and 4 dimensions perturbed by quenched disorder in the strength of the interaction between nearby spins. In the interval 2 < d < 4 this disorder is a relevant perturbation that drives the system to a new fixed point of the renormalization group. At d = 2 such disorder is marginally irrelevant and can be studied using conformal perturbation theory. Combining conformal perturbation theory with recent results from the conformal bootstrap we compute some scaling exponents in an expansion around d = 2. If one trusts these computations also in d =3, one finds results consistent with experimental data and Monte Carlo simulations. In addition, we perform a direct uncontrolled computation in d= 3 using new results for low-lying operator dimensions and OPE coefficients in the 3d Ising model. We compare these new methods with previous studies. Finally, we comment about the O(2) model in d = 3, where we predict a large logarithmic correction to the infrared scaling of disorder.
Frustration Properties of the 1D Ising Model
We analyze frustration properties of the Ising model for a 1D monatomic equidistant lattice in an external uniform magnetic field considering exchange interactions of atomic spins at the sites of the first (nearest) and second neighbors. Exact analytic expressions for thermodynamic and magnetic characteristics of the system, as well as for the Fourier transform of the pair spin–spin correlation function and magnetic diffused scattering wavevectors, were obtained by the method of the Kramers–Wannier transfer matrix considering the exchange interaction between spins at the nearest-neighbor sites in an external magnetic field, as well as the exchange interaction between spins at the second-neighbor sites in zero magnetic field. The criteria for the emergence of magnetic frustration in the presence of competition not only between exchange-interaction energies, but also between these energies and the external magnetic field energy are formulated. The frustration points and the values of frustration magnetic fields depending on the magnitudes and signs of the exchange interaction are determined. The distinguishing features of this model in the frustration regime and its vicinity are analyzed. The set of characteristic features inherent in observables for systems with magnetic frustrations is considered and analyzed. It is shown that the inclusion of competing exchange interactions at the first- and second-neighbor sites makes it possible to describe the behavior of the magnetic diffused scattering wavevector for commensurate, incommensurate, and lock-in structures.
Absence of Dobrushin States for 2d Long-Range Ising Models
We consider the two-dimensional Ising model with long-range pair interactions of the form J{sub xy}∼|x−y|{sup −α} with α>2, mostly when J{sub xy}≥0. We show that Dobrushin states (i.e. extremal non-translation-invariant Gibbs states selected by mixed ± boundary conditions) do not exist. We discuss possible extensions of this result in the direction of the Aizenman–Higuchi theorem, or concerning fluctuations of interfaces. We also mention the existence of rigid interfaces in two long-range anisotropic contexts.
Probing strong correlations with light scattering: Example of the quantum Ising model
In this article we calculate the nonlinear susceptibility and the resonant Raman cross section for the paramagnetic phase of the ferromagnetic quantum Ising model in one dimension. In this region the spectrum of the Ising model has a gap m. The Raman cross section has a strong singularity when the energy of the outgoing photon is at the spectral gap ω f ≈ m and a square root threshold when the frequency difference between the incident and outgoing photons ω i ₋ω f ≈2m. Finally, the latter feature reflects the fermionic nature of the Ising model excitations.