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 Earl T. Campbell, Joseph Fitzsimons - arXiv
This review provides a gentle introduction to one-way quantum computing in distributed architectures. One-way quantum computation shows significant promise as a model for distributed systems, particularly probabilistic entangling operations.
by Emily Grumbling, Mark Horowitz - National Academies Press
Quantum mechanics provides the basis for a new paradigm of computing. First proposed in the 1980s as a way to improve computational modeling of quantum systems, the field of quantum computing has recently garnered significant attention ...
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.
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...