Classical spin systems and the quantum stabilizer formalism: general mappings and applications
arXiv:0812.2127 · doi:10.1063/1.3190486
Abstract
We present general mappings between classical spin systems and quantum physics. More precisely, we show how to express partition functions and correlation functions of arbitrary classical spin models as inner products between quantum stabilizer states and product states, thereby generalizing mappings for some specific models established in [Phys. Rev. Lett. 98, 117207 (2007)]. For Ising- and Potts-type models with and without external magnetic field, we show how the entanglement features of the corresponding stabilizer states are related to the interaction pattern of the classical model, while the choice of product states encodes the details of interaction. These mappings establish a link between the fields of classical statistical mechanics and quantum information theory, which we utilize to transfer techniques and methods developed in one field to gain insight into the other. For example, we use quantum information techniques to recover well known duality relations and local symmetries of classical models in a simple way, and provide new classical simulation methods to simulate certain types of classical spin models. We show that in this way all inhomogeneous models of q-dimensional spins with pairwise interaction pattern specified by a graph of bounded tree-width can be simulated efficiently. Finally, we show relations between classical spin models and measurement-based quantum computation.
24 pages, 5 figures, minor corrections, version as accepted in JMP
References in corpus (27)
- Fault-tolerant quantum computation by anyons
- Persistent entanglement in arrays of interacting particles
- Measurement-based quantum computation with cluster states
- Measurement-based quantum computation
- Multi-party entanglement in graph states
- Criticality, the area law, and the computational power of PEPS
- Classical simulation of quantum many-body systems with a tree tensor network
- Simulating quantum computation by contracting tensor networks
- Quantum error-correcting codes associated with graphs
- Cluster-state quantum computation
- Novel schemes for measurement-based quantum computation
- Universal resources for measurement-based quantum computation
- Measurement-based quantum computation beyond the one-way model
- Stabilizer states and Clifford operations for systems of arbitrary dimensions, and modular arithmetic
- Simulating Ising Spin Glasses on a Quantum Computer
- Classical simulation versus universality in measurement based quantum computation
- A Quantum Approach to Classical Statistical Mechanics
- Fundamentals of universality in one-way quantum computation
- On measurement-based quantum computation with the toric code states
- Completeness of the classical 2D Ising model and universal quantum computation
- Classical spin models and the quantum stabilizer formalism
- Statistical Mechanical Models and Topological Color Codes
- On the Exact Evaluation of Certain Instances of the Potts Partition Function by Quantum Computers
- Efficient evaluation of partition functions of frustrated and inhomogeneous spin systems
- On the Quantum Computational Complexity of the Ising Spin Glass Partition Function and of Knot Invariants
- Completeness of classical spin models and universal quantum computation
- A BQP-complete problem related to the Ising model partition function via a new connection between quantum circuits and graphs
Cited by in corpus (5)
- The U(1) Lattice Gauge Theory Universally Connects All Classical Models with Continuous Variables, Including Background Gravity
- An algorithmic proof for the completeness of two-dimensional Ising model
- Completeness of classical theory on 2D lattices
- A quantum information approach to statistical mechanics
- Testing equivalence of pure quantum states and graph states under SLOCC