Related papers: Explicit entropy bounds for symmetric nearest-neig…
Reflected entropy is a newly proposed notion in quantum information. It has important implications in holography. In this work, we study the reflected entropy in the framework of the AdS$_3$/WCFT correspondence. We determine the scaling…
We introduce the Clifford entropy, a measure of how close an arbitrary unitary is to a Clifford unitary, which generalizes the stabilizer entropy for states. We show that this quantity vanishes if and only if a unitary is Clifford, is…
We introduce hardness in relative entropy, a new notion of hardness for search problems which on the one hand is satisfied by all one-way functions and on the other hand implies both next-block pseudoentropy and inaccessible entropy, two…
Designing the sensing architecture for large-scale spatio-temporal systems is hard when accuracy requirements are specified but sensor models are uncertain or unavailable. Classical design treats sensor placement and estimation…
We show that the limit in our definition of tree shift topological entropy is actually the infimum, as is the case for both the topological and measure-theoretic entropies in the classical situation when the time parameter is $\mathbb Z$.…
Recently, a holographic computation of the entanglement entropy in conformal field theories has been proposed via the AdS/CFT correspondence. One of the most important properties of the entanglement entropy is known as the strong…
Recently the authors and J.M. Kress presented a special function recurrence relation method to prove quantum superintegrability of an integrable 2D system that included explicit constructions of higher order symmetries and the structure…
We investigate the concept of time-like entanglement entropy (tEE) within the framework of holography. We introduce a robust top-down prescription for computing tEE in higher-dimensional QFTs, both conformal and confining, eliminating the…
The purpose of this article is to develop a technique to estimate certain bounds for entropy numbers of diagonal operator on spaces of p-summable sequences for finite p greater than 1. The approximation method we develop in this direction…
We analyze the problem of quantifying entanglement in pure and mixed states of fermionic systems with fixed number parity yet not necessarily fixed particle number. The "mode entanglement" between one single-particle level and its…
We discuss the computation of holographic entanglement entropy for interface conformal field theories. The fact that globally well defined Fefferman-Graham coordinates are difficult to construct makes the regularization of the holographic…
We prove estimates for the optimal volume of thick embeddings of finite graphs into symmetric spaces, generalising results of Kolmogorov-Barzdin and Gromov-Guth for embeddings into Euclidean spaces. We distinguish two very different…
Let $Q_d$ be the hypercube of dimension $d$ and let $H$ and $K$ be subsets of the vertex set $V(Q_d)$, called configurations in $Q_d$. We say that $K$ is an \emph{exact copy} of $H$ if there is an automorphism of $Q_d$ which sends $H$ onto…
We study two notions of topological entropy of correspondences introduced by Friedland and Dinh-Sibony. Upper bounds are known for both. We identify a class of holomorphic correspondences whose entropy in the sense of Dinh-Sibony equals the…
An entanglement Renyi entropy for a spatial partition of a system is studied in conformal theories which admit a dual description in terms of an anti-de Sitter gravity. The divergent part of the Renyi entropy is computed in 4D conformal N=4…
We study nontrivial entropy invariants in the class of parabolic flows on homogeneous spaces, quasi-unipotent flows. We show that topological complexity (ie, slow entropy) can be computed directly from the Jordan block structure of the…
We study isometric embeddings of some solutions of the Einstein equations with suffciently high symmetries into a flat ambient space. We briefly describe a method for constructing surfaces with a given symmetry. We discuss all minimal…
When a spacetime has boundaries, the entangling surface does not have to be necessarily compact and it may have boundaries as well. Then there appear a new, boundary, contribution to the entanglement entropy due to the intersection of the…
Let H be a graph, and let C_H(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating C_H(G). Previous results cover only a few specific instances of this general…
We show that the values of entropies of multidimensional shifts of finite type (SFTs) are characterized by a certain computation-theoretic property: a real number $h\geq 0$ is the entropy of such an SFT if and only if it is right…