Related papers: Investigation graph isomorphism problem via entang…
The spectral density of random graphs with topological constraints is analysed using the replica method. We consider graph ensembles featuring generalised degree-degree correlations, as well as those with a community structure. In each case…
Precisely quantifying the heterogeneity or disorder of a network system is very important and desired in studies of behavior and function of the network system. Although many degree-based entropies have been proposed to measure the…
Using quantum simulations on classical hardware, we study the phase diagram of the massive Schwinger model with a $\theta$-term at finite chemical potential $\mu$. We find that the quantum critical point in the phase diagram of the model…
Spectral embedding of graphs uses the top k non-trivial eigenvectors of the random walk matrix to embed the graph into R^k. The primary use of this embedding has been for practical spectral clustering algorithms [SM00,NJW02]. Recently,…
We discuss the scaling of entanglement entropy in the random singlet phase (RSP) of disordered quantum magnetic chains of general spin-S. Through an analysis of the general structure of the RSP, we show that the entanglement entropy scales…
We present Graph Random Neural Features (GRNF), a novel embedding method from graph-structured data to real vectors based on a family of graph neural networks. The embedding naturally deals with graph isomorphism and preserves the metric…
We consider graph states of arbitrary number of particles undergoing generic decoherence. We present methods to obtain lower and upper bounds for the system's entanglement in terms of that of considerably smaller subsystems. For an…
In this paper we present a general procedure that allows for the reduction or expansion of any network (considered as a weighted graph). This procedure maintains the spectrum of the network's adjacency matrix up to a set of eigenvalues…
We develop a novel real-time approach to computing the entanglement between spatial regions for Gaussian states in quantum field theory. The entanglement entropy is characterized in terms of local correlation functions on space-like Cauchy…
Graph embeddings are a ubiquitous tool for machine learning tasks, such as node classification and link prediction, on graph-structured data. However, computing the embeddings for large-scale graphs is prohibitively inefficient even if we…
We show that the (normalized) symmetric Laplacian of a simple graph can be obtained from the partial trace over a pure bipartite quantum state that resides in a bipartite Hilbert space (one part corresponding to the vertices, the other…
We consider the large $N$ interacting vector $O(N)$ model on a sphere in $4-\epsilon$ Euclidean dimensions. The Gaussian theory in the UV is taken to be either conformally or non-conformally coupled. The endpoint of the RG flow corresponds…
We investigate the "stratified Ehrhart ring theory" for periodic graphs, which gives an algorithm for determining the growth sequences of periodic graphs. The growth sequence $(s_{\Gamma, x_0, i})_{i \ge 0}$ is defined for a graph $\Gamma$…
We use holography in order to study the entanglement entropy for a spherical entangling surface in a FRW background with an arbitrary time dependence of the scale factor. The calculation is done in various dimensions, allowing for nonzero…
In this paper, we study the problem of sampling random supersingular elliptic curves with unknown endomorphism rings. This problem has recently gained considerable attention as many isogeny-based cryptographic protocols require such…
We present quantum algorithms for various problems related to graph connectivity. We give simple and query-optimal algorithms for cycle detection and odd-length cycle detection (bipartiteness) using a reduction to st-connectivity.…
Starting from recent results on the geometric formulation of quantum mechanics, we propose a new information geometric characterization of entanglement for spin network states in the context of quantum gravity. For the simple case of a…
Graph isomorphism problem is a known hard problem. In this paper, a novel randomized algorithm is proposed for this problem which is very simple and fast. It solves the graph isomorphism problem with running time O(n^2.373) for any pair of…
We introduce an experimentally accessible network representation for many-body quantum states based on entanglement between all pairs of its constituents. We illustrate the power of this representation by applying it to a paradigmatic spin…
Quantum entanglement entropy has a geometric character. This is illustrated by the interpretation of Rindler space or black hole entropy as entanglement entropy. In general, one can define a "geometric entropy", associated with an event…