Basic Concepts in Quantum Computation
by Artur Ekert, Patrick Hayden, Hitoshi Inamori
Publisher: arXiv 2000
Number of pages: 37
Contents: Qubits, gates and networks; Quantum arithmetic and function evaluations; Algorithms and their complexity; From interferometers to computers; The first quantum algorithms; Quantum search; Optimal phase estimation; Periodicity and quantum factoring; Cryptography; Conditional quantum dynamics; Decoherence and recoherence; Concluding remarks.
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 Scott Aaronson - University of Waterloo
We'll start out with various scientific 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.
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 Steven M. Girvin - Yale University
These lectures are devoted to understanding the basic components of quantum machines that can be constructed from superconducting electrical circuits. These circuits can be used to create resonators which store individual microwave photons.