Details
| Original language | English |
|---|---|
| Article number | 052334 |
| Journal | Physical Review A - Atomic, Molecular, and Optical Physics |
| Volume | 80 |
| Issue number | 5 |
| Publication status | Published - 30 Nov 2009 |
| Externally published | Yes |
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 subject areas
- Physics and Astronomy(all)
- Atomic and Molecular Physics, and Optics
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
In: Physical Review A - Atomic, Molecular, and Optical Physics, Vol. 80, No. 5, 052334, 30.11.2009.
Research output: Contribution to journal › Article › Research › peer review
}
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 -