Related papers: Quantum state representation based on combinatoria…
The delta interaction at a vertex generalizes the Robin (generalized Neumann) boundary condition on an interval. Study of a single vertex with N infinite leads suffices to determine the localized effects of such a vertex on densities of…
Due to the limited resources and the scale of the graphs in modern datasets, we often get to observe a sampled subgraph of a larger original graph of interest, whether it is the worldwide web that has been crawled or social connections that…
There is a wealth of applied problems that can be posed as a dynamical system defined on a network with both attractive and repulsive interactions. Some examples include: understanding synchronization properties of nonlinear oscillator;,…
Analysis of signals defined on complex topologies modeled by graphs is a topic of increasing interest. Signal decomposition plays a crucial role in the representation and processing of such information, in particular, to process graph…
Many inequality relations between real vector quantities can be succinctly expressed as "weak (sub)majorization" relations. We explain these ideas and apply them in several areas: angles between subspaces, Ritz values, and graph Laplacian…
We study multi-qubit variational quantum states that can be considered as vertex- and edge-weighted graph. These states are constructed as single-layer variational circuits with $RX$ rotations and $RZZ$ entangling gates, corresponding to…
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…
A method of resummation of infinite series of perturbation theory diagrams is applied for studying the properties of random band matrices. The topological classification of Feynman diagrams, which was actively used in last years for matrix…
We discuss Laplacian spectrum on a finite metric graph with vertex couplings violating the time-reversal invariance. For the class of star graphs we determine, under the condition of a fixed total edge length, the configurations for which…
Normalized Laplacian matrices of graphs have recently been studied in the context of quantum mechanics as density matrices of quantum systems. Of particular interest is the relationship between quantum physical properties of the density…
We develop a graph-based method to study the entanglement entropy of Calderbank-Shor-Steane quantum codes. This method offers a straightforward interpretation for the entanglement entropy of quantum error correcting codes through…
In this paper, we examine covering graphs that are obtained from the $d$-dimensional integer lattice by adding pendant edges. In the case of $d=1$, we show that the Laplacian on the graph has a spectral gap and establish a necessary and…
The construction of a meaningful graph plays a crucial role in the success of many graph-based representations and algorithms for handling structured data, especially in the emerging field of graph signal processing. However, a meaningful…
Graph-based linear scaling electronic structure theory for quantum-mechanical molecular dynamics simulations is adapted to the most recent shadow potential formulations of extended Lagrangian Born-Oppenheimer molecular dynamics, including…
In this paper, we present GGSD, a novel graph generative model based on 1) the spectral decomposition of the graph Laplacian matrix and 2) a diffusion process. Specifically, we propose to use a denoising model to sample eigenvectors and…
Given the algebra of observables of a quantum system subject to selection rules, a state can be represented by different density matrices. As a result, different von Neumann entropies can be associated with the same state. Motivated by a…
We extend the latent position random graph model to the line graph of a random graph, which is formed by creating a vertex for each edge in the original random graph, and connecting each pair of edges incident to a common vertex in the…
We derive a Tolman-Oppenheimer-Volkoff equation in neutron star systems within the modified $f(T, \mathcal{T})$-gravity class of models using a perturbative approach. In our approach $f(T, \mathcal{T})$-gravity is considered to be a static…
Spectral embedding is a procedure which can be used to obtain vector representations of the nodes of a graph. This paper proposes a generalisation of the latent position network model known as the random dot product graph, to allow…
We compute the three point correlation function for the eigenvalues of the Laplacian on quantum star graphs in the limit where the number of edges tends to infinity. This extends a work by Berkolaiko and Keating, where they get the 2-point…