Quantum Information and Computation
by John Preskill
Publisher: California Institute of Technology 1998
Number of pages: 481
Description:
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.
Download or read it online for free here:
Download link
(2.7MB, PDF)
Similar books
Quantum Information: primitive notions and quantum correlations
by Valerio Scarani - arXiv
I rapidly review the basic notions of quantum physics and many primitives of quantum information. The second part is devoted to a detailed introduction to the topic of quantum correlations, covering the evidence for failure of alternative theories...
(6560 views)
by Valerio Scarani - arXiv
I rapidly review the basic notions of quantum physics and many primitives of quantum information. The second part is devoted to a detailed introduction to the topic of quantum correlations, covering the evidence for failure of alternative theories...
(6560 views)
A Rosetta Stone for Quantum Mechanics with an Introduction to Quantum Computation
by Samuel J. Lomonaco, jr - arXiv
These notes provide readers, who have some mathematical background but little exposure to quantum mechanics and quantum computation, with enough material to begin reading the research literature in quantum computation and quantum information theory.
(9808 views)
by Samuel J. Lomonaco, jr - arXiv
These notes provide readers, who have some mathematical background but little exposure to quantum mechanics and quantum computation, with enough material to begin reading the research literature in quantum computation and quantum information theory.
(9808 views)
Quantum Computing Since Democritus
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.
(8337 views)
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.
(8337 views)
Quantum Computation
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.
(9545 views)
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.
(9545 views)