Related papers: A Graph-Theoretic Framework for Free-Parafermion S…
In this article, we consider a spin-spin interaction network governed by $XX + YY$ Hamiltonian. The vertices and edges of the network represent the spin objects and their interactions, respectively. We take a privilege to switch on or off…
We derive a rigorous, quantum mechanical map of fermionic creation and annihilation operators to continuous Cartesian variables that exactly reproduces the matrix structure of the many-fermion problem. We show how our scheme can be used to…
We introduce a solvable quantum antiferromagnetic model. The model, with Ising spins in a transverse field, has infinite range antiferromagnetic interactions with random fields on each site, following an arbitrary distribution. As is…
We present an exact analytical solution of the spectral problem of quasi one-dimensional scaling quantum graphs. Strongly stochastic in the classical limit, these systems are frequently employed as models of quantum chaos. We show that…
Recently multiple families of spin chain models were found, which have a free fermionic spectrum,even though they are not solvable by a Jordan-Wigner transformation. Instead, the free fermions emerge as a result of a rather intricate…
In quantum field theory the path integral is usually formulated in the wave picture, i.e., as a sum over field evolutions. This path integral is difficult to define rigorously because of analytic problems whose resolution may ultimately…
The resolution of geometric frustration in systems with continuous degrees of freedom often involves a cooperative inhomogeneous response and super-extensive energy scaling. In contrast, the frustration in frustrated Ising-like spin systems…
Certain spin chains, such as the quantum Ising chain, have free fermion spectra which can be expressed as the sum of decoupled two-level fermionic systems. Free parafermions are a simple generalisation of this idea to $Z(N)$-symmetric clock…
Extensive numerical analysis of the eigenspectra of the $SU_q(N)$ invariant Perk-Schultz Hamiltonian shows some simple regularities for a significant part of the eigenspectrum. Inspired by those results we have found two set of solutions of…
We investigate arrangements of hyperplanes whose normal vectors are given by connected subgraphs of a fixed graph. These include the resonance arrangement and certain ideal subarrangements of Weyl arrangements. We characterize those which…
The Jordan-Wigner transformation is frequently utilised to rewrite quantum spin chains in terms of fermionic operators. When the resulting Hamiltonian is bilinear in these fermions, i.e. the fermions are free, the exact spectrum follows…
Associated to a finite graph $X$ is its quantum automorphism group $G(X)$. We prove a formula of type $G(X*Y)=G(X)*_wG(Y)$, where $*_w$ is a free wreath product. Then we discuss representation theory of free wreath products, with the…
We identify a set of quantum graphs with unique and precisely defined spectral properties called {\it regular quantum graphs}. Although chaotic in their classical limit with positive topological entropy, regular quantum graphs are…
We present quantum complexity lower and upper bounds for independent set problems in graphs. In particular, we give quantum algorithms for computing a maximal and a maximum independent set in a graph. We present applications of these…
Free Fermions on vertices of distance-regular graphs are considered. Bipartition are defined by taking as one part all vertices at a given distance from a reference vertex. The ground state is constructed by filling all states below a…
We study the dissipative dynamics of a class of interacting ``gamma-matrix'' spin models coupled to a Markovian environment. For spins on an arbitrary graph, we construct a Lindbladian that maps to a non-Hermitian model of free Majorana…
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem is either contained in one out of six classes and can be solved in…
We demonstrate that a quantum graph exhibits a $\mathcal{PT}$-symmetry provided the coefficients in the condition describing the wave function matching at the vertices are circulant matrices; this symmetry is nontrivial if they are not…
We show that spin systems with generic (ferro- or paramagnetic, or random) interactions are "completely integrable". The approach is worked out, by way of example, for the Sherrington Kirkpatrick model: we derive an exact, closed formula…
Global control offers a promising route to scalable quantum computing. A recent conjecture by Hu et al. (arXiv:2508.19075) proposes that any connected qubit graph equipped with global Ising-type interactions and tunable global transverse…