Quantum Algorithms for Fermionic Simulations
Condensed Matter
2009-02-05 v1 High Energy Physics - Theory
Quantum Physics
Abstract
We investigate the simulation of fermionic systems on a quantum computer. We show in detail how quantum computers avoid the dynamical sign problem present in classical simulations of these systems, therefore reducing a problem believed to be of exponential complexity into one of polynomial complexity. The key to our demonstration is the spin-particle connection (or generalized Jordan-Wigner transformation) that allows exact algebraic invertible mappings of operators with different statistical properties. We give an explicit implementation of a simple problem using a quantum computer based on standard qubits.
Cite
@article{arxiv.cond-mat/0012334,
title = {Quantum Algorithms for Fermionic Simulations},
author = {G. Ortiz and J. E. Gubernatis and E. Knill and R. Laflamme},
journal= {arXiv preprint arXiv:cond-mat/0012334},
year = {2009}
}
Comments
38 pages, 2 psfigure