Completeness of classical spin models and universal quantum computation

DOI10.1088/1742-5468/2009/07/P07001zbMATH Open1456.82113arXiv0812.2368OpenAlexW3098308396WikidataQ62381977 ScholiaQ62381977MaRDI QIDQ3301068FDOQ3301068

Authors: Gemma De las Cuevas, W. Dür, Maarten Van den Nest, H. J. Briegel 

Publication date: 11 August 2020

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/0812.2368

Recommendations

• Classical spin systems and the quantum stabilizer formalism: general mappings and applications
• The complexity of approximating complex-valued Ising and Tutte partition functions
• Mapping all classical spin models to a lattice gauge theory
• Quantum algorithms for classical lattice models
• A complexity classification of spin systems with an external field

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the computational complexity of the Jones and Tutte polynomials
• Statistical mechanics, three-dimensionality and NP-completeness
• Criticality, the Area Law, and the Computational Power of Projected Entangled Pair States
• Multiparty entanglement in graph states
• On the exact evaluation of certain instances of the Potts partition function by quantum computers
• Quantum approach to classical statistical mechanics
• A new connection between quantum circuits, graphs and the Ising partition function
• Classical spin systems and the quantum stabilizer formalism: general mappings and applications

Cited In (4)

• Classical spin systems and the quantum stabilizer formalism: general mappings and applications
• Systematic study of the completeness of two-dimensional classical \(\mathbf{\phi}^4\) theory
• Translationally invariant universal classical Hamiltonians
• Mapping all classical spin models to a lattice gauge theory

This page was built for publication: Completeness of classical spin models and universal quantum computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3301068)