Related papers: Reflected entropy in random tensor networks III: t…
We apply the bit thread formulation of holographic entanglement entropy to reduced states describing only the geometry contained within an entanglement wedge. We argue that a certain optimized bit thread configuration, which we construct,…
The quantum max-flow min-cut conjecture relates the rank of a tensor network to the minimum cut in the case that all tensors in the network are identical\cite{mfmc1}. This conjecture was shown to be false in Ref. \onlinecite{mfmc2} by an…
We consider a class of holographic quantum error-correcting codes, built from perfect tensors in network configurations dual to Bruhat-Tits trees and their quotients by Schottky groups corresponding to BTZ black holes. The resulting…
We argue that holographic CFT states require a large amount of tripartite entanglement, in contrast to the conjecture that their entanglement is mostly bipartite. Our evidence is that this mostly-bipartite conjecture is in sharp conflict…
Renyi reflected entropies of order $n \geq 2$ are correlation measures that have been introduced in the field of holography. In this work, we put the spotlight on the min-reflected entropy, i.e., the Renyi reflected entropy in the limit $n…
We obtain the reflected entropy for bipartite mixed state configurations involving two disjoint and adjacent subsystems in two dimensional boundary conformal field theories (BCFT$_2$s) in a black hole background. The bulk dual is described…
We present improved distributed algorithms for triangle detection and its variants in the CONGEST model. We show that Triangle Detection, Counting, and Enumeration can be solved in $\tilde{O}(n^{1/2})$ rounds. In contrast, the previous…
Networks provide a popular representation of complex data. Often, different types of relational measurements are taken on the same subjects. Such data can be represented as a \textit{multislice network}, a collection of networks on the same…
Noisy intermediate-scale quantum (NISQ) computers have gate errors and decoherence, limiting the depth of circuits that can be implemented on them. A strategy for NISQ algorithms is to reduce the circuit depth at the expense of increasing…
In this paper, we present a detailed framework to analyze the evolution of the random topology of a time-varying wireless network via the information theoretic notion of entropy rate. We consider a propagation channel varying over time with…
In this note, we revisit the recursive random contraction algorithm of Karger and Stein for finding a minimum cut in a graph. Our revisit is occasioned by a paper of Fox, Panigrahi, and Zhang which gives an extension of the Karger-Stein…
We study holographic entanglement entropy in four-dimensional quantum gravity with negative cosmological constant. By using the replica trick and evaluating path integrals in the minisuperspace approximation, in conjunction with the…
The Renyi entropies as a generalization of the entanglement entropy imply much more information. We analytically calculate the Renyi entropies (with a spherical entangling surface) by means of a class of neutral hyperbolic black holes with…
We map the dynamics of entanglement in random unitary circuits, with finite on-site Hilbert space dimension $q$, to an effective classical statistical mechanics, and develop general diagrammatic tools for calculations in random unitary…
Inference problems with conjectured statistical-computational gaps are ubiquitous throughout modern statistics, computer science and statistical physics. While there has been success evidencing these gaps from the failure of restricted…
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…
For a static time slice of AdS$_3$ we describe a particular class of minimal surfaces which form trivalent networks of geodesics. Through geometric arguments we provide evidence that these surfaces describe a measure of multipartite…
We initiate a systematic enumeration and classification of entropy inequalities satisfied by the Ryu-Takayanagi formula for conformal field theory states with smooth holographic dual geometries. For 2, 3, and 4 regions, we prove that the…
Tensor networks impose a notion of geometry on the entanglement of a quantum system. In some cases, this geometry is found to reproduce key properties of holographic dualities, and subsequently much work has focused on using tensor networks…
In this article we investigate aspects of entanglement entropy and mutual information in a large-N strongly coupled noncommutative gauge theory, both at zero and at finite temperature. Using the gauge-gravity duality and the Ryu-Takayanagi…