Related papers: Quantum state representation based on combinatoria…
For a compact, connected metric graphs with a boundary that consists of $k$ vertices, we prove that an arbitrary symmetric $k\times k$ matrix with real entries can be realized as the Dirichlet-to-Neumann operator for the Laplacian plus a…
Consider any random graph model where potential edges appear independently, with possibly different probabilities, and assume that the minimum expected degree is omega(ln n). We prove that the adjacency matrix and the Laplacian of that…
We propose representation of configurational physical quantities and microscopic structures for multicomponent system on lattice, by extending a concept of generalized Ising model (GIM) to graph theory. We construct graph Laplacian (and…
The von Neumann graph entropy is a measure of graph complexity based on the Laplacian spectrum. It has recently found applications in various learning tasks driven by networked data. However, it is computational demanding and hard to…
Recently normalized Laplacian matrices of graphs are studied as density matrices in quantum mechanics. Separability and entanglement of density matrices are important properties as they determine the nonclassical behavior in quantum…
We introduce a class of states characterized by proposed conditions of homogeneity and isotropy in loop quantum gravity and construct concrete examples given by Bell-network states on a special class of homogeneous graphs. Such states…
This manuscript introduces a computationally efficient method to calculate the nonlinearity of a quantum feature map, as well as a method for determining whether a quantum feature map will have a high concentration of quantum states. The…
We study the interplay between spectrum, geometry and boundary conditions for two distinguished self-adjoint realisations of the Laplacian on infinite metric graphs, the so-called riedrichs and Neumann extensions. We introduce a new…
Using the signed laplacian matrix, and weighted and hybrid graphs, we present additional ways to interpret graphs as grid states. Hybrid graphs offer the most general interpretation. Existing graphical methods that characterize entanglement…
Motivated by discrete Laplacian differential operators with various accuracy orders in numerical analysis, we introduce new matrices attached to a simple graph that can be considered graph Laplacians with higher accuracy. In particular, we…
Building upon our previous work, on graphical representation of a quantum state by signless Laplacian matrix, we pose the following question. If a local unitary operation is applied to a quantum state, represented by a signless Laplacian…
We introduce an unsupervised graph embedding that trades off local node similarity and connectivity, and global structure. The embedding is based on a generalized graph Laplacian, whose eigenvectors compactly capture both network structure…
A finite discrete graph is turned into a quantum (metric) graph once a finite length is assigned to each edge and the one-dimensional Laplacian is taken to be the operator. We study the dependence of the spectral gap (the first positive…
We consider the problem of finding universal bounds of "isoperimetric" or "isodiametric" type on the spectral gap of the Laplacian on a metric graph with natural boundary conditions at the vertices, in terms of various analytical and…
We present new combinatorial objects, which we call grid-labelled graphs, and show how these can be used to represent the quantum states arising in a scenario which we refer to as the faulty emitter scenario: we have a machine designed to…
Matrix representations of quantum operators are computationally complete but often obscure the structural topology of information flow within a quantum circuit \cite{nielsen2000}. In this paper, we introduce a generalized graph-theoretic…
Graph-theoretic structures play a central role in the description and analysis of quantum systems. In this work, we introduce a new class of quantum states, called $A_\alpha$-graph states, which are constructed from either unweighted or…
We derive an intuitive and novel method to represent nodes in a graph with special unitary operators, or quantum operators, which does not require parameter training and is competitive with classical methods on scoring similarity between…
The spectral gap for Laplace operators on metric graphs is investigated in relation to graph's connectivity, in particular what happens if an edge is added to (or deleted from) a graph. It is shown that in contrast to discrete graphs…
Typically, graph structures are represented by one of three different matrices: the adjacency matrix, the unnormalised and the normalised graph Laplacian matrices. The spectral (eigenvalue) properties of these different matrices are…