title: Encoding universal computation in the ground states of Ising lattices.
abstract: We characterize the set of ground states that can be synthesized by classical two-body Ising Hamiltonians. We then construct simple Ising planar blocks that simulate 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 emergent properties in infinite lattices.
authors.affiliation: Center for Quantum Technologies, National University of Singapore, Singapore.
authors.forename: Mile
authors.initials: M
authors.lastname: Gu
authors.forename: Álvaro
authors.initials: Á
authors.lastname: Perales
mesh_terms: D003198:Computer Simulation; D039301:Computers, Molecular; D060526:Magnetic Fields; D008956:Models, Chemical; D015233:Models, Statistical; D012815:Signal Processing, Computer-Assisted