Spin Systems and Computational Complexity
Daniel Gottesman
TL;DR
This paper introduces the connection between spin systems, especially spin glasses, and computational complexity, highlighting how these physical models relate to NP-complete problems in computer science.
Contribution
It provides a concise non-technical overview of how spin glasses are linked to computational complexity and NP-complete problems.
Findings
Spin glasses are related to NP-complete problems.
The intersection of spin systems and computational complexity offers insights into problem hardness.
The paper serves as an introductory overview of these interdisciplinary connections.
Abstract
I give a very brief non-technical introduction to the intersection of the fields of spin systems and computational complexity. The focus is on spin glasses and their relationship to NP-complete problems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Computability, Logic, AI Algorithms · Topological and Geometric Data Analysis