Related papers: Nambu and the Ising Model
We present several known solutions to the two-dimensional Ising model. This review originated from the ``Ising 100'' seminar series held at Bo\u{g}azi\c{c}i University, Istanbul, in 2024.
The Quadratic Unconstrained Binary Optimization (QUBO) model has gained prominence in recent years with the discovery that it unifies a rich variety of combinatorial optimization problems. By its association with the Ising problem in…
Adiabatic quantum optimization has attracted a lot of attention because small scale simulations gave hope that it would allow to solve NP-complete problems efficiently. Later, negative results proved the existence of specifically designed…
Machine learning is a novel and powerful technology and has been widely used in various science topics. We demonstrate a machine-learning based approach built by a set of general metrics and rules inspired by physics. Taking advantages of…
We show that Zhang Degang's claimed solution of the three-dimensional Ising model [arXiv:2110.11233] has fatal irreparable errors.
This paper aims to develop a theory for linear-quadratic Nash systems and Master equations in possibly infinite-dimensional Hilbert spaces. As a first step and motivated by the recent results in [31], we study a more general model in the…
Various combinatorial optimization NP-hard problems can be reduced to finding the minimizer of an Ising model, which is a discrete mathematical model. It is an intellectual challenge to develop some mathematical tools or algorithms for…
This paper, which is dedicated to Alan Turing on the 50th anniversary of his death, gives an overview and discusses the philosophical implications of incompleteness, uncomputability and randomness.
We solve a problem, which while not fitting into the usual paradigm, can be viewed as a quantum computation. Suppose we are given a quantum system described by an N dimensional Hilbert space with a Hamiltonian of the form $E |w >< w|$ where…
The year 2025 marked the passing of two towering figures of twentieth-century mathematical physics, Rodney Baxter and Chen-Ning Yang. Yang reshaped modern physics through the introduction of non-abelian gauge theory and, independently,…
Ising machines are hardware solvers which aim to find the absolute or approximate ground states of the Ising model. The Ising model is of fundamental computational interest because it is possible to formulate any problem in the complexity…
The Nile problem by Ronald Fisher may be interpreted as the problem of making statistical inference for a special curved exponential family when the minimal sufficient statistic is incomplete. The problem itself and its versions for general…
We train a set of Restricted Boltzmann Machines (RBMs) on one- and two-dimensional Ising spin configurations at various values of temperature, generated using Monte Carlo simulations. We validate the training procedure by monitoring several…
Many questions of fundamental interest in todays science can be formulated as inference problems: Some partial, or noisy, observations are performed over a set of variables and the goal is to recover, or infer, the values of the variables…
In February 1700, Isaac Newton needed a precise tropical year to design a new universal calendar that would supersede the Gregorian one. However, 17th-Century astronomers were uncertain of the long-term variation in the inclination of the…
The central object of this PhD thesis is known under different names in the fields of computer science and statistical mechanics. In computer science, it is called the Maximum Cut problem, one of the famous twenty-one Karp's original…
This contribution to the book in honour of J.S. Bell will probably differ from the remaining ones, in particular since only a part of it will be devoted to specific technical arguments. In fact I have considered appropriate to share with…
The Quadratic Unconstrained Binary Optimization (QUBO) problems are NP hard; thus, so far, there are no algorithms to solve them efficiently. There are exact methods like the Branch-and-Bound algorithm for smaller problems, and for larger…
We consider the problem of learning the underlying graph of an unknown Ising model on p spins from a collection of i.i.d. samples generated from the model. We suggest a new estimator that is computationally efficient and requires a number…
In 1982, Tamaki Yano proposed a conjecture predicting how is the set of $b$-exponents of an irreducible plane curve singularity germ which is generic in its equisingularity class. In 1986, Pi.~Cassou-Nogu\`es proved the conjecture for the…