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 Bei Zeng, et al. - Springer
The draft version of a textbook, introducing the quantum information science viewpoints on condensed matter physics to graduate students. We keep the writing in a self-consistent way, requiring minimum background in quantum information science.
by Zachary Burell - arXiv
We present a concise but complete conceptual treatment of quantum computing implemented with Cavity Quantum Electrodynamics (CQED). The paper is intended as a brief overview for professionals who are coming over to the field from other areas.
by B. Aoun, M. Tarifi - arXiv
In this text the authors attempt to provide a useful introduction to quantum cellular automata from a computing perspective. For clarity and accessibility they provide a brief overview of both quantum computing and classical cellular automata.
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.