Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:0803.4036 · Journal of Statistical Physics

Algebraic Reduction of the Ising Model

R. J. Baxter

Published Jul 15, 2008• 10 citations
arXivHTMLPDF
DOI
10.1007/s10955-008-9587-y

Related papers

Soluble Extension of the Ising Model

Daniel Charles Mattis, Werner P. Wolf

Physical Review Letters•May 16, 1966•20 citations

An Exact Solution to a Three Dimensional Ising Model and Dimensional Reductions

Zohar Nussinov

A high temperature expansion is employed to map some complex anisotropic nonhermitian three and four dimensional Ising models with algebraic long range interactions into a solvable two dimensional variant. We also address the dimensional reductions for anisotropic two dimensional XY and other models. For the latter and related systems it is possible to have an effective reduction in the dimension without the need of compactifying some dimensions. Some solutions are presented. This framework further allows for some very simple general observations. It will be seen that the absence of a ``phase interference'' effect plays an important role in high dimensional problems. A very forbidding purely algebraic recursive series solution to the three dimensional nearest neighbor Ising model will be given. In the aftermath, the full-blown three dimensional nearest neighbor Ising model is exactly mapped onto a single spin 1/2 particle with nontrivial dynamics. All this allows for a formal high dimensional Bosonization.

arXiv:hep-th/0104214•Apr 24, 2001•0 citations

Dynamics of the Ising model

Huey Wen Huang

Physics Letters A•Jul 1, 1974•5 citations

Critical-Algebra Coefficients for the Three-Dimensional Ising Model

Reginald Rutherford, Michael Wortis

High-temperature series expansions are used to test the reduction hypothesis of Kadanoff's operator algebra for the three-dimensional fcc Ising model with spin $s=\frac{3}{2},2,\ensuremath{\infty}$. Agreement with our data is convincing. Numerical values are given for the coupling coefficients between the order parameter $\ensuremath{\mu}$ and ${\ensuremath{\mu}}^{3}$ and between between ${\ensuremath{\mu}}^{2}$ and the local energy density.

Physical review. B, Solid state•Aug 1, 1973•0 citations

Operator Algebra and the Determination of Critical Indices

Leo P. Kadanoff

The "reduction hypothesis" proposes that a product of nearby fluctuating local variables can be replaced by a linear combination of individual local variables. The linear combinations thereby produced are a kind of algebra of the reduction of products. A particular algebra is proposed for the two-dimensional Ising model. It is shown that a knowledge of which coefficients in the algebra are nonvanishing is sufficient to determine all critical indices.

Physical Review Letters•Dec 22, 1969•195 citations

A reduction scheme for general-order Ising-like Hamiltonians in quantum heuristic solvers

Chengsi Mao, Pavel Mosharev, Yao Wang +1 more

The Ising model is ubiquitous in various optimization problems but notoriously difficult to solve due to combinatorial explosion. In view of this, Hamiltonian reduction is a useful preprocessing technique for reducing the effective problem size before applying heuristic solvers. However, existing reduction techniques mainly target second-order Ising models, whereas many pseudo-Boolean formulations naturally contain higher-order interactions. In this work, we generalize the concept of non-separable groups to arbitrary-order Ising-like models and develop a Hamiltonian reduction framework that iteratively detects and merges constrained spin groups into single variables. We benchmark the reduction on synthetic hypergraphs and higher-order network datasets, and evaluate its integration with downstream order-reduction and solver workflows. Our results establish a foundation for Hamiltonian reduction in higher-order Ising-like optimization problems.

quant-pharXiv:2607.19871•Quantum Information Processing•Jul 23, 2026•0 citations
A high temperature expansion is employed to map some complex anisotropic nonhermitian three and four dimensional Ising models with algebraic long range interactions into a solvable two dimensional variant. We also address the dimensional reductions for anisotropic two dimensional XY and other models. For the latter and related systems it is possible to have an effective reduction in the dimension without the need of compactifying some dimensions. Some solutions are presented. This framework further allows for some very simple general observations. It will be seen that the absence of a ``phase interference'' effect plays an important role in high dimensional problems. A very forbidding purely algebraic recursive series solution to the three dimensional nearest neighbor Ising model will be given. In the aftermath, the full-blown three dimensional nearest neighbor Ising model is exactly mapped onto a single spin 1/2 particle with nontrivial dynamics. All this allows for a formal high dimensional Bosonization.
High-temperature series expansions are used to test the reduction hypothesis of Kadanoff's operator algebra for the three-dimensional fcc Ising model with spin $s=\frac{3}{2},2,\ensuremath{\infty}$. Agreement with our data is convincing. Numerical values are given for the coupling coefficients between the order parameter $\ensuremath{\mu}$ and ${\ensuremath{\mu}}^{3}$ and between between ${\ensuremath{\mu}}^{2}$ and the local energy density.
The Ising model is ubiquitous in various optimization problems but notoriously difficult to solve due to combinatorial explosion. In view of this, Hamiltonian reduction is a useful preprocessing technique for reducing the effective problem size before applying heuristic solvers. However, existing reduction techniques mainly target second-order Ising models, whereas many pseudo-Boolean formulations naturally contain higher-order interactions. In this work, we generalize the concept of non-separable groups to arbitrary-order Ising-like models and develop a Hamiltonian reduction framework that iteratively detects and merges constrained spin groups into single variables. We benchmark the reduction on synthetic hypergraphs and higher-order network datasets, and evaluate its integration with downstream order-reduction and solver workflows. Our results establish a foundation for Hamiltonian reduction in higher-order Ising-like optimization problems.