An algorithmic proof for the completeness of two-dimensional Ising model

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.

18 pages, 15 figures, Accepted for publication in Physical Review A

References in corpus (20)

• Universal Quantum Computation with Continuous-Variable Cluster States
• Topological Quantum Distillation
• Criticality, the area law, and the computational power of PEPS
• One-Way Quantum Computing in the Optical Frequency Comb
• 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
• Classical simulation versus universality in measurement based quantum computation
• A Quantum Approach to Classical Statistical Mechanics
• On measurement-based quantum computation with the toric code states
• The Optical Frequency Comb as a One-Way Quantum Computer
• Completeness of the classical 2D Ising model and universal quantum computation
• Quantum computation in correlation space and extremal entanglement
• 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
• The U(1) Lattice Gauge Theory Universally Connects All Classical Models with Continuous Variables, Including Background Gravity
• Completeness of classical ${\varphi }^4$ 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 ${\varphi }^4$ theory
• Perpendicular-anisotropy artificial spin ice with spontaneous ordering: a platform for neuromorphic computing with flexible timescales