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 Preskill - California Institute of Technology
We will study the properties that distinguish quantum information from classical information. And we will see how these properties can be exploited in the design of quantum algorithms that solve certain problems faster than classical algorithms can.
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 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 Riley T. Perry
A quantum computing tutorial for everyone, including those who have no background in physics. In quantum computers we exploit quantum effects to compute in ways that are faster or more efficient than, or even impossible, on conventional computers.