Quantum Computing Since Democritus
by Scott Aaronson
Publisher: University of Waterloo 2006
Number of pages: 398
This course tries to connect quantum computing to the wider intellectual world. We'll start out with various scientific, mathematical, or philosophical 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. We'll then examine in what ways, if any, quantum computing affects how we should think about the problem.
Home page url
Download or read it online for free here:
by Zachary Burell - arXiv
We present a concise but complete conceptual treatment of quantum computing implemented with Cavity Quantum Electrodynamics (CQED). The paper is intended as a brief overview for professionals who are coming over to the field from other areas.
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 Samuel J. Lomonaco, jr - arXiv
These notes provide readers, who have some mathematical background but little exposure to quantum mechanics and quantum computation, with enough material to begin reading the research literature in quantum computation and quantum information theory.
by Kazuyuki Fujii - arXiv
The purpose of this paper is to introduce several basic theorems of coherent states and generalized coherent states based on Lie algebras su(2) and su(1,1), and to give some applications of them to quantum information theory for graduate students.