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 relations between Pauli terms of its Hamiltonian in a given basis. This result captures a vast family of known free-fermion solutions. In previous work, it was shown that a free-fermion solution exists if the frustration graph is either a line graph, or (even-hole, claw)-free. The former case generalizes the celebrated Jordan-Wigner transformation and includes the exact solution to the Kitaev honeycomb model. The latter case generalizes a non-local solution to the four-fermion model given by Fendley. Our characterization unifies these two approaches, extending generalized Jordan-Wigner solutions to the non-local setting and generalizing the four-fermion solution to models of arbitrary spatial dimension. Our key technical insight is the identification of a class of cycle symmetries for all models with claw-free frustration graphs. We prove that these symmetries commute, and this allows us to apply Fendley's solution method to each symmetric subspace independently. Finally, we give a physical description of the fermion modes in terms of operators generated by repeated commutation with the Hamiltonian. This connects our framework to the developing body of work on operator Krylov subspaces. Our results deepen the connection between many-body physics and the mathematical theory of claw-free graphs.
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 relations between Pauli terms of its Hamiltonian in a given basis. This result captures a vast family of known free-fermion solutions. In previous work, it was shown that a free-fermion solution exists if the frustration graph is either a line graph, or (even-hole, claw)-free. The former case generalizes the celebrated Jordan-Wigner transformation and includes the exact solution to the Kitaev honeycomb model. The latter case generalizes a non-local solution to the four-fermion model given by Fendley. Our characterization unifies these two approaches, extending generalized Jordan-Wigner solutions to the non-local setting and generalizing the four-fermion solution to models of arbitrary spatial dimension. Our key technical insight is the identification of a class of cycle symmetries for all models with claw-free frustration graphs. We prove that these symmetries commute, and this allows us to apply Fendley's solution method to each symmetric subspace independently. Finally, we give a physical description of the fermion modes in terms of operators generated by repeated commutation with the Hamiltonian. This connects our framework to the developing body of work on operator Krylov subspaces. Our results deepen the connection between many-body physics and the mathematical theory of claw-free graphs.
Exactly solvable models are often identified from structural features of their interactions. For quantum spin Hamiltonians, these are captured by the frustration graph of anticommuting Pauli terms. The frustration graph characterizes broad families of spin models that map to free fermions for arbitrary, or generic, values of their coupling strengths. Nevertheless, there exist non-generically solvable models that admit free-fermion solutions only at finely tuned couplings. In this work, we characterize a family of such models in terms of graph structures. Given an arbitrary instance of Fendley's free-fermions-in-disguise (FFD) chain, we construct a set of operators, called Krylov currents, that are exactly quadratic in its effective fermionic modes and thus extend it to a linear family of free-fermion solvable Hamiltonians. As the Krylov currents are nonlinear in the FFD Hamiltonian terms, the elements of this generated family are non-generically solvable, and they accordingly fail the known conditions for generic solvability. We prove that every Krylov current admits an expansion in terms of induced paths of the frustration graph and that they generate the full special-orthogonal algebra of Gaussian transformations. Our results identify path support as a signature of non-generic solvability, and they provide a systematic route to finding exactly solvable many-body Hamiltonians.
Free-fermion solvability in quantum spin systems is increasingly understood to be governed by a graph Clifford algebra defined from the frustration graph of the Hamiltonian. When the frustration graph belongs to certain classes, such as the even-hole-free and claw-free (ECF) class, the Hamiltonian is solvable by hidden free fermions: it admits a free-fermion solution although it does not reduce to a Majorana bilinear under the Jordan-Wigner transformation. However, unlike in the Jordan-Wigner case, where each mode is a linear combination of single Majorana fermions, the explicit operator structure of the hidden free-fermion modes---and that of the local conserved charges---has remained obscure. In this work, we derive a path-product expansion that expresses each free-fermion mode as a linear combination of products along induced paths in the extended frustration graph. The expansion follows from the Krylov generating function and yields the modes directly, without using the transfer matrix or nonlocal conserved charges; the resulting mode decomposition also computes infinite-temperature dynamical correlation functions. We further obtain explicit expressions for local conserved charges as linear combinations of path products along induced paths; these charges apply beyond the free-fermion (ECF) class to more general claw-free frustration graphs. We also identify a family of generalized conserved charges containing both the known nonlocal conserved charges and these local charges. For the homogeneous periodic Fendley model, the local conserved charges exhibit the same Catalan-tree pattern as those of the spin-1/2 XXX chain.
We present a graph-theoretic characterization of when a quantum spin model admits an exact solution via a mapping to free parafermions. Our characterization is based on the concept of a frustration graph, which represents the commutation relations between Weyl operators of a Hamiltonian. We show that a quantum spin system has an exact free-parafermion solution if its frustration graph is an oriented indifference graph. Furthermore, we show that if the frustration graph of a model can be dipath oriented via switching operations, then the model is integrable in the sense that there is a family of commuting independent set charges. Additionally, we establish an efficient algorithm for deciding whether this is possible. Our characterization extends that given for free-fermion solvability. Finally, we apply our results to solve three qudit spin models.
We consider quantum error-correcting subsystem codes whose gauge generators realize a translationinvariant, free-fermion-solvable spin model.In this setting, errors are suppressed by a Hamiltonian whose terms are the gauge generators of the code and whose exact spectrum and eigenstates can be found via a generalized Jordan-Wigner transformation.Such solutions are characterized by the frustration graph of the Hamiltonian: the graph whose vertices are Hamiltonian terms, which are neighboring if the terms anticommute.We provide methods for embedding a given frustration graph in the anticommutation relations of a spin model and present the first known example of an exactly solvable spin model with a two-dimensional free-fermion description and exact topological qubits.This model can be viewed as a free-fermionized version of the two-dimensional Bacon-Shor code.Using graph-theoretic tools to study the unit cell, we give an efficient algorithm for deciding if a given translation-invariant spin model is solvable, and explicitly construct the solution.Further, we examine the energetics of these exactly solvable models from the graph-theoretic perspective and show that the relevant gaps of the spin model correspond to known graph-theoretic quantities: the skew energy and the median eigenvalue of an oriented graph.Finally, we numerically search for models that have large spectral gaps above the ground-state spin configuration and thus exhibit particularly robust thermal suppression of errors.These results suggest that optimal models will have low dimensionality and odd coordination numbers, and that the primary limit to energetic error suppression is the skew energy difference between different symmetry sectors rather than single-particle excitations of the free fermions.
Recently, a class of spin chains known as ``free fermions in disguise'' (FFD) has been discovered, which possess hidden free-fermion spectra even though they are not solvable via the standard Jordan-Wigner transformation. In this work, we extend this FFD framework to open quantum systems governed by the Gorini-Kossakowski-Sudarshan-Lindblad (GKSL) equation. We establish a general class of exactly solvable open quantum systems within the FFD framework: if the Liouvillian frustration graph is claw-free and has a simplicial clique, the Liouvillian possesses a hidden free-fermion spectrum. In particular, the (even-hole, claw)-free condition automatically guarantees this, enabling exact computation of the Liouvillian gap and an infinite-temperature autocorrelation function. Our results provide the first realization of the FFD mechanism in open quantum systems.
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), as well as line-graph modules, within the frustration graph of the Hamiltonian. This method systematically block-diagonalizes Hamiltonians, significantly reducing complexity while preserving the energetic spectrum. Importantly, our approach expands the class of models that can be mapped to non-interacting fermionic Hamiltonians (free-fermion solutions), thereby broadening the applicability of classical solvability methods. Through numerical simulations on spin Hamiltonians arranged in periodic lattice configurations and Majorana Hamiltonians, we demonstrate that the twin-collapse increases the identification of simplicial and claw-free graph structures, which characterize free-fermion solvability. Finally, we extend our framework by presenting a generalized discrete Stone-von Neumann theorem. This comprehensive framework provides new insights into Hamiltonian simplification techniques, free-fermion solutions, and group-theoretical characterizations relevant for quantum chemistry, condensed matter physics, and quantum computation.