Related papers: Exactly solvable interacting two-particle quantum …
A two-particle self-consistency is rarely part of mean-field theories. It is, however, essential for avoiding spurious critical transitions and unphysical behavior. We present a general scheme for constructing analytically controllable…
We develop a full characterization of abelian quantum statistics on graphs. We explain how the number of anyon phases is related to connectivity. For 2-connected graphs the independence of quantum statistics with respect to the number of…
We investigate the spectral properties of chaotic quantum graphs. We demonstrate that the `energy'--average over the spectrum of individual graphs can be traded for the functional average over a supersymmetric non--linear $\sigma$--model…
In this paper we formulate a general method for building completely integrable quantum systems. The method is based on the use of the so-called multi-parameter spectral equations, i.e. equations with several spectral parameters. We show…
The graph isomorphism problem asks whether two graphs are identical up to vertex relabeling. While the exact problem admits quasi-polynomial-time classical algorithms, many applications in molecular comparison, noisy network analysis, and…
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 investigate connections between the symmetries (automorphisms) of a graph and its spectral properties. Whenever a graph has a symmetry, i.e. a nontrivial automorphism $\phi$, it is possible to use $\phi$ to decompose any matrix…
Recently, Braunstein et al. [1] introduced normalized Laplacian matrices of graphs as density matrices in quantum mechanics and studied the relationships between quantum physical properties and graph theoretical properties of the underlying…
We prove spectral localization for infinite metric graphs with a self-adjoint Laplace operator and a random potential. To do so we adapt the multiscale analysis (MSA) from the R^d-case to metric graphs. In the MSA a covering of the graph is…
We consider the problem of finding universal bounds of "isoperimetric" or "isodiametric" type on the spectral gap of the Laplacian on a metric graph with natural boundary conditions at the vertices, in terms of various analytical and…
This article presents a novel and succinct algorithmic framework via alternating quantum walks, unifying quantum spatial search, state transfer and uniform sampling on a large class of graphs. Using the framework, we can achieve exact…
We have recently constructed a large class of open quantum spin chains which have quantum-algebra symmetry and which are integrable. We show here that these models can be exactly solved using a generalization of the analytical Bethe Ansatz…
Recently normalized Laplacian matrices of graphs are studied as density matrices in quantum mechanics. Separability and entanglement of density matrices are important properties as they determine the nonclassical behavior in quantum…
Many computational problems are unchanged under some symmetry operation. In classical machine learning, this can be reflected with the layer structure of the neural network. In quantum machine learning, the ansatz can be tuned to correspond…
Whenever graphs admit equitable partitions, their quotient graphs highlight the structure evidenced by the partition. It is therefore very natural to ask what can be said about two graphs that have the same quotient according to certain…
Integrable quantum field models are known to exist mostly in one space-dimension. Exploiting the concept of multi-time in integrable systems and a Lax matrix of higher scaling order, we construct a novel quantum field model in quasi-two…
We quantize the regularity properties of classical graphs that determine spin models for singly-generated Yang-Baxter planar algebras, including the Kauffman polynomial, and construct explicit examples. A source of examples comes from…
We provide an introductory review of some topics in spectral theory of Laplacians on metric graphs. We focus on three different aspects: the trace formula, the self-adjointness problem and connections between Laplacians on metric graphs and…
The symmetries of a finite graph are described by its automorphism group; in the setting of Woronowicz's quantum groups, a notion of a quantum automorphism group has been defined by Banica capturing the quantum symmetries of the graph. In…
We introduce the concept of regular quantum graphs and construct connected quantum graphs with discrete symmetries. The method is based on a decomposition of the quantum propagator in terms of permutation matrices which control the way…