Ising models and topological codes: classical algorithms and quantum simulation
arXiv:1304.2879 · doi:10.1103/PhysRevA.89.012334
Abstract
We present an algorithm to approximate partition functions of 3-body classical Ising models on two-dimensional lattices of arbitrary genus, in the real-temperature regime. Even though our algorithm is purely classical, it is designed by exploiting a connection to topological quantum systems, namely the color codes. The algorithm performance is exponentially better than other approaches which employ mappings between partition functions and quantum state overlaps. In addition, our approach gives rise to a protocol for quantum simulation of such Ising models by simply measuring local observables on color codes.
5 pages + supplementary material
References in corpus (13)
- Non-Abelian Anyons and Topological Quantum Computation
- Topological Quantum Distillation
- Criticality, the area law, and the computational power of PEPS
- Speed-up via Quantum Sampling
- A Quantum Approach to Classical Statistical Mechanics
- On measurement-based quantum computation with the toric code states
- Completeness of the classical 2D Ising model and universal quantum computation
- Statistical Mechanical Models and Topological Color Codes
- On the Exact Evaluation of Certain Instances of the Potts Partition Function by Quantum Computers
- Unifying all classical spin models in a Lattice Gauge Theory
- On the Quantum Computational Complexity of the Ising Spin Glass Partition Function and of Knot Invariants
- Geometric Entanglement in Topologically Ordered States
- The U(1) Lattice Gauge Theory Universally Connects All Classical Models with Continuous Variables, Including Background Gravity