Related papers: Quantum geodesic flows on graphs
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…
In this thesis, we study Laplacian eigenfunctions on metric graphs, also known as quantum graphs. We restrict the discussion to standard quantum graphs. These are finite connected metric graphs with functions that satisfy Neumann vertex…
Real world data often lie on low-dimensional Riemannian manifolds embedded in high-dimensional spaces. This motivates learning degenerate normalizing flows that map between the ambient space and a low-dimensional latent space. However, if…
We address the problem of the construction of quantum walks on Cayley graphs. Our main motivation is the relationship between quantum algorithms and quantum walks. In particular, we discuss the choice of the dimension of the local Hilbert…
We derive a number of upper and lower bounds for the first nontrivial eigenvalue of a finite quantum graph in terms of the edge connectivity of the graph, i.e., the minimal number of edges which need to be removed to make the graph…
We review quantum gravity model building using the new formalism of `quantum Riemannian geometry' to construct this on finite discrete spaces and on fuzzy ones such as matrix algebras. The formalism starts with a `differential structure' as…
We investigate a graph theoretic analog of geodesic geometry. In a graph $G=(V,E)$ we consider a system of paths $\mathcal{P}=\{P_{u,v}|u,v\in V\}$ where $P_{u,v}$ connects vertices $u$ and $v$. This system is consistent in that if vertices…
The problems of computing eccentricity, radius, and diameter are fundamental to graph theory. These parameters are intrinsically defined based on the distance metric of the graph. In this work, we propose quantum algorithms for the diameter…
We consider the nonlinear problem of determining a connection and a Higgs field from the corresponding parallel transport along geodesics on a Riemannian manifold with boundary, in any dimension. The problem can be reduced to an integral…
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…
This article examines the inverse problem for a lossy quantum graph that is internally excited and sensed. In particular, we supply an algorithmic methodology for deducing the topology and geometric structure of the underlying metric graph.…
This is a self-contained introduction to quantum Riemannian geometry based on quantum groups as frame groups, and its proposed role in quantum gravity. Much of the article is about the generalisation of classical Riemannian geometry that…
We find geodesics, shortest arcs, cut loci, first conjugate loci, distances between arbitrary elements for some left-invariant sub-Riemannian metrics on the Lie groups $SU(2)\times\mathbb{R}$ and $SO(3)\times\mathbb{R}$.
In this paper, firstly we study some left invariant Riemannian metrics on para-hypercomplex 4-dimensional Lie groups. In each Lie group, the Levi-Civita connection and sectional curvature have been given explicitly. We also show these…
Using the concept of projective systems for linear codes and elementary linear algebra, we show that projective $[n,k]_q$ codes form a connected subgraph in the Grassmann graph consisting of $k$-dimensional subspaces of an $n$-dimensional…
Given any two vertices u, v of a random geometric graph, denote by d_E(u,v) their Euclidean distance and by d_G(u,v) their graph distance. The problem of finding upper bounds on d_G(u,v) in terms of d_E(u,v) has received a lot of attention…
We present a method for associating labeled directed graphs to finite-dimensional Lie algebras, thereby enabling rapid identification of key structural algebraic features. To formalize this approach, we introduce the concept of…
In this paper, we provide an algorithm for traversing geometric graphs which visits all vertices, and reports every vertex and edge exactly once. To achieve this, we combine a given geometric graph $G$ with the integer lattice, seen as a…
A graph $G$ is $k$-edge geodetic graph if every edge of $G$ lies in at least one geodesic of length $k$. We studied some basic properties of $k$-edge geodetic graphs. We investigated the $k$ edge-geodeticity of complete bipartite graph…
The QE constant of a finite connected graph $G$, denoted by $\mathrm{QEC}(G)$, is by definition the maximum of the quadratic function associated to the distance matrix on a certain sphere of codimension two. We prove that the QE constants…