相关论文: Explicit entropy bounds for symmetric nearest-neig…

For any two-dimensional nearest neighbor shift of finite type X and any integer n > 0, one can define the horizontal strip shift H_n(X) to be the set of configurations on Z x {1,...,n} which do not contain any forbidden transitions for X.…

For any fixed alphabet A, the maximum topological entropy of a Z^d subshift with alphabet A is obviously log |A|. We study the class of nearest neighbor Z^d shifts of finite type which have topological entropy very close to this maximum,…

We consider entanglement through permeable interfaces in the c=1 (1+1)-dimensional conformal field theory. We compute the partition functions with the interfaces inserted. By the replica trick, the entanglement entropy is obtained…

We discuss two methods that, through a combination of cyclically gluing copies of a given $n$-party boundary state in AdS/CFT and a canonical purification, creates a bulk geometry that contains a boundary homologous minimal surface with…

The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, the appropriate tools to describe and classify topological…

We use the conformal invariance and the holographic correspondence to fully specify the dependence of entanglement entropy on the extrinsic geometry of the 2d surface $\Sigma$ that separates two subsystems of quantum strongly coupled…

We provide a derivation of holographic entanglement entropy for spherical entangling surfaces. Our construction relies on conformally mapping the boundary CFT to a hyperbolic geometry and observing that the vacuum state is mapped to a…

We introduce a systematic framework to calculate the bipartite entanglement entropy of a compact spatial subsystem in a one-dimensional quantum gas which can be mapped into a noninteracting fermion system. We show that when working with a…

In a quantum many-body system that possesses an additive conserved quantity, the entanglement entropy of a subsystem can be resolved into a sum of contributions from different sectors of the subsystem's reduced density matrix, each sector…

We introduce a spectral embedding algorithm for finding proximal relationships between nodes in signed graphs, where edges can take either positive or negative weights. Adopting a physical perspective, we construct a Hamiltonian which is…

We compute the entropy of a closed bounded region of space for pure 3d Riemannian gravity formulated as a topological BF theory for the gauge group SU(2) and show its holographic behavior. More precisely, we consider a fixed graph embedded…

Exploiting the split property of quantum field theories (QFTs), a notion of von Neumann entropy associated to pairs of spatial subregions has been recently proposed both in the holographic context -- where it has been argued to be related…

This is an extended version of our short report hep-th/0603001, where a holographic interpretation of entanglement entropy in conformal field theories is proposed from AdS/CFT correspondence. In addition to a concise review of relevant…

There are a variety of results in the literature proving forms of computability for topological entropy and pressure on subshifts. In this work, we prove two quite general results, showing that topological pressure is always computable from…

Random tilings are interesting as idealizations of atomistic models of quasicrystals and for their connection to problems in combinatorics and algorithms. Of particular interest is the tiling entropy density, which measures the relation of…

Entanglement entropy appears as a central property of quantum systems in broad areas of physics. However, its precise value is often sensitive to unknown microphysics, rendering it incalculable. By considering parametric dependence on…

Any coded subshift X defined by a set C of code words contains a subshift, which we call L, consisting of limits of single code words. We show that when C satisfies a unique decomposition property, the topological entropy h(X) of X is…

A theorem of A.A. Brudno says that the Kolmogorov-Sinai entropy of a subshift X over $\mathbb{N}$ with respect to an ergodic measure $\mu$ equals the asymptotic Kolmogorov complexity of almost every word $\omega$ in X. The purpose of this…

Entanglement entropy for a spatial partition of a quantum system is studied in theories which admit a dual description in terms of the anti-de Sitter (AdS) gravity one dimension higher. A general proof of the holographic formula which…

The entanglement entropy of two gapless non-interacting fermion subsystems is computed approximately in a way that avoids the introduction of replicas and a geometric interpretation of the reduced density matrix. We exploit the similarity…