Quantum Algorithms for Fermionic Simulations

Details Quantum Algorithms for Fermionic Simulations Quantum Algorithms for Fermionic Simulations

2000-12-18

arxiv.org/abs/cond-mat/0012334v1

Phys.Rev.A64:022319,2001

Physics

Condensed Matter

38 pages, 2 psfigure

Scientific paper

10.1103/PhysRevA.64.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 properties. We give an explicit implementation of a simple problem using a quantum computer based on standard qubits.

Affiliated with

Also associated with

No associations

Rating

Quantum Algorithms for Fermionic Simulations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum Algorithms for Fermionic Simulations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Algorithms for Fermionic Simulations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-180651