Related papers: A Graph-Theoretic Framework for Free-Parafermion S…
This thesis examines the correspondence between models of statistical physics and Feynman graphs of quantum field theories (QFTs) by a common property: integrability. We review integrable structures for periodic boundary conditions on both…
The dimer model on a strip is considered as a Yang-Baxter \mbox{integrable} six vertex model at the free-fermion point with crossing parameter $\lambda=\tfrac{\pi}{2}$ and quantum group invariant boundary conditions. A one-to-many mapping…
We consider the problem of estimating undirected triangle-free graphs of high dimensional distributions. Triangle-free graphs form a rich graph family which allows arbitrary loopy structures but 3-cliques. For inferential tractability, we…
For graphs $F$ and $H$, let $i(F)$ denote the inducibility of $F$ and let $i_H(F)$ denote the inducibility of $F$ over $H$-free graphs. We prove that for almost all graphs $F$ on a given number of vertices, $i_{K_k}(F)$ attains infinitely…
We investigate up to which extend the kinematic setting of loop quantum gravity can be fit into a diffeomorphism invariant setting of algebraic QFT generalizing the Haag-Kastler setting of Wightman type QFT. The net of local (Weyl-)algebras…
The spin network simulator model represents a bridge between (generalized) circuit schemes for standard quantum computation and approaches based on notions from Topological Quantum Field Theories (TQFT). More precisely, when working with…
We investigate the equidistribution of the eigenfunctions on quantum graphs in the high-energy limit. Our main result is an estimate of the deviations from equidistribution for large well-connected graphs. We use an exact field-theoretic…
Based on earlier work on regular quantum graphs we show that a large class of scaling quantum graphs with arbitrary topology are explicitly analytically solvable. This is surprising since quantum graphs are excellent models of quantum chaos…
A graph $\Gamma$ is $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$. If $V(\Gamma)$ admits a nontrivial $G$-invariant partition ${\cal B}$ such…
A quantum algorithm for approximating efficiently 3--manifold topological invariants in the framework of SU(2) Chern-Simons-Witten (CSW) topological quantum field theory at finite values of the coupling constant k is provided. The model of…
We discuss a class of discrete Gaussian free fields on Hamming graphs, where interactions are determined solely by the Hamming distance between vertices. The purpose of examining this class is that it differs significantly from the commonly…
A graph is Hamiltonian if it contains a cycle passing through every vertex. One of the cornerstone results in the theory of random graphs asserts that for edge probability $p \gg \frac{\log n}{n}$, the random graph $G(n,p)$ is…
We study Nielsen complexity and Fubini-Study complexity for a class of exactly solvable one dimensional spin systems. Our examples include the transverse XY spin chain and its natural extensions, the quantum compass model with and without…
Identifying quantum phase transitions poses a significant challenge in condensed matter physics, as this requires methods that both provide accurate results and scale well with system size. In this work, we demonstrate how relaxation…
Signal analysis on graphs relies heavily on the graph Fourier transform, which is defined as the projection of a signal onto an eigenbasis of the associated shift operator. Large graphs of similar structure may be represented by a graphon.…
The intention of the paper is to move a step towards a classification of network topologies that exhibit periodic quantum dynamics. We show that the evolution of a quantum system, whose hamiltonian is identical to the adjacency matrix of a…
Many combinatorial optimization problems can be phrased in the language of constraint satisfaction problems. We introduce a graph neural network architecture for solving such optimization problems. The architecture is generic; it works for…
Connectivity is a fundamental property of quantum graphs, previously studied in the operator system model for matrix quantum graphs and via graph homomorphisms in the quantum adjacency matrix model. In this paper, we develop an algebraic…
The study of entanglement and magic properties in topologically frustrated systems suggests that, in the thermodynamic limit, these quantities decompose into two distinct contributions. One is determined by the specific nature of the model…
We consider two-dimensional N=(2,2) supersymmetric gauge theory on discretized Riemann surfaces. We find that the discretized theory can be efficiently described by using graph theory, where the bosonic and fermionic fields are regarded as…