An Introduction to Quantum Computing for Non-Physicists
by Eleanor G. Rieffel, Wolfgang Polak
Publisher: arXiv 2000
Number of pages: 45
The aim of this paper is to guide computer scientists and other non-physicists through the conceptual and notational barriers that separate quantum computing from conventional computing. We introduce basic principles of quantum mechanics to explain where the power of quantum computers comes from and why it is difficult to harness. We describe quantum cryptography, teleportation, and dense coding.
Home page url
Download or read it online for free here:
by Scott Aaronson - University of Waterloo
We'll start out with various scientific 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.
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.
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.