Quantum Computing Since Democritus
by Scott Aaronson
Publisher: University of Waterloo 2006
ISBN/ASIN: 0521199565
Number of pages: 398
Description:
This course tries to connect quantum computing to the wider intellectual world. We'll start out with various scientific, mathematical, or philosophical problems that predate quantum computing: for example, the measurement problem, P versus NP, the existence of secure cryptography, the Humean problem of induction, or the possibility of closed timelike curves. We'll then examine in what ways, if any, quantum computing affects how we should think about the problem.
Download or read it online for free here:
Read online
(online html)
Similar books

by John Preskill - California Institute of Technology
We will study the properties that distinguish quantum information from classical information. And we will see how these properties can be exploited in the design of quantum algorithms that solve certain problems faster than classical algorithms can.
(9954 views)

by Salvador E. Venegas-Andraca - arXiv
Quantum walks is an advanced tool for building quantum algorithms that constitute a universal model of quantum computation. In this paper we review theoretical advances on the foundations of both discrete- and continuous-time quantum walks.
(10898 views)

by Earl T. Campbell, Joseph Fitzsimons - arXiv
This review provides a gentle introduction to one-way quantum computing in distributed architectures. One-way quantum computation shows significant promise as a model for distributed systems, particularly probabilistic entangling operations.
(10585 views)

by Philip Krantz, et al. - arXiv.org
The aim of this review is to provide quantum engineers with an introductory guide to the central concepts and challenges in the rapidly accelerating field of superconducting quantum circuits. Over the past twenty years, the field has matured ...
(7275 views)