Loading [MathJax]/extensions/tex2jax.js

Quantum algorithms for spin models and simulable gate sets for quantum computation

Publikation: Beitrag in FachzeitschriftArtikelForschungPeer-Review

Autorschaft

Externe Organisationen

  • Max-Planck-Institut für Quantenoptik (MPQ)
  • Austrian Academy of Sciences
  • Universität Innsbruck
  • University of British Columbia

Details

OriginalspracheEnglisch
Aufsatznummer052334
FachzeitschriftPhysical Review A - Atomic, Molecular, and Optical Physics
Jahrgang80
Ausgabenummer5
PublikationsstatusVeröffentlicht - 30 Nov. 2009
Extern publiziertJa

Abstract

We present simple mappings between classical lattice models and quantum circuits, which provide a systematic formalism to obtain quantum algorithms to approximate partition functions of lattice models in certain complex-parameter regimes. We, e.g., present an efficient quantum algorithm for the six-vertex model as well as a two-dimensional Ising-type model. We show that classically simulating these (complex-parameter) spin models is as hard as simulating universal quantum computation, i.e., BQP complete (BQP denotes bounded-error quantum polynomial time). Furthermore, our mappings provide a framework to obtain efficiently simulable quantum gate sets from exactly solvable classical models. We, e.g., show that the simulability of Valiant's match gates can be recovered by using the solvability of the free-fermion eight-vertex model.

ASJC Scopus Sachgebiete

Zitieren

Quantum algorithms for spin models and simulable gate sets for quantum computation. / Van Den Nest, M.; Dür, W.; Raussendorf, R. et al.
in: Physical Review A - Atomic, Molecular, and Optical Physics, Jahrgang 80, Nr. 5, 052334, 30.11.2009.

Publikation: Beitrag in FachzeitschriftArtikelForschungPeer-Review

Van Den Nest M, Dür W, Raussendorf R, Briegel HJ. Quantum algorithms for spin models and simulable gate sets for quantum computation. Physical Review A - Atomic, Molecular, and Optical Physics. 2009 Nov 30;80(5):052334. doi: 10.48550/arXiv.0805.1214, 10.1103/PhysRevA.80.052334
Download
@article{ab1cb5cb2985435d9531efd9de422375,
title = "Quantum algorithms for spin models and simulable gate sets for quantum computation",
abstract = "We present simple mappings between classical lattice models and quantum circuits, which provide a systematic formalism to obtain quantum algorithms to approximate partition functions of lattice models in certain complex-parameter regimes. We, e.g., present an efficient quantum algorithm for the six-vertex model as well as a two-dimensional Ising-type model. We show that classically simulating these (complex-parameter) spin models is as hard as simulating universal quantum computation, i.e., BQP complete (BQP denotes bounded-error quantum polynomial time). Furthermore, our mappings provide a framework to obtain efficiently simulable quantum gate sets from exactly solvable classical models. We, e.g., show that the simulability of Valiant's match gates can be recovered by using the solvability of the free-fermion eight-vertex model.",
author = "{Van Den Nest}, M. and W. D{\"u}r and R. Raussendorf and Briegel, {H. J.}",
year = "2009",
month = nov,
day = "30",
doi = "10.48550/arXiv.0805.1214",
language = "English",
volume = "80",
journal = "Physical Review A - Atomic, Molecular, and Optical Physics",
issn = "1050-2947",
publisher = "American Physical Society",
number = "5",

}

Download

TY - JOUR

T1 - Quantum algorithms for spin models and simulable gate sets for quantum computation

AU - Van Den Nest, M.

AU - Dür, W.

AU - Raussendorf, R.

AU - Briegel, H. J.

PY - 2009/11/30

Y1 - 2009/11/30

N2 - We present simple mappings between classical lattice models and quantum circuits, which provide a systematic formalism to obtain quantum algorithms to approximate partition functions of lattice models in certain complex-parameter regimes. We, e.g., present an efficient quantum algorithm for the six-vertex model as well as a two-dimensional Ising-type model. We show that classically simulating these (complex-parameter) spin models is as hard as simulating universal quantum computation, i.e., BQP complete (BQP denotes bounded-error quantum polynomial time). Furthermore, our mappings provide a framework to obtain efficiently simulable quantum gate sets from exactly solvable classical models. We, e.g., show that the simulability of Valiant's match gates can be recovered by using the solvability of the free-fermion eight-vertex model.

AB - We present simple mappings between classical lattice models and quantum circuits, which provide a systematic formalism to obtain quantum algorithms to approximate partition functions of lattice models in certain complex-parameter regimes. We, e.g., present an efficient quantum algorithm for the six-vertex model as well as a two-dimensional Ising-type model. We show that classically simulating these (complex-parameter) spin models is as hard as simulating universal quantum computation, i.e., BQP complete (BQP denotes bounded-error quantum polynomial time). Furthermore, our mappings provide a framework to obtain efficiently simulable quantum gate sets from exactly solvable classical models. We, e.g., show that the simulability of Valiant's match gates can be recovered by using the solvability of the free-fermion eight-vertex model.

UR - http://www.scopus.com/inward/record.url?scp=70849097490&partnerID=8YFLogxK

U2 - 10.48550/arXiv.0805.1214

DO - 10.48550/arXiv.0805.1214

M3 - Article

AN - SCOPUS:70849097490

VL - 80

JO - Physical Review A - Atomic, Molecular, and Optical Physics

JF - Physical Review A - Atomic, Molecular, and Optical Physics

SN - 1050-2947

IS - 5

M1 - 052334

ER -

Von denselben Autoren