We consider the question of how much information can be stored by labeling the vertices of a connected undirected graph G using a constant-size set of labels, when isomorphic labelings are not distinguishable. Specifically, we are interested in the effective capacity of members of some class of graphs, the number of states distinguishable by a Turing machine that uses the labeled graph itself i...

What is the limit of information storage capacity of discrete spin systems? To answer this question, we study classical error-correcting codes which can be physically realized as the energy ground space of gapped local Hamiltonians. For discrete spin systems on a D-dimensional lattice governed by local frustration-free Hamiltonians, the following bound is known to hold; kd 1/D ≤ O(n) where k is...

We investigate the maximum number of embedded patterns in the two-dimensional Hopfield model. The grand state energies of two specific network states, namely, the energies of the pure-ferromagnetic state and the state of specific one stored pattern are calculated exactly in terms of the correlation function of the ferromagnetic Ising model. We also investigate the energy landscape around them a...