Related papers: Random graph states, maximal flow and Fuss-Catalan…
We study various methods to generate ensembles of random density matrices of a fixed size N, obtained by partial trace of pure states on composite systems. Structured ensembles of random pure states, invariant with respect to local unitary…
Random pure states of multi-partite quantum systems, associated with arbitrary graphs, are investigated. Each vertex of the graph represents a generic interaction between subsystems, described by a random unitary matrix distributed…
We introduce a mapping between graphs and pure quantum bipartite states and show that the associated entanglement entropy conveys non-trivial information about the structure of the graph. Our primary goal is to investigate the family of…
We study the entanglement entropy of a random tensor network (RTN) using tools from free probability theory. Random tensor networks are simple toy models that help the understanding of the entanglement behavior of a boundary region in the…
We develop random graph models where graphs are generated by connecting not only pairs of vertices by edges but also larger subsets of vertices by copies of small atomic subgraphs of arbitrary topology. This allows the for the generation of…
Random quantum states and operations are of fundamental and practical interests. In this work, we investigate the entanglement properties of random hypergraph states, which generalize the notion of graph states by applying generalized…
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…
We present experimentally and numerically accessible quantities that can be used to differentiate among various families of random entangled states. To this end, we analyze the entanglement properties of bipartite reduced states of a…
Using a maximum entropy principle to assign a statistical weight to any graph, we introduce a model of random graphs with arbitrary degree distribution in the framework of standard statistical mechanics. We compute the free energy and the…
We propose and investigate a unifying class of sparse random graph models, based on a hidden coloring of edge-vertex incidences, extending an existing approach, Random graphs with a given degree distribution, in a way that admits a…
We connect quantum graphs with infinite leads, and turn them to scattering systems. We show that they display all the features which characterize quantum scattering systems with an underlying classical chaotic dynamics: typical poles, delay…
We study the symmetry-resolved genuine multi-entropy, a measure that captures genuine multi-partite entanglement, in Haar random states and random graph states in the presence of a conserved quantity. For Haar random states, we derive…
Entanglement is a fundamental resource for many applications in quantum information processing. Here, we investigate how quantum transport in simple quantum graphs, modeled as controlled two-level quantum systems, can be utilized to…
We analyze the properties of entangled random pure states of a quantum system partitioned into two smaller subsystems of dimensions $N$ and $M$. Framing the problem in terms of random matrices with a fixed-trace constraint, we establish,…
Let a pure state \psi be chosen randomly in an NM-dimensional Hilbert space, and consider the reduced density matrix \rho of an N-dimensional subsystem. The bipartite entanglement properties of \psi are encoded in the spectrum of \rho. By…
In this work, we study some statistical properties of the extreme eigenstates of the randomly-weighted adjacency matrices of random graphs. We focus on two random graph models: Erd\H{o}s-R\'{e}nyi (ER) graphs and random geometric graphs…
Braunstein et. al. have started the study of entanglement properties of the quantum states through graph theoretical approach. Their idea was to start from a simple unweighted graph $G$ and then they have defined the quantum state from the…
We investigate the entanglement of the ground state in the quantum networks that their nodes are considered as quantum harmonic oscillators. To this aim, the Schmidt numbers and entanglement entropy between two arbitrary partitions of a…
Graph states are versatile resources for quantum computation and quantum-enhanced measurement. Their generation illustrates a high level of control over entanglement. We report on the generation of continuous-variable graph states of atomic…
We analyze composed quantum systems consisting of $k$ subsystems, each described by states in the $n$-dimensional Hilbert space. Interaction between subsystems can be represented by a graph, with vertices corresponding to individual…