Quantum algorithms for fermionic simulations
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 spinparticle connection (or generalized JordanWigner 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.
 Publication:

Physical Review A
 Pub Date:
 August 2001
 DOI:
 10.1103/PhysRevA.64.022319
 arXiv:
 arXiv:condmat/0012334
 Bibcode:
 2001PhRvA..64b2319O
 Keywords:

 03.67.Lx;
 05.30.d;
 Quantum computation;
 Quantum statistical mechanics;
 Condensed Matter;
 High Energy Physics  Theory;
 Quantum Physics
 EPrint:
 38 pages, 2 psfigure