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.
%0 Generic
%1 ortiz2000quantum
%A Ortiz, G.
%A Gubernatis, J. E.
%A Knill, E.
%A Laflamme, R.
%D 2000
%K quantumcomputing
%R 10.1103/PhysRevA.64.022319
%T Quantum Algorithms for Fermionic Simulations
%U http://arxiv.org/abs/cond-mat/0012334
%X 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.
@misc{ortiz2000quantum,
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.},
added-at = {2021-01-02T15:36:15.000+0100},
author = {Ortiz, G. and Gubernatis, J. E. and Knill, E. and Laflamme, R.},
biburl = {https://www.bibsonomy.org/bibtex/2b7a158c56754265c25d1a83069dbcd6f/cmcneile},
description = {Quantum Algorithms for Fermionic Simulations},
doi = {10.1103/PhysRevA.64.022319},
interhash = {c216559046e54d694d71677f5b43c6b9},
intrahash = {b7a158c56754265c25d1a83069dbcd6f},
keywords = {quantumcomputing},
note = {cite arxiv:cond-mat/0012334Comment: 38 pages, 2 psfigure},
timestamp = {2021-01-02T15:36:15.000+0100},
title = {Quantum Algorithms for Fermionic Simulations},
url = {http://arxiv.org/abs/cond-mat/0012334},
year = 2000
}