Logo

An Introduction to Quantum Computing for Non-Physicists

Small book cover: An Introduction to Quantum Computing for Non-Physicists

An Introduction to Quantum Computing for Non-Physicists
by

Publisher: arXiv
Number of pages: 45

Description:
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:
Download link
(350KB, PDF)

Similar books

Book cover: Brief Primer on the Fundaments of Quantum ComputingBrief Primer on the Fundaments of Quantum Computing
by - 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 ...
(6503 views)
Book cover: A brief introduction of quantum cryptography for engineersA brief introduction of quantum cryptography for engineers
by - 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.
(13949 views)
Book cover: Handbook of Quantum InformationHandbook of Quantum Information
- Quantiki
An encyclopedia of everything quantum. Sections: Mathematical Structure; Quantum States; Evolution and Operations; Entanglement; Quantum Information Theory; Quantum Discord; Quantum Communication; Quantum Cryptography; Quantum Computation; etc.
(9955 views)
Book cover: Quantum Computing Since DemocritusQuantum Computing Since Democritus
by - 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.
(8535 views)