Related papers: Connectivity for quantum graphs via quantum adjace…
A \emph{uniform random intersection graph} $G(n,m,k)$ is a random graph constructed as follows. Label each of $n$ nodes by a randomly chosen set of $k$ distinct colours taken from some finite set of possible colours of size $m$. Nodes are…
We investigate the relation between the eigenvalues of the Laplacian with Kirchhoff vertex conditions on a finite metric graph and a corresponding Titchmarsh-Weyl function (a parameter-dependent Neumann-to-Dirichlet map). We give a complete…
Networks based on entangled quantum systems enable interesting applications in quantum information processing and the understanding of the resulting quantum correlations is essential for advancing the technology. We show that the theory of…
Steady technological advances are paving the way for the implementation of the quantum internet, a network of locations interconnected by quantum channels. Here we propose a model to simulate a quantum internet based on optical fibers and…
In this paper, we discuss the concept of quantum graphs with transparent vertices by considering the case where the graph interacts with an external time-independent field. In particular, we address the problem of transparent boundary…
We develop a theory of graph algebras over general fields. This is modeled after the theory developed by Freedman, Lov\'asz and Schrijver in [22] for connection matrices, in the study of graph homomorphism functions over real edge weight…
Liu, M\"unch, and Peyerimhoff introduced the notion of Bakry-\'Emery curvature for connection graphs as a means to derive Buser-type bounds on the eigenvalues of connection Laplacians. In this work, we present a reformulation of the…
It is well--known that if one is given a principal $G$--bundle with a principal connection, then for every unitary finite--dimensional linear representation of $G$ one can induce a linear connection and a Hermitian structure on the…
We study the query complexity of determining if a graph is connected with global queries. The first model we look at is matrix-vector multiplication queries to the adjacency matrix. Here, for an $n$-vertex graph with adjacency matrix $A$,…
Neutral atom technology has steadily demonstrated significant theoretical and experimental advancements, positioning itself as a front-runner platform for running quantum algorithms. One unique advantage of this technology lies in the…
Quantum graphs have attracted attention from mathematicians for some time. A quantum graph is defined by having a Laplacian on each edge of a metric graph and imposing boundary conditions at the vertices to get an eigenvalue problem. A…
Existing approaches to analyzing the asymptotics of graph Laplacians typically assume a well-behaved kernel function with smoothness assumptions. We remove the smoothness assumption and generalize the analysis of graph Laplacians to include…
We report a method that exploits a connection between quantum contextuality and graph theory to reveal any form of quantum contextuality in high-precision experiments. We use this technique to identify a graph which corresponds to an…
For a graph $G$ and integer $k\geq1$, we define the token graph $F_k(G)$ to be the graph with vertex set all $k$-subsets of $V(G)$, where two vertices are adjacent in $F_k(G)$ whenever their symmetric difference is a pair of adjacent…
We consider the quantum site percolation model on graphs with an amenable group action. It consists of a random family of Hamiltonians. Basic spectral properties of these operators are derived: non-randomness of the spectrum and its…
We propose an efficient heuristic for mapping the logical qubits of quantum algorithms to the physical qubits of connectivity-limited devices, adding a minimal number of connectivity-compliant SWAP gates. In particular, given a quantum…
We study operators on rooted graphs with a certain spherical homogeneity. These graphs are called path commuting and allow for a decomposition of the adjacency matrix and the Laplacian into a direct sum of Jacobi matrices which reflect the…
We normalize the combinatorial Laplacian of a graph by the degree sum, look at its eigenvalues as a probability distribution and then study its Shannon entropy. Equivalently, we represent a graph with a quantum mechanical state and study…
The $k$-core of a graph is its largest subgraph with minimum degree at least $k$, a fundamental concept for uncovering hierarchical structures. In this paper, we establish a connection between the $k$-core and the high-order spectra of…
The $\alpha$-Hermitian adjacency matrix $H_\alpha$ of a mixed graph $X$ has been recently introduced. It is a generalization of the adjacency matrix of unoriented graphs. In this paper, we consider a special case of the complex number…