Physics – Condensed Matter – Statistical Mechanics
Scientific paper
2010-06-22
Physical Review E, 82(3), 031106 (2010)
Physics
Condensed Matter
Statistical Mechanics
24 pages, 1 figure
Scientific paper
10.1103/PhysRevE.82.031106
We examine a model of classical deterministic computing in which the ground state of the classical system is a spatial history of the computation. This model is relevant to quantum dot cellular automata as well as to recent universal adiabatic quantum computing constructions. In its most primitive form, systems constructed in this model cannot compute in an error free manner when working at non-zero temperature. However, by exploiting a mapping between the partition function for this model and probabilistic classical circuits we are able to show that it is possible to make this model effectively error free. We achieve this by using techniques in fault-tolerant classical computing and the result is that the system can compute effectively error free if the temperature is below a critical temperature. We further link this model to computational complexity and show that a certain problem concerning finite temperature classical spin systems is complete for the complexity class Merlin-Arthur. This provides an interesting connection between the physical behavior of certain many-body spin systems and computational complexity.
Bacon Dave
Brown Kenneth R.
Crosson Isaac J.
No associations
LandOfFree
Making Classical Ground State Spin Computing Fault-Tolerant does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Making Classical Ground State Spin Computing Fault-Tolerant, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Making Classical Ground State Spin Computing Fault-Tolerant will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-276715