by John Watrous
Publisher: University of Calgary 2006
Number of pages: 139
Topics: Overview of quantum information; Superdense coding, quantum circuits, and partial measurements; Quantum Teleportation; A simple searching algorithm; Simon's algorithm; Arithmetic / number-theoretic problems; Phase estimation; Order finding; Grover's Algorithm; Quantum error correction; Quantum Key Distribution; Impossibility of Quantum Bit Commitment; Bell inequalities and nonlocality; Quantum communication complexity; Quantum computational complexity.
Download or read it online for free here:
by Salvador E. Venegas-Andraca - arXiv
Quantum walks is an advanced tool for building quantum algorithms that constitute a universal model of quantum computation. In this paper we review theoretical advances on the foundations of both discrete- and continuous-time quantum walks.
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 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 Artur Ekert, Patrick Hayden, Hitoshi Inamori - arXiv
Contents: Qubits, gates and networks; Quantum arithmetic and function evaluations; Algorithms and their complexity; From interferometers to computers; The first quantum algorithms; Quantum search; Optimal phase estimation; and more.