Related papers: Reflected entropy in random tensor networks III: t…
Conventionally, pairwise relationships between nodes are considered to be the fundamental building blocks of complex networks. However, over the last decade the overabundance of certain sub-network patterns, so called motifs, has attracted…
In this note, I revisit the problem of computing the entanglement entropy of a single interval in the ground state of a 2d CFT. I write the leading-order result in three different ways: once by doing the replica trick with the…
The relative entropy of entanglement $E_R$ is defined as the distance of a multi-partite quantum state from the set of separable states as measured by the quantum relative entropy. We show that this optimisation is always achieved, i.e. any…
The ability to selectively measure, initialize, and reuse qubits during a quantum circuit enables a mapping of the spatial structure of certain tensor-network states onto the dynamics of quantum circuits, thereby achieving dramatic resource…
Topological entanglement entropy (TEE), the sub-leading term in the entanglement entropy of topological order, is the direct evidence of the long-range entanglement. While effective in characterizing topological orders on closed manifolds,…
We introduce an enriched entanglement structure for spin networks, inspired by tensor-network constructions, in which internal links can carry a controlled and discrete amount of entanglement. In the spin-network picture, vertices are dual…
The entanglement properties of random quantum states or dynamics are important to the study of a broad spectrum of disciplines of physics, ranging from quantum information to high energy and many-body physics. This work investigates the…
Analytically continuing the von Neumann entropy from R\'enyi entropies is a challenging task in quantum field theory. While the $n$-th R\'enyi entropy can be computed using the replica method in the path integral representation of quantum…
The success of deep convolutional neural network (CNN) in computer vision especially image classification problems requests a new information theory for function of image, instead of image itself. In this article, after establishing a deep…
In this paper we consider a natural extremal graph theoretic problem of topological sort, concerning the minimization of the (topological) connectedness of the independence complex of graphs in terms of its dimension. We observe that the…
We investigate the hypercube networks that their nodes are considered as quantum harmonic oscillators. The entanglement of the ground state can be used to quantify the amount of information each part of a network shares with the rest of the…
The entanglement properties of random pure states are relevant to a variety of problems ranging from chaotic quantum dynamics to black hole physics. The averaged bipartite entanglement entropy of such states admits a volume law and upon…
We derive several new reformulations of the Hubeny-Rangamani-Takayanagi covariant holographic entanglement entropy formula. These include: (1) a minimax formula, which involves finding a maximal-area achronal surface on a timelike…
We estimate the $3$-colour bipartite Ramsey number for balanced bipartite graphs $H$ with small bandwidth and bounded maximum degree. More precisely, we show that the minimum value of $N$ such that in any $3$-edge colouring of $K_{N,N}$…
Based on sketching techniques, we propose two randomized algorithms for tensor ring (TR) decomposition. Specifically, by defining new tensor products and investigating their properties, we apply the Kronecker sub-sampled randomized Fourier…
In this paper, we study the entanglement entropy in string theory in the simplest setup of dividing the nine dimensional space into two halves. This corresponds to the leading quantum correction to the horizon entropy in string theory on…
Most of the existing multi-relational network embedding methods, e.g., TransE, are formulated to preserve pair-wise connectivity structures in the networks. With the observations that significant triangular connectivity structures and…
We use a R\'enyi entropy method to prove strong converse theorems for certain information-theoretic tasks which involve local operations and quantum or classical communication between two parties. These include state redistribution,…
We consider the distributed compression of Soft Random Geometric Graphs (SRGGs) above the connectivity threshold. We establish the Slepian-Wolf rate region for the SRGG in the setting where there are a finite number of encoders compressing…
In this work, we construct small sets of bipartite orthogonal pure states that cannot be perfectly distinguished by local operations and classical communication (LOCC). We mention that not all the states within the constructed sets are…