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 Eleanor G. Rieffel, Wolfgang Polak - arXiv
This paper will guide computer scientists and other non-physicists through the barriers that separate quantum computing from conventional computing. We introduce basics of quantum mechanics to explain where the power of quantum computers comes from.
by S. M. Girvin - arXiv
These notes will present a brief introduction to the basic theoretical concepts behind the 'second quantum revolution'. They also provide an introduction to 'circuit QED', which offers an architecture for constructing quantum information processors.
by G. Adesso, T.R. Bromley, M. Cianciaruso - arXiv
An overview of the current quest for a proper understanding of frontier between classical and quantum correlations in composite states. We focus on various approaches to define general quantum correlations, based on different physical perspectives.
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.