Quantum Computing: A Gentle Introduction, Eleanor Rieffel and Wolfgang Polak, MIT Press, Cambridge, MA, 2011. $45.00 (372 pp.). ISBN 978-0-262-01506-6 Buy at Amazon
column Share on Quantum computer science: an introduction author of book: N. David Mermin's publisher: cambridge press, 2007, 236 pages Author: Eleanor Rieffel FX Palo Alto Laboratory, Silicon Valley, CA, USA FX Palo Alto Laboratory, Silicon Valley, CA, USAView Profile Authors Info & Claims ACM SIGACT NewsVolume 41Issue 3September 2010pp 39–44https://doi.org/10.1145/1855118.1855127Published:03 September 2010Publication History 0citation336DownloadsMetricsTotal Citations0Total Downloads336Last 12 Months14Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
Quantum Computing is a new and exciting field at the intersection of mathematics, computer science and physics. It concerns a utilization of quantum mechanics to improve the efficiency of computation. Here we present a gentle introduction to some of the ideas in quantum computing. The paper begins by motivating the central ideas of quantum mechanics and quantum computation with simple toy models. From there we move on to a formal presentation of the small fraction of (finite dimensional) quantum mechanics that we will need for basic quantum computation. Central notions of quantum architecture (qubits and quantum gates) are described. The paper ends with a presentation of one of the simplest quantum algorithms: Deutsch's algorithm. Our presentation demands neither advanced mathematics nor advanced physics.
This paper is a gentle but rigorous introduction to quantum computing intended for discrete mathematicians. Starting from a small set of assumptions on the behavior of quantum computing devices, we analyze their main characteristics, stressing the differences with classical computers, and finally describe two well-known algorithms (Simon's algorithm and Grover's algorithm) using the formalism developed in previous sections. This paper does not touch on the physics of the devices, and therefore does not require any notion of quantum mechanics. Numerical examples based on an implementation of Grover's algorithm using open-source software are provided.
This concise, accessible text provides a thorough introduction to quantum computing - an exciting emergent field at the interface of the computer, engineering, mathematical and physical sciences. Aimed at advanced undergraduate and beginning graduate students in these disciplines, the text is technically detailed and is clearly illustrated throughout with diagrams and exercises. Some prior knowledge of linear algebra is assumed, including vector spaces and inner products. However, prior familiarity with topics such as tensor products and spectral decomposition is not required, as the necessary material is reviewed in the text.