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 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 Michele Mosca - arXiv
This text surveys the state of the art in quantum computer algorithms, including both black-box and non-black-box results. A representative sample of quantum algorithms is given. This includes a summary of the early quantum algorithms, etc.
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.
by Richard L Amoroso - viXra.org
From the table of contents: From Concept to Conundrum; Cornucopia of Quantum Logic Gates; Surmounting Uncertainty Supervening Decoherence; Measurement With Certainty; New Classes of Quantum Algorithms; References; and more ...