Quantum Information and Computation
by John Preskill
Publisher: California Institute of Technology 1998
Number of pages: 481
In this course, 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.
Home page url
Download or read it online for free here:
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 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.
by Michele Mosca - arXiv
This text surveys the state of the art in quantum computer algorithms, including both black-box and non-black-box results. A representative sample of quantum algorithms is given. This includes a summary of the early quantum algorithms, etc.
by John Watrous - University of Calgary
The focus is on the mathematical theory of quantum information. We will begin with basic principles and methods for reasoning about quantum information, and then move on to a discussion of various results concerning quantum information.