An algorithmic proof for the completeness of two-dimensional Ising model
arXiv:1207.6891 · doi:10.1103/PhysRevA.86.052303
Abstract
We show that the two dimensional Ising model is complete, in the sense that the partition function of any lattice model on any graph is equal to the partition function of the 2D Ising model with complex coupling. The latter model has all its spin-spin coupling equal to iπ/4 and all the parameters of the original model are contained in the local magnetic fields of the Ising model. This result has already been derived by using techniques from quantum information theory and by exploiting the universality of cluster states. Here we do not use the quantum formalism and hence make the completeness result accessible to a wide audience. Furthermore our method has the advantage of being algorithmic in nature so that by following a set of simple graphical transformations, one is able to transform any discrete lattice model to an Ising model defined on a (polynomially) larger 2D lattice.
arXiv comment18 pages, 15 figures, Accepted for publication in Physical Review A
References in corpus (34)
- Universal Quantum Computation with Continuous-Variable Cluster States
- Topological Quantum Distillation
- Criticality, the area law, and the computational power of PEPS
- Efficient Classical Simulation of Continuous Variable Quantum Information Processes
- Quantum Computing with Continuous-Variable Clusters
- One-Way Quantum Computing in the Optical Frequency Comb
- The computational complexity of PEPS
- Novel schemes for measurement-based quantum computation
- Measurement-based quantum computation beyond the one-way model
- Measurement-based quantum computer in the gapped ground state of a two-body Hamiltonian
- Simulating Ising Spin Glasses on a Quantum Computer
- Classical simulation versus universality in measurement based quantum computation
- A Quantum Approach to Classical Statistical Mechanics
- Gapped Two-body Hamiltonian whose Unique Ground State is Universal for One-way Quantum Computation
- Universal quantum computer from a quantum magnet
- On measurement-based quantum computation with the toric code states
- Completeness of the classical 2D Ising model and universal quantum computation
- The Optical Frequency Comb as a One-Way Quantum Computer
- Classical spin models and the quantum stabilizer formalism
- Quantum computational webs
- Quantum computation in correlation space and extremal entanglement
- Statistical Mechanical Models and Topological Color Codes
- Quantum algorithms for spin models and simulable gate sets for quantum computation
- 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
- Unifying all classical spin models in a Lattice Gauge Theory
- Experimental measurement-based quantum computing beyond the cluster-state model
- On the Quantum Computational Complexity of the Ising Spin Glass Partition Function and of Knot Invariants
- Universal resources for approximate and stochastic measurement-based quantum computation
- Completeness of classical spin models and universal quantum computation
- Mapping all classical spin models to a lattice gauge theory
- The U(1) Lattice Gauge Theory Universally Connects All Classical Models with Continuous Variables, Including Background Gravity
- Completeness of classical theory on 2D lattices
- Classical spin systems and the quantum stabilizer formalism: general mappings and applications
Cited by in corpus (11)
- Simple universal models capture all classical spin physics
- Universal Quantum Hamiltonians
- A quantum algorithm for additive approximation of Ising partition functions
- Dual correspondence between classical spin models and quantum CSS states
- Phase transition in a noisy Kitaev toric code model
- A quantum information approach to statistical mechanics
- Classical criticality establishes quantum topological order
- Translationally invariant universal classical Hamiltonians
- Noisy Toric code and random bond Ising model: The error threshold in a dual picture
- Systematic study of the completeness of two-dimensional classical theory
- Perpendicular-anisotropy artificial spin ice with spontaneous ordering: a platform for neuromorphic computing with flexible timescales