Information storage capacity of discrete spin systems
- Creators
- Yoshida, Beni
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.
Additional Information
© 2013 Elsevier Inc. Received 25 December 2012. Accepted 26 July 2013. Available online 9 August 2013. I thank Eddie Farhi and Peter Shor for support at MIT. I thank Sergey Bravyi, Patrick Hayden, Masahito Ueda and John Preskill for comments and discussion. This work is supported in part by DOE Grant No. DE-FG02-05ER41360 and by Nakajima Foundation.Additional details
- Eprint ID
- 42846
- Resolver ID
- CaltechAUTHORS:20131205-082904067
- DE-FG02-05ER41360
- Department of Energy (DOE)
- Nakajima Foundation
- Created
-
2013-12-05Created from EPrint's datestamp field
- Updated
-
2021-11-10Created from EPrint's last_modified field