Related papers: Random graph states, maximal flow and Fuss-Catalan…
We propose a method to calculate the purity of reduced states of graph states entirely within the stabilizer formalism, using only the stabilizer generators for a given state. We apply this method to find the Concentratable Entanglement of…
In this paper, we introduce a novel model for random hypergraphs based on weighted random connection models. In accordance with the standard theory for hypergraphs, this model is constructed from a bipartite graph. In our stochastic model,…
A quantum state's entanglement across a bipartite cut can be quantified with entanglement entropy or, more generally, Schmidt norms. Using only Schmidt decompositions, we present a simple iterative algorithm to maximize Schmidt norms.…
We attempt to reveal the geometry, emerged from the entanglement structure of any general $N$-party pure quantum many-body state by representing entanglement entropies corresponding to all $2^N $ bipartitions of the state by means of a…
Non-local properties of ensembles of quantum gates induced by the Haar measure on the unitary group are investigated. We analyze the entropy of entanglement of a unitary matrix U equal to the Shannon entropy of the vector of singular values…
We provide a summary of both seminal and recent results on typical entanglement. By typical values of entanglement, we refer here to values of entanglement quantifiers that (given a reasonable measure on the manifold of states) appear with…
Statistical field theory methods have been very successful with a number of random graph and random matrix problems, but it is challenging to apply these methods to graphs with prescribed degree sequences due to the extensive number of…
In a seminal paper, Page found the exact formula for the average entanglement entropy for a pure random state. We consider the analogous problem for the ensemble of pure fermionic Gaussian states, which plays a crucial role in the context…
We construct explicit families of graphs whose eigenvalues are asymptotically distributed according to Wigner's semicircle law; in other words, that are spectrally indistinguishable from random graphs. However, in other respects they are…
Motivated by an application in community detection, we consider an \ER random graph conditioned on the rare event that all connected components are fully connected. Such graphs can be considered as partitions of vertices into cliques.…
We study the average bipartite entanglement entropy of Haar-random pure states in quantum many-body systems with global $\mathrm{SU}(2)$ symmetry, constrained to fixed total spin $J$ and magnetization $J_z = 0$. Focusing on spin-$\tfrac12$…
The classical Gaussian ensembles of random matrices can be constructed by maximizing Boltzmann-Gibbs-Shannon's entropy, S_{BGS} = - \int d{\bf H} [P({\bf H})] \ln [P({\bf H})], with suitable constraints. Here we construct and analyze…
The scattering amplitude in simple quantum graphs is a well-known process which may be highly complex. In this work, motivated by the Shannon entropy, we propose a methodology that associates to a graph a scattering entropy, which we call…
Inspired by applications to theories of coding and communication in networks of nervous tissue, we study maximum entropy distributions on weighted graphs with a given expected degree sequence. These distributions are characterized by…
Sampling random graphs is essential in many applications, and often algorithms use Markov chain Monte Carlo methods to sample uniformly from the space of graphs. However, often there is a need to sample graphs with some property that we are…
In this thesis we study the behavior of bipartite entanglement of a large quantum system, by analyzing the distribution of the Schmidt coefficients of the reduced density matrix. Applying the general methods of classical statistical…
We develop a statistical mechanics approach for random networks with uncorrelated vertices. We construct equilibrium statistical ensembles of such networks and obtain their partition functions and main characteristics. We find simple…
Complex networks structures have been extensively used for describing complex natural and technological systems, like the Internet or social networks. More recently complex network theory has been applied to quantum systems, where complex…
Uncover the vertices of a given graph, deterministic or random, in random order; we consider both a discrete-time and a continuous-time version. We study the evolution of the number of visible edges, and show convergence after normalization…
The characterization of ensembles of many-qubit random states and their realization via quantum circuits are crucial tasks in quantum-information theory. In this work, we study the ensembles generated by quantum circuits that randomly…