Related papers: Reflected entropy in random tensor networks III: t…
Concepts of information theory are increasingly used to characterize collective phenomena in condensed matter systems, such as the use of entanglement entropies to identify emergent topological order in interacting quantum many-body…
Hypergraphs have gained increasing attention in the machine learning community lately due to their superiority over graphs in capturing super-dyadic interactions among entities. In this work, we propose a novel approach for the partitioning…
We develop a transfer operator approach for the calculation of R\'enyi entanglement entropies in arbitrary (i.e. Abelian and non-Abelian) pure lattice gauge theory projected entangled pair states in 2+1 dimensions. It is explicitly shown…
The efficient generation of random quantum states is a long-standing challenge, motivated by their diverse applications in quantum information processing tasks. In this work, we identify entanglement as the key resource that enables local…
We compute all third-order local invariants accessible via randomised measurements and employ them to derive separability criteria. The reconstruction of the invariants yields experimentally accessible entanglement criteria for multipartite…
Random tensor network states are toy models for holographic duality, which have entanglement properties determined by graph geometry. In this paper, we propose a generalization of the random tensor network states which describe an ensemble…
We provide a simple new randomized contraction approach to the global minimum cut problem for simple undirected graphs. The contractions exploit 2-out edge sampling from each vertex rather than the standard uniform edge sampling. We…
We generalize the constructions for the multipartite reflected entropy in order to construct spacetimes capable of representing multipartite entanglement wedge cross sections of differing party number as Ryu-Takayanagi surfaces on a single…
Recent work has characterized the various inequalities that entanglement entropies represented by min-cuts on hypergraphs will satisfy. This collection, the hypergraph entropy cone, can be seen as a generalization of the holographic entropy…
Charged and symmetry-resolved R\'enyi entropies are entanglement measures quantifying the degree of entanglement within different charge sectors of a theory with a conserved global charge. We use holography to determine the dependence of…
Relative entropy of entanglement (REE) is an entanglement measure of bipartite mixed states, defined by the minimum of the relative entropy $S(\rho_{AB}|| \sigma_{AB})$ between a given mixed state $\rho_{AB}$ and an arbitrary separable…
We extend the reflected entropy to the bipartite state in a two dimensional Galilean conformal field theory ($GCFT_2$) which is dual to the asymptotically flat spacetime described by the generalized minimal massive gravity (GMMG). To this…
The entanglement negativity $\mathcal{E}(A:B)$ is a useful measure of quantum entanglement in bipartite mixed states. In random tensor networks (RTNs), which are related to fixed-area states, it was found in [arXiv:2101.11029] that the…
Tensor ring (TR) decomposition is a simple but effective tensor network for analyzing and interpreting latent patterns of tensors. In this work, we propose a doubly randomized optimization framework for computing TR decomposition. It can be…
We present an analytical approach for describing spectrally constrained maximum entropy ensembles of finitely connected regular loopy graphs, valid in the regime of weak loop-loop interactions. We derive an expression for the leading two…
The Ryu-Takayanagi formula implies many general properties of entanglement entropies in holographic theories. We review the known properties, such as continuity, strong subadditivity, and monogamy of mutual information, and fill in gaps in…
This work presents a study of the entanglement entropy (EE) in a class of four-dimensional ${\cal N}=1$ linear quiver SCFTs deformed by the presence of a VEV. We review the holographic backgrounds dual to these theories, and calculate the…
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subset of variables yields a subproblem of the reduced complexity…
This work presents a comprehensive understanding of the estimation of a planted low-rank signal from a general spiked tensor model near the computational threshold. Relying on standard tools from the theory of large random matrices, we…
An r-cut of a k-uniform hypergraph H is a partition of the vertex set of H into r parts and the size of the cut is the number of edges which have a vertex in each part. A classical result of Edwards says that every m-edge graph has a 2-cut…