Related papers: The algorithm for simulating of phase transition i…
The characterization of quantum phase transitions is a fundamental task for the understanding of quantum phases of matter, with a number of potential applications in quantum technologies. In this work, we use digital quantum simulation as a…
We have provided a concise introduction to the Ising model as one of the most important models in statistical mechanics and in studying the phenomenon of phase transition. The required theoretical background and derivation of the…
We modified the recently proposed multicanonical MC algorithm for the case of a magnetic field driven order--order phase transition. We test this {\it multimagnetic} Monte Carlo algorithm for the D=2 Ising model at $\beta=0.5$ and simulate…
We investigate the efficient learning of magnetic phases using artificial neural networks trained on synthetic data, combining computational simplicity with physics-informed strategies. Focusing on the diluted Ising model, which lacks an…
We present an efficient algorithm for calculating the properties of Ising models in two dimensions, directly in the spin basis, without the need for mapping to fermion or dimer models. The algorithm gives numerically exact results for the…
We present an algorithm to approximate partition functions of 3-body classical Ising models on two-dimensional lattices of arbitrary genus, in the real-temperature regime. Even though our algorithm is purely classical, it is designed by…
This paper is devoted to computational algorithms designed to describe the classical Ising magnet in some specific cases when an additional macroscopic restriction in form of constant charge density exists in the system. We developed and…
A two-dimensional Ising model with nearest-neighbors ferromagnetic interactions is implemented in a Field Programmable Gate Array (FPGA) board.Extensive Monte Carlo simulations were carried out using an efficient hardware representation of…
In this work 2D Ising systems were used to simulate the reversals of the Earth's magnetic field. Each spin was supposed to be a ring current in the Earth dynamo and the magnetization to be proportional to the field intensity. Given the…
The high-performance scalable parallel algorithm for rigorous calculation of partition function of lattice systems with finite number Ising spins was developed. The parallel calculations run by C++ code with using of Message Passing…
The geometrical approach to phase transitions is illustrated by simulating the high-temperature representation of the Ising model on a square lattice.
We show how quantum metrology protocols that seek to estimate the parameters of a Hamiltonian that exhibits a quantum phase transition can be efficiently simulated on an exponentially smaller quantum computer. Specifically, by exploiting…
It is well known that conventional simulation algorithms are inefficient for the statistical description of macroscopic systems exactly at the critical point due to the divergence of the corresponding relaxation time (critical slowing…
The magnetization switching dynamics in the kinetic Ising model is projected onto a one-dimensional absorbing Markov chain. The resulting projected dynamics reproduces the direct simulation results with great accuracy. A scheme is proposed…
Motivated by far-reaching applications ranging from quantum simulations of complex processes in physics and chemistry to quantum information processing, a broad effort is currently underway to build large-scale programmable quantum systems.…
Systems of interacting quantum spins show a rich spectrum of quantum phases and display interesting many-body dynamics. Computing characteristics of even small systems on conventional computers poses significant challenges. A quantum…
In this paper, we investigate the use of variational quantum algorithms for simulating the thermodynamic properties of dinuclear metal complexes. Our study highlights the potential of quantum computing to transform advanced simulations and…
The similarities between phase separation in physics and residential segregation by preference in the Schelling model of 1971 are reviewed. Also, new computer simulations of asymmetric interactions different from the usual Ising model are…
Simulation of quantum systems is notoriously challenging for classical computers, while quantum hardware is naturally well-suited for this task. However, the imperfections of contemporary quantum systems poses a considerable challenge in…
Interest in non-algorithmic, unconventional computing is rising in recent years due to more and more apparent short comings of classic stored-program digital computers, such as energy efficiency, degree of parallelism in computations, clock…