Quantum Algorithms for Fermionic Simulations

Simple item page
dc.creatorOrtiz, G.
dc.creatorGubernatis, J. E.
dc.creatorKnill, E.
dc.creatorLaflamme, R.
dc.date2000-12-18
dc.date.accessioned2026-07-07T12:37:55Z
dc.date.available2026-07-07T12:37:55Z
dc.descriptionWe 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.
dc.description38 pages, 2 psfigure
dc.identifierhttps://arxiv.org/abs/cond-mat/0012334
dc.identifierhttp://arxiv.org/abs/cond-mat/0012334
dc.identifierPhys.Rev.A64:022319,2001
dc.identifierdoi:10.1103/PhysRevA.64.022319
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/218579
dc.subjectCondensed Matter
dc.subjectHigh Energy Physics - Theory
dc.subjectQuantum Physics
dc.titleQuantum Algorithms for Fermionic Simulations
dc.typetext

Files

Collections

arXiv