1204.1084 (Mile Gu et al.)
Mile Gu, Alvaro Perales
We characterize the set of ground states that can be synthesized by classical 2-body Ising Hamiltonians. We then construct simple Ising planar blocks that simulates efficiently a universal set of logic gates and connections, and hence any boolean function. We therefore provide a new method of encoding universal computation in the ground states of Ising lattices, and a simpler alternative demonstration of the known fact that finding the ground state of a finite Ising spin glass model is NP complete. We relate this with our previous result about emergence properties in infinite lattices.
View original:
http://arxiv.org/abs/1204.1084
No comments:
Post a Comment