Related papers: Crossing versus locking: Bit threads and continuum…
Stirring a two-dimensional viscous fluid with rods is often an effective way to mix. The topological features of periodic rod motions give a lower bound on the topological entropy of the induced flow map, since material lines must `catch'…
We investigate the time-dependent, coherent, and dissipative dynamics of bound particles in single multilevel quantum dots in the presence of sequential tunnelling transport. We focus on the nonequilibrium regime where several channels are…
Intrinsic computation refers to how dynamical systems store, structure, and transform historical and spatial information. By graphing a measure of structural complexity against a measure of randomness, complexity-entropy diagrams display…
The relation between Loop Quantum Gravity (LQG) and tensor network is explored from the perspectives of bulk-boundary duality and holographic entanglement entropy. We find that the LQG spin-network states in a space $\Sigma$ with boundary…
It has been proposed that the areas of marginally trapped or anti-trapped surfaces (also known as leaves of holographic screens) may encode some notion of entropy. To connect this to AdS/CFT, we study the case of marginally trapped surfaces…
We consider communication over binary-input memoryless output-symmetric channels using low-density parity-check codes and message-passing decoding. The asymptotic (in the length) performance of such a combination for a fixed number of…
We consider fixed boundary flow with canonical interpretability as principal components extended on non-linear Riemannian manifolds. We aim to find a flow with fixed starting and ending points for noisy multivariate data sets lying on an…
Sufficient conditions are given for the computation of accessing arcs and arcs that links boundary components of multiply connected domains. The existence of a not-computably-accessible but computable point on a computably compact arc is…
We study the short-distance structure of geometric entanglement entropy in certain theories with a built-in scale of nonlocality. In particular we examine the cases of Little String Theory and Noncommutative Yang-Mills theory, using their…
In this paper, we study the holographic quantum entanglement structure in the finite-temperature CFT state/planar BTZ black hole correspondence from the perspective of entanglement threads. Unlike previous studies based on bit threads,…
The entanglement of purification (EoP), which measures the classical correlations and entanglement of a given mixed state, has been conjectured to be dual to the area of the minimal cross section of the entanglement wedge in holography.…
We consider $\mathbb{Z}_N$ orbifolds of Type-II compactifications to four and six dimensions on several Calabi-Yau manifolds in the orbifold limit with the aim to compute the entanglement entropy. The spectrum can contain tachyons in the…
We show that the clustering coefficient, a standard measure in network theory, when applied to flow networks, i.e. graph representations of fluid flows in which links between nodes represent fluid transport between spatial regions,…
Progress in identifying the bulk microstate interpretation of the Ryu-Takayanagi formula requires understanding how to define entanglement entropy in the bulk closed string theory. Unfortunately, entanglement and Hilbert space factorization…
Quantum many-body states that frequently appear in physics often obey an entropy scaling law, meaning that an entanglement entropy of a subsystem can be expressed as a sum of terms that scale linearly with its volume and area, plus a…
Interconnection networks provide an effective mechanism for exchanging data between processors in a parallel computing system. One of the most efficient interconnection networks is the hypercube due to its structural regularity, potential…
Triadic closure has been conceptualized and measured in a variety of ways, most famously the clustering coefficient. Existing extensions to affiliation networks, however, are sensitive to repeat group attendance, which manifests in…
We provide a versatile upper bound on the number of maximally entangled qubits, or private bits, shared by two parties via a generic adaptive communication protocol over a quantum network when the use of classical communication is not…
We study a driven many particle system comprising of two identical lanes of finite lengths. On one lane, particles hop diffusively with a bias in a specific direction. On the other lane, particles hop in a specific direction obeying mutual…
Characterizing the capacity region for a network can be extremely difficult. Even with independent sources, determining the capacity region can be as hard as the open problem of characterizing all information inequalities. The majority of…