by John Watrous
Publisher: University of Calgary 2006
Number of pages: 139
Topics: Overview of quantum information; Superdense coding, quantum circuits, and partial measurements; Quantum Teleportation; A simple searching algorithm; Simon's algorithm; Arithmetic / number-theoretic problems; Phase estimation; Order finding; Grover's Algorithm; Quantum error correction; Quantum Key Distribution; Impossibility of Quantum Bit Commitment; Bell inequalities and nonlocality; Quantum communication complexity; Quantum computational complexity.
Download or read it online for free here:
An encyclopedia of everything quantum. Sections: Mathematical Structure; Quantum States; Evolution and Operations; Entanglement; Quantum Information Theory; Quantum Discord; Quantum Communication; Quantum Cryptography; Quantum Computation; 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 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.
by Salvador E. Venegas-Andraca - arXiv
Quantum walks is an advanced tool for building quantum algorithms that constitute a universal model of quantum computation. In this paper we review theoretical advances on the foundations of both discrete- and continuous-time quantum walks.