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 Man-Hong Yung, et al. - arXiv
The text focuses on applications of quantum computation to problems of interest in physics and chemistry. The authors describe quantum simulation algorithms that have been developed for electronic-structure problems, thermal-state preparation, etc.
by Philip Krantz, et al. - arXiv.org
The aim of this review is to provide quantum engineers with an introductory guide to the central concepts and challenges in the rapidly accelerating field of superconducting quantum circuits. Over the past twenty years, the field has matured ...
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.
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.