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 Ved Prakash Gupta, Prabha Mandayam, V. S. Sunder - arXiv
This book is a compilation of notes from a two-week international workshop on the 'Functional Analysis of Quantum Information Theory'. Contents: Operator Spaces; Entanglement in Bipartite Quantum States; Operator Systems; Quantum Information Theory.
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 S. M. Girvin - arXiv
These notes will present a brief introduction to the basic theoretical concepts behind the 'second quantum revolution'. They also provide an introduction to 'circuit QED', which offers an architecture for constructing quantum information processors.
by S. Gharibian, Y. Huang, Z. Landau, S. W. Shin - arXiv
We survey the growing field of Quantum Hamiltonian Complexity. Our aim is to provide a computer science-oriented introduction to the subject in order to help bridge the language barrier between computer scientists and physicists in the field.