English
Related papers

Related papers: Characterization of solvable spin models via graph…

200 papers

We show that a quantum spin system has an exact description by non-interacting fermions if its frustration graph is claw-free and contains a simplicial clique. The frustration graph of a spin model captures the pairwise anticommutation…

Quantum Physics · Physics 2023-05-26 Adrian Chapman , Samuel J. Elman , Ryan L. Mann

We consider quantum error-correcting subsystem codes whose gauge generators realize a translation-invariant, free-fermion-solvable spin model. In this setting, errors are suppressed by a Hamiltonian whose terms are the gauge generators of…

Quantum Physics · Physics 2026-04-14 Adrian Chapman , Steven T. Flammia , Alicia J. Kollár

We present a graph-theoretic characterisation of when a quantum spin model admits an exact solution via a mapping to free parafermions. Our characterisation is based on the concept of a frustration graph, which represents the commutation…

Quantum Physics · Physics 2025-04-25 Ryan L. Mann , Samuel J. Elman , David R. Wood , Adrian Chapman

We study quantum spin chains solvable via hidden free fermionic structures. We study the algebras behind such models, establishing connections to the mathematical literature of the so-called ``graph-Clifford'' or ``quasi-Clifford''…

Statistical Mechanics · Physics 2026-02-04 Kohei Fukai , Balázs Pozsgay , István Vona

An invaluable method for probing the physics of a quantum many-body spin system is a mapping to noninteracting effective fermions. We find such mappings using only the frustration graph $G$ of a Hamiltonian $H$, i.e., the network of…

Quantum Physics · Physics 2021-11-09 Samuel J. Elman , Adrian Chapman , Steven T. Flammia

We present a simple criterion for solvability of lattice spin systems on the basis of the graph theory and the simplicial homology. The lattice systems satisfy algebras with graphical representations. It is shown that the null spaces of…

Statistical Mechanics · Physics 2021-01-04 Masahiro Ogura , Yukihisa Imamura , Naruhiko Kameyama , Kazuhiko Minami , Masatoshi Sato

A set of Pauli stings is well characterized by the graph that encodes its commutatitivity structure, i.e., by its frustration graph. This graph provides a natural interface between graph theory and quantum information, which we explore in…

Quantum Physics · Physics 2025-11-18 Zhen-Peng Xu , Jie Wang , Qi Ye , Gereon Koßmann , René Schwonnek , Andreas Winter

We introduce a transformation which allows the fermionization of operators of any one-dimensional spin-chain. This fermionization procedure is independent of any eventual integrable structure and is compatible with it. We illustrate this…

Condensed Matter · Physics 2009-10-31 P. Dargis , Z. Maassarani

I solve a quantum chain whose Hamiltonian is comprised solely of local four-fermi operators by constructing free-fermion raising and lowering operators. The free-fermion operators are both non-local and highly non-linear in the local…

Statistical Mechanics · Physics 2019-11-06 Paul Fendley

We consider a many-fermion model which exhibits a transition from a superconducting to a rotational phase with variation of a parameter in its Hamiltonian. The model has analytical solutions in its two limits due to the presence of…

Nuclear Theory · Physics 2009-10-31 D. J. Rowe , C. Bahri , W. Wijesundera

Recently, several spin chain models have been discovered that admit solutions in terms of "free fermions in disguise." A graph-theoretical treatment of such models was also established, giving sufficient conditions for free fermionic…

Statistical Mechanics · Physics 2025-08-11 Kohei Fukai , István Vona , Balázs Pozsgay

The computational cost of simulating quantum many-body systems can often be reduced by taking advantage of physical symmetries. While methods exist for specific symmetry classes, a general algorithm to find the full permutation symmetry…

Quantum Physics · Physics 2025-12-01 Saumya Shah , Patrick Rebentrost

We study an exactly solvable quantum field theory (QFT) model describing interacting fermions in 2+1 dimensions. This model is motivated by physical arguments suggesting that it provides an effective description of spinless fermions on a…

Mathematical Physics · Physics 2013-08-26 Jonas de Woul , Edwin Langmann

We present a novel graph-theoretic approach to simplifying generic many-body Hamiltonians. Our primary result introduces a recursive twin-collapse algorithm, leveraging the identification and elimination of symmetric vertex pairs (twins),…

Quantum Physics · Physics 2026-03-11 Jannis Ruh , Samuel J. Elman

In this paper, we show that a system of localized particles, satisfying the Fermi statistics and subject to finite-range interactions, can be exactly solved in any dimension. In fact, in this case it is always possible to find a finite…

Strongly Correlated Electrons · Physics 2007-05-23 Ferdinando Mancini

Obtaining the symmetries of a model is a critical step towards developing an understanding and ultimately analytically or numerically solving the model. However, finding symmetries is generally extremely complicated, often being the result…

This work presents a many-fermion Hamiltonian with the following properties: 1) is exactly solvable, 2) has a second order insulator-metal quantum phase transition, 3) has a well defined mean field approximation and 4) its mean-field ground…

Quantum Gases · Physics 2009-11-12 Emil Prodan

It is shown that the quantum Hamiltonian characterising a non-relativistic electron under the influence of an external spherical symmetric electromagnetic potential exhibits a supersymmetric structure. Both cases, spherical symmetric scalar…

Mathematical Physics · Physics 2025-05-21 Georg Junker

Symmetry breaking for graphs and other combinatorial objects is notoriously hard. On the one hand, complete symmetry breaks are exponential in size. On the other hand, current, state-of-the-art, partial symmetry breaks are often considered…

Logic in Computer Science · Computer Science 2026-04-01 Michael Codish , Mikoláš Janota

The monopole-dimer model introduced recently is an exactly-solvable signed generalisation of the dimer model. We show that the partition function of the monopole-dimer model on a graph invariant under a fixed-point free involution is a…

Combinatorics · Mathematics 2020-06-16 Arvind Ayyer
‹ Prev 1 2 3 10 Next ›