Completeness of classical spin models and universal quantum computation

Abstract

We study mappings between distinct classical spin systems that leave the partition function invariant. As recently shown in [Phys. Rev. Lett. 100, 110501 (2008)], the partition function of the 2D square lattice Ising model in the presence of an inhomogeneous magnetic field, can specialize to the partition function of any Ising system on an arbitrary graph. In this sense the 2D Ising model is said to be "complete". However, in order to obtain the above result, the coupling strengths on the 2D lattice must assume complex values, and thus do not allow for a physical interpretation. Here we show how a complete model with real -and, hence, "physical"- couplings can be obtained if the 3D Ising model is considered. We furthermore show how to map general q-state systems with possibly many-body interactions to the 2D Ising model with complex parameters, and give completeness results for these models with real parameters. We also demonstrate that the computational overhead in these constructions is in all relevant cases polynomial. These results are proved by invoking a recently found cross-connection between statistical mechanics and quantum information theory, where partition functions are expressed as quantum mechanical amplitudes. Within this framework, there exists a natural correspondence between many-body quantum states that allow universal quantum computation via local measurements only, and complete classical spin systems.

43 pages, 28 figures

References in corpus (14)

• Multi-party entanglement in graph states
• Criticality, the area law, and the computational power of PEPS
• Valence Bond Solids for Quantum Computation
• Universal resources for 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
• Phase transition of computational power in the resource states for one-way quantum computation
• Statistical Mechanical Models and Topological Color Codes
• On the Exact Evaluation of Certain Instances of the Potts Partition Function by Quantum Computers
• On the Quantum Computational Complexity of the Ising Spin Glass Partition Function and of Knot Invariants
• A BQP-complete problem related to the Ising model partition function via a new connection between quantum circuits and graphs

Cited by in corpus (15)

• Simple universal models capture all classical spin physics
• Universal Quantum Hamiltonians
• Multidimensional hyperspin machine
• Local convertibility and the quantum simulation of edge states in many-body systems
• Computational Overhead of Locality Reduction in Binary Optimization Problems
• 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
• An algorithmic proof for the completeness of two-dimensional Ising model
• Completeness of classical ${\varphi }^4$ theory on 2D lattices
• Translationally invariant universal classical Hamiltonians
• A quantum information approach to statistical mechanics
• Classical spin systems and the quantum stabilizer formalism: general mappings and applications
• Quantum simulation of classical thermal states
• Ising models and topological codes: classical algorithms and quantum simulation
• Quantum Entanglement Phase Transitions and Computational Complexity: Insights from Ising Models