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 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 Riley T. Perry
A quantum computing tutorial for everyone, including those who have no background in physics. In quantum computers we exploit quantum effects to compute in ways that are faster or more efficient than, or even impossible, on conventional computers.
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 Ved Prakash Gupta, Prabha Mandayam, V. S. Sunder - arXiv
This book is a compilation of notes from a two-week international workshop on the 'Functional Analysis of Quantum Information Theory'. Contents: Operator Spaces; Entanglement in Bipartite Quantum States; Operator Systems; Quantum Information Theory.