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 John Watrous - University of Calgary
The focus is on the mathematical theory of quantum information. We will begin with basic principles and methods for reasoning about quantum information, and then move on to a discussion of various results concerning quantum information.
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 Richard L Amoroso - viXra.org
From the table of contents: From Concept to Conundrum; Cornucopia of Quantum Logic Gates; Surmounting Uncertainty Supervening Decoherence; Measurement With Certainty; New Classes of Quantum Algorithms; References; and more ...
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.