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 Eleanor G. Rieffel, Wolfgang Polak - arXiv
This paper will guide computer scientists and other non-physicists through the barriers that separate quantum computing from conventional computing. We introduce basics of quantum mechanics to explain where the power of quantum computers comes from.
by N. Gisin, G. Ribordy, W. Tittel, H. Zbinden - arXiv
Quantum cryptography could well be the first application of quantum mechanics at the individual quanta level. The fast progress in theory and experiments over the recent years are reviewed, with emphasis on open questions and technological issues.
by Bing Qi, Li Qian, Hoi-Kwong Lo - arXiv
We present the principles behind quantum key distribution and discuss a few well-known QKD protocols. We focus more on the implementation of QKD protocols rather than security analysis. Another topic covered here is the security of QKD systems.
by Michele Mosca - arXiv
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, etc.