1.1 Background The idea of a quantum computer was first proposed in 1981 by Nobel
laureate Richard Feynman, who pointed out that accurately and efficiently simulating …

A quantum computer is a device that can arbitrarily manipulate the quantum state of a part of
itself. The field of quantum computation is largely a body of theoretical promises for some …

Imagine a computer whose memory is exponentially larger than its apparent physical size; a
computer that can manipulate an exponential set of inputs simultaneously; a computer that …

These notes discuss the quantum algorithms we know of that can solve problems
significantly faster than the corresponding classical algorithms. So far, we have only …

Computers today become faster by becoming smaller. By reducing the size of transistors,
engineers are able to fit more of them on a given size microprocessor, thus increasing the …

As early as 1982 Richard P. Feynman suggested that it might be impossible to simulate
quantum mechanical phenomena with a computer without an exponential slowdown in the …

We discuss the progress (or lack of it) that has been made in discovering algorithms for
computation on a quantum computer. Some possible reasons are given for the paucity of …

In the 1990's it was realized that quantum physics has some spectacular applications in
computer science. This book is a concise introduction to quantum computation, develo** …

In this text we present a technical overview of the emerging field of quantum computation
along with new research results by the authors. What distinguishes our presentation from …

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 …