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:
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 Clare Hewitt-Horsman - arXiv
This paper introduces one interpretation of quantum mechanics, a modern 'many-worlds' theory, from the perspective of quantum computation. Reasons for seeking to interpret quantum mechanics are discussed, then the specific theory is introduced.
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 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.