Related papers: A Graph-Theoretic Framework for Free-Parafermion S…
We give inductive constructions of independent graphs that contain implied nonedges but do not contain any non-trivial rigid subgraphs, or \emph{nucleations}: some of the constructions and proofs apply to 3-dimensional abstract rigidity…
Recent interest in the external validity of prediction models (i.e., the problem of different train and test distributions, known as dataset shift) has produced many methods for finding predictive distributions that are invariant to dataset…
The method of large spin perturbation theory allows to analyse conformal field theories (CFT) by turning the crossing equations into an algebraic problem. We apply this method to a generic CFT with weakly broken higher spin (HS) symmetry,…
In the dimer model, a configuration consists of a perfect matching of a fixed graph. If the underlying graph is planar and bipartite, such a configuration is associated to a height function. For appropriate "critical" (weighted) graphs,…
We study the entanglement Hamiltonian for free-fermion chains with a particular form of inhomogeneity. The hopping amplitudes and chemical potentials are chosen such that the single-particle eigenstates are related to discrete orthogonal…
The decoration or iteration transformation was widely applied to solve exactly the magnetic spin models in one-dimensional and two-dimensional lattice. The motif of this letter is to extend the decoration transformation approach for models…
We establish a quantum version of Frucht's Theorem, proving that every finite quantum group is the quantum automorphism group of an undirected finite quantum graph. The construction is based on first considering several quantum Cayley…
For simple connected graphs with incommensurate bond lengths and with unitary symmetry we prove the Bohigas-Giannoni-Schmit conjecture in its most general form. Using supersymmetry and taking the limit of infinite graph size, we show that…
We show that solutions to fermion sign problems in the CT-INT formulation can be extended to systems involving fermions interacting with dynamical quantum spins. While these sign problems seem unsolvable in the auxiliary field approach,…
In this work we solve the sign problem of a frustrated quantum impurity model consisting of three quantum spin-half chains interacting through an anti-ferromagnetic Heisenberg interaction at one end. We first map the model into a repulsive…
In contrast to the usual quantum systems which have at most a finite number of open spectral gaps if they are periodic in more than one direction, periodic quantum graphs may have gaps arbitrarily high in the spectrum. This property of…
We argue that interacting conformal line defects in free quantum field theories can exist, provided that inversion symmetry is broken. Important for our demonstration is the existence of a special cross ratio for bulk-defect-defect three…
In 2019, Aterias et al. constructed pairs of quantum isomorphic, non-isomorphic graphs from linear constraint systems. This article deals with quantum automorphisms and quantum isomorphisms of colored versions of those graphs. We show that…
We study a model of strongly correlated electrons on the square lattice which exhibits charge frustration and quantum critical behavior. The potential is tuned to make the interactions supersymmetric. We establish a rigorous mathematical…
We construct commuting transfer matrices for models describing the interaction between a single quantum spin and a single bosonic mode using the quantum inverse scattering framework. The transfer matrices are obtained from certain…
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…
Graph states provide a powerful framework for describing multipartite entanglement in quantum information science. In their standard formulation, graph states are generated by controlled-$Z$ interactions and naturally encode symmetric…
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…
We construct models of exactly solvable two-particle quantum graphs with certain non-local two-particle interactions, establishing appropriate boundary conditions via suitable self-adjoint realisations of the two-particle Laplacian. Showing…
Electric, intelligent, and network are the most important future development directions of automobiles. Intelligent electric vehicles have shown great potentials to improve traffic mobility and reduce emissions, especially at unsignalized…