Information storage capacity of discrete spin systems

DOI10.1016/J.AOP.2013.07.009MaRDI QIDQ336176zbMATH OpenOpenAlexFDO

Publication date 10 November 2016

Published in Annals of Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1111.3275

cellular automata information theory fractal spin Glass Bekenstein bound error-correcting code

Dynamical aspects of cellular automata (37B15) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Abstract: Understanding the limits imposed on information storage capacity of physical systems is a problem of fundamental and practical importance which bridges physics and information science. There is a well-known upper bound on the amount of information that can be stored reliably in a given volume of discrete spin systems which are supported by gapped local Hamiltonians. However, all the previously known systems were far below this theoretical bound, and it remained open whether there exists a gapped spin system that saturates this bound. Here, we present a construction of spin systems which saturate this theoretical limit asymptotically by borrowing an idea from fractal properties arising in the Sierpinski triangle. Our construction provides not only the best classical error-correcting code which is physically realizable as the energy ground space of gapped frustration-free Hamiltonians, but also a new research avenue for correlated spin phases with fractal spin configurations.

Recommendations

Cites work

Cited in

(2)

This page was built for publication: Information storage capacity of discrete spin systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336176)