Quick search Find article
Quick search
Find article

Completeness of classical spin models and universal quantum computation

Gemma De las Cuevas1,2, Wolfgang Dür1,2, Maarten Van den Nest3 and Hans J Briegel1,2

Show affiliations


We study mappings between different classical spin systems that leave the partition function invariant. As recently shown in Van den Nest et al (2008 Phys. Rev. Lett. 100 110501), 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 for universal quantum computation via local measurements only, and complete classical spin systems.


Keywords

disordered systems (theory)

exact results

 

E-print Number: 0812.2368

Cited: by |

Refers: to

PACS

75.10.Hk Classical spin models

03.67.Lx Quantum computation architectures and implementations

05.50.+q Lattice theory and statistics (Ising, Potts, etc.)

02.10.De Algebraic structures and number theory

MSC

82B20 Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs

11C08 Polynomials (See also 13F20)

81P68 Quantum computation and quantum cryptography (See also 68Q05, 94A60)

Subjects

Mathematical physics

Computational physics

Condensed matter: electrical, magnetic and optical

Statistical physics and nonlinear systems

Quantum information and quantum mechanics

Dates

Issue 07 (July 2009)

Received 15 January 2009, accepted for publication 23 April 2009

Published 1 July 2009



  1. Completeness of classical spin models and universal quantum computation

    Gemma De las Cuevas et al J. Stat. Mech. (2009) P07001

  2. First-principles studies of liquid lithium under pressure

    Jianjun Yang et al 2010 J. Phys.: Condens. Matter 22 095503

  3. Epsilon-measures of entanglement

    Caterina-E Mora et al 2008 New J. Phys. 10 083027

  4. Characterization of micro-contact properties using a novel micromachined apparatus

    Ben-Hwa Jang et al 2008 J. Micromech. Microeng. 18 055020

  5. The pull-in behavior of electrostatically actuated bistable microstructures

    Slava Krylov et al 2008 J. Micromech. Microeng. 18 055026

  6. Optocoupler driving of MEMS electrostatic switches

    S Bermejo et al 2008 J. Micromech. Microeng. 18 055004

  7. A single-sided process for differentially cooled electrothermal micro-actuators

    H Veladi et al 2008 J. Micromech. Microeng. 18 055033

  8. Very Large Array H I Zeeman Observations of NGC 1275 (Perseus A)

    A. P. Sarma et al. 2005 The Astronomical Journal 130 2566

  9. Two-phase interdigitated microelectrode arrays for electrokinetic transport of microparticles

    Mathew Bligh et al 2008 J. Micromech. Microeng. 18 055007

  10. Tunable microfluidic optical devices with an integrated microlens array

    Kuang-Sheng Hong et al 2006 J. Micromech. Microeng. 16 1660

View by subject




Export








Please login to access our web services, or create an account if you don't yet have one.

You must have cookies enabled in your web browser to be able to login.

Username
Password

Forgotten your password? Get a new one here.