Related papers: Connectivity for quantum graphs via quantum adjace…
Quantum computing (QC) is a new computational paradigm whose foundations relate to quantum physics. Notable progress has been made, driving the birth of a series of quantum-based algorithms that take advantage of quantum computational…
A finite dimensional operator that commutes with some symmetry group admits quotient operators, which are determined by the choice of associated representation. Taking the quotient isolates the part of the spectrum supporting the chosen…
We study a set of scattering matrices of quantum graphs containing minimal number of passbands, i.e., maximal number of zero elements. The cases of even and odd vertex degree are considered. Using a solution of inverse scattering problem,…
The standard notion of the Laplacian of a graph is generalized to the setting of a graph with the extra structure of a ``transmission`` system. A transmission system is a mathematical representation of a means of transmitting…
Token graphs, or symmetric powers of graphs, see \cite{alavi2002survey} and \cite{Fabila-Monroy2012}, are defined on the $k$-combinations of the vertex set of some graph $L$, where edges exist between two such combinations, if their…
In some previous works, the analytic structure of the spectrum of a quantum graph operator as a function of the vertex conditions and other parameters of the graph was established. However, a specific local coordinate chart on the…
Graph rigidity, the study of vertex realizations in $\mathbb{R}^d$ and the motions that preserve the induced edge lengths, has been the focus of extensive research for decades. Its equivalency to graph connectivity for $d=1$ is well known;…
We introduce an operator-algebraic framework for Morita equivalence of quantum graphs based on $\Delta$-equivalence of operator systems introduced by Eleftherakis, Kakariadis and Todorov. Adopting the perspective of Weaver, we view quantum…
We study the statistical properties of the scattering matrix associated with generic quantum graphs. The scattering matrix is the quantum analogue of the classical evolution operator on the graph. For the energy-averaged spectral form…
Quantum graphs have recently emerged as models of nonlinear optical, quantum confined systems with exquisite topological sensitivity and the potential for predicting structures with an intrinsic, off-resonance response approaching the…
Properties of graphs that can be characterized by the spectrum of the adjacency matrix of the graph have been studied systematically recently. Motivated by the complexity of these properties, we show that there are such properties for which…
We prove quantum ergodicity and quantum mixing for sequences of finite Schreier graphs converging to an infinite Cayley graph whose adjacency operator has absolutely continuous spectrum. Under Benjamini-Schramm convergence (or strong…
One-dimensional atomic mixtures of fermions can effectively realize spin chains and thus constitute a clean and controllable platform to study quantum magnetism. Such strongly correlated quantum systems are also of sustained interest to…
The $k$-token graph $F_k(G)$ of a graph $G$ on $n$ vertices is the graph whose vertices are the ${n\choose k}$ $k$-subsets of vertices from $G$, two of which being adjacent whenever their symmetric difference is a pair of adjacent vertices…
We consider the dynamics on a quantum graph as the limit of the dynamics generated by a one-particle Hamiltonian in R^2 with a potential having a deep strict minimum on the graph, when the width of the well shrinks to zero. For a generic…
Quantum graphs have been introduced by Duan, Severini, and Winter to describe the zero-error behaviour of quantum channels. Since then, quantum graph theory has become a field of study in its own right. A substantial source of difficulty in…
Algebro-geometric methods have proven to be very successful in the study of graphical models in statistics. In this paper we introduce the foundations to carry out a similar study of their quantum counterparts. These quantum graphical…
The algebraic connectivity of a graph $G$ in a finite dimensional real normed linear space $X$ is a geometric counterpart to the Fiedler number of the graph and can be regarded as a measure of the rigidity of the graph in $X$. We analyse…
Any directed graph G with N vertices and J edges has an associated line-graph L(G) where the J edges form the vertices of L(G). We show that the non-zero eigenvalues of the adjacency matrices are the same for all graphs of such a family…
In this paper we study the connectivity properties of the random subgraph of the $n$-cube generated by the $k$-out model and denoted by $Q^n(k)$. Let $k$ be an integer, $1\leq k \leq n-1$. We let $Q^n(k)$ be the graph that is generated by…