logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Simulating fermions on a quantum computer

delete2002-07-01
delete4
PRE
AI
G
Gerardo Ortíz *
J
J. E. Gubernatis
E
Emanuel Knill
R
Raymond Laflamme
DOI：10.1016/S0010-4655(02)00421-6delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
The real-time probabilistic simulation of quantum systems in classical computers is known it) be limited by the so-called dynamical sign problem, a problem leading to exponential complexity. In 1981 Richard Feynman raised some provocative questions in connection to the exact imitation of such systems using a special device named a quantum computer. Feynman hesitated about the possibility of imitating fermion systems using such a device. Here we address some of his concerns and, in particular, investigate the simulation of fermionic systems. We show how quantum computers avoid the sign problem in some cases by reducing the complexity from exponential to polynomial. Our demonstration is based upon the use of isomorphisms of algebras. We present specific quantum algorithms that illustrate the main points of our algebraic approach. (C) 2002 Published by Elsevier Science B.V.
Keywords:
SYSTEMS
UNIVERSAL
COMPUTATION
TRANSFORMATION
MECHANICS
PHYSICS
HELIUM
GATES
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Computer Physics Communications cover
Computer Physics Communications
IF:
3.4
Papers:
1.2W
Citations:
3.7W

Organization

No organization information available