Topological Entanglement Entropy of Fracton Stabilizer Codes

Physical Review B American Physical Society 97 (2018) 125101

Authors:

H Ma, AT Schmitz, Parameswaran, M Hermele, R Nandkishore

Abstract:

Entanglement entropy provides a powerful characterization of two-dimensional gapped topological phases of quantum matter, intimately tied to their description by topological quantum field theories (TQFTs). Fracton topological orders are three-dimensional gapped topologically ordered states of matter that lack a TQFT description. We show that three-dimensional fracton phases are nevertheless characterized, at least partially, by universal structure in the entanglement entropy of their ground-state wave functions. We explicitly compute the entanglement entropy for two archetypal fracton models, the “X-cube model” and “Haah's code,” and demonstrate the existence of a nonlocal contribution that scales linearly in subsystem size. We show via Schrieffer-Wolff transformations that this piece of the entanglement entropy of fracton models is robust against arbitrary local perturbations of the Hamiltonian. Finally, we argue that these results may be extended to characterize localization-protected fracton topological order in excited states of disordered fracton models.

Coarse-grained dynamics of operator and state entanglement

(2018)

Authors:

Cheryne Jonay, David A Huse, Adam Nahum

Floquet Quantum Criticality

(2018)

Authors:

William Berdanier, Michael Kolodrubetz, SA Parameswaran, Romain Vasseur

Integrable spin chains with random interactions

(2018)

Authors:

Fabian HL Essler, Rianne van den Berg, Vladimir Gritsev

Input-output maps are strongly biased towards simple outputs

Nature Communications Springer Nature 9 (2018) 761

Authors:

K Dingle, Chico Q Camargo, Ard A Louis

Abstract:

Many systems in nature can be described using discrete input–output maps. Without knowing details about a map, there may seem to be no a priori reason to expect that a randomly chosen input would be more likely to generate one output over another. Here, by extending fundamental results from algorithmic information theory, we show instead that for many real-world maps, the a priori probability P(x) that randomly sampled inputs generate a particular output x decays exponentially with the approximate Kolmogorov complexity K˜(x) of that output. These input–output maps are biased towards simplicity. We derive an upper bound P(x) ≲ 2−aK˜(x)−b, which is tight for most inputs. The constants a and b, as well as many properties of P(x), can be predicted with minimal knowledge of the map. We explore this strong bias towards simple outputs in systems ranging from the folding of RNA secondary structures to systems of coupled ordinary differential equations to a stochastic financial trading model.