@article{Ortiz2001QuantumAF,
title={Quantum algorithms for fermionic simulations},
author={G. Ortiz and J. Gubernatis and E. Knill and R. Laflamme},
journal={Physical Review A},
year={2001},
volume={64},
pages={022319}
}

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… CONTINUE READING

10] From the point of view of complexity theory, an algorithm is efficient if it scales polynomially in time

10] From the point of view of complexity theory, an algorithm is efficient if it scales polynomially in time

From the point of view of complexity theory , an algorithm is efficient if it scales polynomially in time

Rev . Mod . Phys .

In two spatial dimensions, other possibilities for quantum statistics emerge. For example, fractional statistics for particles called anyons interpolates continuously between bosons and fermions

In two spatial dimensions, other possibilities for quantum statistics emerge. For example, fractional statistics for particles called anyons interpolates continuously between bosons and fermions