by Michele Mosca
Publisher: arXiv 2008
Number of pages: 71
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, a description of the Abelian Hidden Subgroup algorithms, quantum searching and amplitude amplification, quantum algorithms for simulating quantum mechanical systems, several non-trivial generalizations of the Abelian Hidden Subgroup Problem, the quantum walk paradigm for quantum algorithms, the paradigm of adiabatic algorithms, etc.
Home page url
Download or read it online for free here:
by Kazuyuki Fujii - arXiv
The purpose of this paper is to introduce several basic theorems of coherent states and generalized coherent states based on Lie algebras su(2) and su(1,1), and to give some applications of them to quantum information theory for graduate students.
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 Steven M. Girvin - Yale University
These lectures are devoted to understanding the basic components of quantum machines that can be constructed from superconducting electrical circuits. These circuits can be used to create resonators which store individual microwave photons.
by Renato Renner - ETH Zurich
Processing of information is necessarily a physical process. It is not surprising that physics and the theory of information are inherently connected. Quantum information theory is a research area whose goal is to explore this connection.