The Temple of Quantum Computing
by Riley T. Perry
Number of pages: 250
In quantum computers we exploit quantum effects to compute in ways that are faster or more efficient than, or even impossible, on conventional computers. Quantum computers use a specific physical implementation to gain a computational advantage over conventional computers. Properties called superposition and entanglement may, in some cases, allow an exponential amount of parallelism. Also, special purpose machines like quantum cryptographic devices use entanglement and other peculiarities like quantum uncertainty.
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 Renato Renner - ETH Zurich
Processing of information is necessarily a physical process. It is not surprising that physics and the theory of information are inherently connected. Quantum information theory is a research area whose goal is to explore this connection.
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.