Quantum Computing Since Democritus
by Scott Aaronson
Publisher: University of Waterloo 2006
Number of pages: 398
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.
Home page url
Download or read it online for free here:
by John Watrous - University of Calgary
Topics: Quantum information; Superdense coding, quantum circuits, and partial measurements; Quantum Teleportation; Searching algorithms; Simon's algorithm; Phase estimation; Order finding; Grover's Algorithm; Quantum error correction; etc.
by G. Adesso, T.R. Bromley, M. Cianciaruso - arXiv
An overview of the current quest for a proper understanding of frontier between classical and quantum correlations in composite states. We focus on various approaches to define general quantum correlations, based on different physical perspectives.
by David Mermin - Cambridge University Press
A concise introduction to quantum computation, developing the basic elements of this branch of computational theory without assuming any background in physics. It begins with an introduction to the quantum theory from a computer-science perspective.
by Man-Hong Yung, et al. - arXiv
The text focuses on applications of quantum computation to problems of interest in physics and chemistry. The authors describe quantum simulation algorithms that have been developed for electronic-structure problems, thermal-state preparation, etc.