Related papers: Intertwining Curvature Bounds for Graphs and Quant…
We establish a sharp lower bound on the first non-trivial eigenvalue of the Laplacian on a metric graph equipped with natural (i.e., continuity and Kirchhoff) vertex conditions in terms of the diameter and the total length of the graph.…
We show that if the random walk on a graph has positive coarse Ricci curvature in the sense of Ollivier, then the stationary measure satisfies a W^1 transport-entropy inequality. Peres and Tetali have conjectured a stronger consequence,…
We study functional inequalities for Markov chains on discrete spaces with entropic Ricci curvature bounded from below. Our main results are that when curvature is non-negative, but not necessarily positive, the spectral gap, the Cheeger…
We establish for the first time the explicit curvature formulas for the horizontal and vertical edges of the strong product of two regular graphs. We complement this result with showing that there does not exist an analogous formula for the…
We consider families of finite quantum graphs of increasing size and we are interested in how eigenfunctions are distributed over the graph. As a measure for the distribution of an eigenfunction on a graph we introduce the entropy, it has…
We introduce a new framework that yields spectral bounds on norms of functions of transition maps for finite, homogeneous Markov chains. The techniques employed work for bounded semigroups, in particular for classical as well as for quantum…
In this short note, we establish an edge-isoperimetric inequality for arbitrary product graphs. Our inequality is sharp for subsets of many different sizes in every product graph. In particular, it implies that the $2^d$-element sets with…
We determine the optimum topology of quasi-one dimensional nonlinear optical structures using generalized quantum graph models. Quantum graphs are relational graphs endowed with a metric and a multiparticle Hamiltonian acting on the edges,…
We investigate the relationship between one of the classical notions of boundaries for infinite graphs, \emph{graph ends}, and self-adjoint extensions of the minimal Kirchhoff Laplacian on a metric graph. We introduce the notion of…
We provide upper bounds on the perturbation of invariant subspaces of normal matrices measured using a metric on the space of vector subspaces of $\mathbb{C}^n$ in terms of the spectrum of both the unperturbed \& perturbed matrices, as well…
We show that an improvement to the best known quantum lower bound for GRAPH-COLLISION problem implies an improvement to the best known lower bound for TRIANGLE problem in the quantum query complexity model. In GRAPH-COLLISION we are given…
In this sequence of two papers, we introduce a curvature flow on (mixed) weighted graphs which is based on the Bakry-\'Emery calculus. The flow is described via a time-continuous evolution through the weighting schemes. By adapting this…
In this paper, we study the mean curvature flow of graphs with Neumann boundary condition. The main aim is to use the maximum principle to get the boundary gradient estimate for solutions. In particular, we obtain the corresponding…
How does one generalize differential geometric constructs such as curvature of a manifold to the discrete world of graphs and other combinatorial structures? This problem carries significant importance for analyzing models of discrete…
In this work, we propose novel families of positional encodings tailored to graph neural networks obtained with quantum computers. These encodings leverage the long-range correlations inherent in quantum systems that arise from mapping the…
Connections between continuous and discrete worlds tend to be elusive. One example is curvature. Even though there exist numerous nonequivalent definitions of graph curvature, none is known to converge in any limit to any traditional…
In order to successfully explore quantum systems which are perturbations of simple models, it is essential to understand the complexity of perturbation bounds. We must ask ourselves: How quantum many-body systems can be artificially…
We introduce a new version of a curvature-dimension inequality for non-negative curvature. We use this inequality to prove a logarithmic Li-Yau inequality on finite graphs. To formulate this inequality, we introduce a non-linear variant of…
In this second part of a sequence of two papers, we discuss the implementation of a curvature flow on weighted graphs based on the Bakry-\'Emery calculus. This flow can be adapted to preserve the Markovian property and its limits as time…
While stabilizer tableaus have proven exceptionally useful as a descriptive tool for additive quantum codes, they offer little guidance for concrete constructions or coding algorithm analysis. We introduce a representation of stabilizer…