I assess the potential of quantum computation. Broad and important applications must be
found to justify construction of a quantum computer; I review some of the known quantum …

The Church-Turing thesis says that a digital computer is a universal computational device;
that is, it is able to simulate any physically realizable computational device. It has generally …

Practical realization of quantum computers will require overcoming decoherence and
operational errors, which lead to problems that are more severe than in classical …

Recent research has demonstrated that quantum computers can solve certain types of
problems substantially faster than the known classical algorithms. These problems include …

Large-scale quantum computers are hard to construct because quantum systems easily lose
their coherence through interaction with the environment. Researchers have tried to avoid …

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 …

Quantum physics provides an intriguing basis for achieving computational power to address
certain categories of mathematical problems that are completely intractable with machine …

Quantum computers are designed to outperform standard computers by running quantum
algorithms. Areas in which quantum algorithms can be applied include cryptography, search …

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 …

The quantum circuit model is the most widely used model of quantum computation. It
provides both a framework for formulating quantum algorithms and an architecture for the …