Related papers: Reflected entropy in random tensor networks III: t…
The signature of noncommutativity on various measures of entanglement has been observed by considering the holographic dual of noncommutative super Yang-Mills theory. We have followed a systematic analytical approach in order to compute the…
The topological R\'enyi and entanglement entropies depend on the bipartition of the manifold and the choice of the ground states. However, these entanglement quantities remain invariant under a coordinate transformation when the bipartition…
In this work, we study the tensor ring decomposition and its associated numerical algorithms. We establish a sharp transition of algorithmic difficulty of the optimization problem as the bond dimension increases: On one hand, we show the…
We study the problem of low-rank tensor factorization in the presence of missing data. We ask the following question: how many sampled entries do we need, to efficiently and exactly reconstruct a tensor with a low-rank orthogonal…
We introduce R\'enyi entropy of a subsystem energy as a natural quantity which closely mimics the behavior of the entanglement entropy and can be defined for all the quantum many body systems. For this purpose, consider a quantum chain in…
In this paper, we show how the entropy (including the von Neumann entropy obtained by tracing across various sizes of subsystems, the entanglement gap, as well as different degrees of R\'{e}nyi entropy) of the random reduced density…
A new numerical approach to entanglement entropies of the Renyi type is proposed for one-dimensional quantum field theories. The method extends the truncated conformal spectrum approach and we will demonstrate that it is especially suited…
Data partitioning that maximizes/minimizes the Shannon entropy, or more generally the R\'enyi entropy is a crucial subroutine in data compression, columnar storage, and cardinality estimation algorithms. These partition algorithms can be…
The theory of the asymptotic manipulation of pure bipartite quantum systems can be considered completely understood: The rates at which bipartite entangled states can be asymptotically transformed into each other are fully determined by a…
The entanglement spectrum, i.e., the full distribution of Schmidt eigenvalues of the reduced density matrix, contains more information than the conventional entanglement entropy and has been studied recently in several many-particle…
We consider the canonical ensemble of $N$-vertex Erd\H{o}s-R\'enyi (ER) random topological graphs with quenched vertex degree, and with fugacity $\mu$ for each closed triple of bonds. We claim complete defragmentation of large-$N$ graphs…
We show that any pseudoentangled state ensemble with a gap of $t$ bits of entropy requires $\Omega(t)$ non-Clifford gates to prepare. This bound is tight up to polylogarithmic factors if linear-time quantum-secure pseudorandom functions…
A holographic entropy inequality (HEI) is a linear inequality obeyed by Ryu-Takayanagi holographic entanglement entropies, or equivalently by the minimum cut function on weighted graphs. We establish a new combinatorial framework for…
The identification of motifs--subgraphs that appear significantly more often in a particular network than in an ensemble of randomized networks--has become a ubiquitous method for uncovering potentially important subunits within networks…
Tensor train (TT) decomposition provides a space-efficient representation for higher-order tensors. Despite its advantage, we face two crucial limitations when we apply the TT decomposition to machine learning problems: the lack of…
Renyi entropy with multiple disjoint intervals are computed from the improved swapping operations by two methods: one is from the direct diagonalization of the Hamiltonian and the other one is from the state-of-the-art machine learning…
We analyze few-body quantum states with particular correlation properties imposed by the requirement of maximal bipartite entanglement for selected partitions of the system into two complementary parts. A novel framework to treat this…
A famous conjecture of Ryser is that in an $r$-partite hypergraph the covering number is at most $r-1$ times the matching number. If true, this is known to be sharp for $r$ for which there exists a projective plane of order $r-1$. We show…
The default way of proving holographic entropy inequalities is the contraction method. It divides Ryu-Takayanagi (RT) surfaces on the `greater than' side of the inequality into segments, then glues the segments into candidate RT surfaces…
Bound entanglement refers to entangled states that cannot be distilled into maximally entangled states and therefore cannot directly be used in many quantum information processing protocols. We identify a relationship between bound…