Related papers: A Graph-Theoretic Framework for Free-Parafermion S…
The Induced Graph Matching problem asks to find k disjoint induced subgraphs isomorphic to a given graph H in a given graph G such that there are no edges between vertices of different subgraphs. This problem generalizes the classical…
Finding the precise correspondence between lattice operators and the continuum fields that describe their long-distance properties is a largely open problem for strongly interacting critical points. Here we solve this problem essentially…
We consider a two-spin model, represented classically by a nonlinear autonomous Hamiltonian system with two degrees of freedom and a nontrivial integrability condition, and quantum mechanically by a real symmetric Hamiltonian matrix with…
We calculated the spectral properties of two related families of non-Hermitian free-particle quantum chains with $N$-multispin interactions ($N=2,3,\ldots$). The first family have a $Z(N)$ symmetry and are described by free parafermions.…
Two drift-diffusion models for the quantum transport of electrons in graphene, which account for the spin degree of freedom, are derived from a spinorial Wigner equation with relaxation-time or mass- and spin-conserving matrix collision…
The theory of a massless two-dimensional scalar field with a periodic boundary interaction is considered. At a critical value of the period this system defines a conformal field theory and can be re-expressed in terms of free fermions,…
We discuss the equivalence between the path integral representations of spin dynamics for anti-commuting (Grassmann) and commuting variables and establish a bosonization dictionary for both generators of spin and single fermion operators.…
Structural balance modeling for signed graph networks presents how to model the sources of conflicts. The state-of-the-art focuses on computing the frustration index of a signed graph, a critical step toward solving problems in social and…
We give general conditions for the existence of a Hamiltonian operator whose discrete time evolution matches the partition function of certain solvable lattice models. In particular, we examine two classes of lattice models: the classical…
The study of graph C*-algebras has a long history in operator algebras. Surprisingly, their quantum symmetries have never been computed so far. We close this gap by proving that the quantum automorphism group of a finite, directed graph…
This article comprehensively explores matrices and their prerequisites for achieving positive semidefiniteness. The study delves into a series of theorems concerning pure quantum states in the context of weighted graphs. The main objective…
Entanglement in finite and semi-infinite free Fermionic chains is studied. A parallel is drawn with the analysis of time and band limiting in signal processing. It is shown that a tridiagonal matrix commuting with the entanglement…
Inspired by a recent work that proposes using coherent states to evaluate the Feynman kernel in noncommutative space, we provide an independent formulation of the path-integral approach for quantum mechanics on the Moyal plane, with the…
For a particle travelling through an interferometer, the trade-off between the available which-way information and the interference visibility provides a lucid manifestation of the quantum mechanical wave-particle duality. Here we analyze…
A complete bipartite graph $K_{3,3}$, considered as a planar linkage with joints at the vertices and with rods as edges, in general admits only motions as a whole, i.e., is inflexible. Two types of its paradoxical mobility were found by…
A finite graph $\Gamma$ is called $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. We study a family of symmetric graphs, called the unitary…
Not necessarily self-adjoint quantum graphs -- differential operators on metric graphs -- are considered. Assume in addition that the underlying metric graph possesses an automorphism (symmetry) $ \mathcal P $. If the differential operator…
We provide evidence that quantum mechanics can be interpreted as a rational algorithm for finding the least complex description for the correlations in the outputs of sensors in a large array. In particular, by comparing the…
An interacting spin-fermion model is exactly solved on an open chain. In a certain representation, it is the nearest-neighbor Hubbard model in the limit of infinite $U$ (local interaction). Exact solution of its complete energy…
The transverse spin autocorrelation function at an arbitrary temperature are calculated rigorously for the system of $N$ uniformly exchanged quantum spins. At large $N$ the correlator in the para-phase is found to have a Gaussian bump at…