SEARCH · Engineering Papers
Results for “Ising Model”
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.
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.
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.
Strong-coupling expansion of multi-band interacting models: Mapping onto the transverse-field J 1 - J 2 Ising model
We investigate a class of two-dimensional two-band microscopic models in which the inter-band repulsive interactions play the dominant role. We first demonstrate three different schemes of constraining the ratios between the three types of inter-band interactions – density-density, spin exchange, and pair-hopping – that render the model free of the fermionic sign-problem for any filling and, consequently, amenable to efficient Quantum Monte Carlo simulations. We then study the behavior of these sign-problem-free models in the strong-coupling regime. In the cases where spin-rotational invariance is preserved or lowered to a planar symmetry, the strong-coupling ground state is a quantum paramagnet. However, in the case where there is only a residual Ising symmetry, the strong-coupling expansion maps onto the transverse-field J 1 - J 2 Ising model, whose pseudospins are associated with local inter-band magnetic order. We show that by varying the band structure parameters within a reasonable range of values, a variety of ground states and quantum critical points can be accessed in the strong-coupling regime, some of which are not realized in the weak-coupling regime. Here, we compare these results with the case of the single-band Hubbard model, where only intra-band repulsion is present, and whose strong-coupling behavior is captured by a simple Heisenberg model.
Toward a 3d Ising model with a weakly-coupled string theory dual
It has long been expected that the 3d Ising model can be thought of as a string theory, where one interprets the domain walls that separate up spins from down spins as two-dimensional string worldsheets. The usual Ising Hamiltonian measures the area of these domain walls. This theory has string coupling of unit magnitude. We add new local terms to the Ising Hamiltonian that further weight each spin configuration by a factor depending on the genus of the corresponding domain wall, resulting in a new 3d Ising model that has a tunable bare string coupling g_s g s . We use a combination of analytical and numerical methods to analyze the phase structure of this model as g_s g s is varied. We study statistical properties of the topology of worldsheets and discuss the prospects of using this new deformation at weak string coupling to find a worldsheet description of the 3d Ising transition.
Quantum Ising model on (2+1)-dimensional anti–de Sitter space using tensor networks
We study the quantum Ising model on (2+1)-dimensional anti-de Sitter space using matrix product states (MPS) and matrix product operators (MPOs). We explore the bulk phase diagram of the theory on regular tessellations of hyperbolic space with coordination number seven and find disordered and ordered phases separated by a phase transition. We find that the boundary-boundary spin correlation function exhibits power law scaling deep in the disordered phase of the Ising model consistent with holography. At the critical point, we find the boundary entanglement entropy scales logarithmically with subsystem size but away from this, we see a linear scaling. In comparison, the full system exhibits a volume law scaling, which is expected in chaotic and/or highly connected systems. We also measure out of time ordered correlators (OTOCs) to explore the scrambling behavior of the theory.
Variational quantum simulation of the critical Ising model with symmetry averaging
Here we investigate the use of deep multiscale entanglement renormalization ansatz (DMERA) circuits as a variational ansatz. We use the exactly solvable one-dimensional critical transverse-field Ising model as a test bed. Numerically exact simulation of the quantum circuit ansatz can in this case be carried out to hundreds of qubits by exploiting efficient classical algorithms for simulating matchgate circuits. We find that, for this system, the DMERA strongly outperforms a standard quantum approximate optimization algorithm (QAOA)–style ansatz, and that a major source of systematic error in correlation functions approximated using the DMERA is the breaking of the translational and Kramers-Wannier symmetries of the transverse-field Ising model. We are able to reduce this error by up to four orders of magnitude by symmetry averaging, without incurring additional cost in qubits or circuit depth. Here, we propose that this technique for mitigating systematic error could be applied to noisy intermediate-scale quantum (NISQ) simulations of physical systems with other symmetries.
Paradigm for approaching the forbidden phase transition in the one-dimensional Ising model at fixed finite temperature: Single chain in a magnetic field
In a previous paper, the forbidden spontaneous phase transition in the one-dimensional Ising model was found to be approachable arbitrarily closely in decorated ladders by ultra-narrow phase crossover (UNPC) at a given finite temperature T 0 with the crossover width 2δT reduced exponentially, which resemble a genuine first-order transition with large latent heat. Here, I reveal that the forbidden phase transition can be approached at fixed T 0 as well in decorated single-chain Ising models in the presence of a magnetic field, in which T 0 is determined by the interactions involving only the decorated parts and the magnetic field, while 2δT is independently, exponentially reduced (δT = 0 means a genuine transition) by restoring the ferromagnetic interaction between the ordinary spins on the chain backbone-which was neglected in the previous studies of pseudo-transition-thus manifesting that this asymptoticity to the forbidden transition is essentially the buildup of coherence in preformed crossover of local states. Furthermore, I show that the UNPC can be realized even in the absence of the conventional geometric frustration because the magnetic field itself can induce previously unnoticed hidden spin frustration. In conclusion, these findings make the doors wide open to the engineering and utilization of UNPC as a new paradigm for exploring exotic phenomena and 1D device applications.
2D Ising Model for Adsorption–induced Enantiopurification of Racemates
Mechanisms for the spontaneous transformation of achiral chemical systems into states of enantiomeric purity have important ramifications in modern pharmacology and potential relevance to the origins of homochirality in life on Earth. Such mechanisms for enantiopurification are needed for production of chiral pharmaceuticals and other bioactive compounds. Previously proposed chemical mechanisms leading from achiral systems to near homochirality are initiated by a symmetry–breaking step resulting in a minor excess of one enantiomer via statistical fluctuations in enantiomer concentrations. Subsequent irreversible processes then amplify the majority enantiomer concentration while simultaneously suppressing minority enantiomer production. Herein, equilibrium adsorption of amino acid enantiomer mixtures onto chiral and achiral surfaces reveals amplification of surface enantiomeric excess relative to the gas phase; i. e. enantiopurification of chiral adsorbates by adsorption. Furthermore, this adsorption–induced amplification of enantiomeric excess is shown to be well–describe by the 2D Ising model. More importantly, the 2D–Ising model predicts formation of homochiral monolayers from adsorption of racemic mixtures or prochiral molecules on achiral surfaces; i.e. enantiopurification with no apparent chiral driving force.
Short-Depth QAOA circuits and Quantum Annealing on Higher-Order Ising Models (Rev.2)
The Quantum Alternating Operator Ansatz (QAOA) and Quantum Annealing (QA) are quantum algorithms that are both based on the adiabatic theorem and both have the goal of sampling the optimal solution(s) of combinatorial optimization problems. Quantum annealing has been physically instantiated on D-Wave devices using superconducting flux qubits, and QAOA can be programmed on digital gate-model quantum computers such as the programmable superconducting transmon qubits devices of the IBMQ series, for instance ibm washington. QAOA and QA address the same types of problems, but it is unclear how they will scale to large problem sizes and to larger and higher-fidelity quantum computers. In this article, we present a direct comparison between QAOA, one and two rounds, run on all 127 qubits of ibm washington and QA run on D-Wave Advantage system4.1 and Advantage system6.1. The problems which allow for this comparison are random Ising model problems whose connectivity matches the heavy hexagonal lattice topology of ibm washington and the Pegasus graph connectivity of the two D-Wave devices. We create two classes of problem instances for this comparison: one with higher order terms (ZZZ variable interactions), linear terms, and quadratic terms, and a separate problem type with only linear and quadratic terms. Our QAOA circuits are novel and extremely short depth, with a CNOT depth of 6 per round, which allows whole chip usage of ibm washington’s heavy hexagonal lattice and can be applied to future heavy-hex chips. We also test the effectiveness of the error suppression technique digital dynamical decoupling on the QAOA circuits. The QAOA circuits compiled to ibm washington are composed of several thousand circuit instructions, approximately 3, 000 depending on the details of the circuit, making these some the largest quantum circuits ever executed on a digital quantum processor. QAOA and QA are compared against the classical heuristic algorithm of simulated annealing and all problem instances are exactly solved using CPLEX in order to evaluate which samplers, if any, correctly found the ground state solution(s) of the problem instances. We find that (i) QA outperforms QAOA on all problem instances, (ii) QAOA samples the problems better than random sampling, and (iii) QAOA angle computation exhibits clear parameter concentration across the ensemble of Ising models.