Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
QUANTUM COMPUTATION * Dorit Aharonov
 

Summary: QUANTUM COMPUTATION *
Dorit Aharonov
Departments of Physics and Computer Science,
The Hebrew University, Jerusalem, Israel
December 15, 1998
Abstract
In the last few years, theoretical study of quantum systems serving as computational
devices has achieved tremendous progress. We now have strong theoretical evidence
that quantum computers, if built, might be used as a dramatically powerful computa­
tional tool, capable of performing tasks which seem intractable for classical computers.
This review is about to tell the story of theoretical quantum computation. I left out the
developing topic of experimental realizations of the model, and neglected other closely
related topics which are quantum information and quantum communication. As a re­
sult of narrowing the scope of this paper, I hope it has gained the benefit of being an
almost self contained introduction to the exciting field of quantum computation.
The review begins with background on theoretical computer science, Turing ma­
chines and Boolean circuits. In light of these models, I define quantum computers,
and discuss the issue of universal quantum gates. Quantum algorithms, including
Shor's factorization algorithm and Grover's algorithm for searching databases, are ex­
plained. I will devote much attention to understanding what the origins of the quantum

  

Source: Aharonov, Dorit - School of Computer Science and Engineering, Hebrew University of Jerusalem

 

Collections: Physics; Computer Technologies and Information Sciences