Normal view MARC view ISBD view

Quantum computer science : an introduction / N. David Mermin.

By: Mermin, N. David.
Material type: TextTextPublisher: Cambridge, UK ; New York : Cambridge University Press, 2007Description: xiv, 220 p. : ill. ; 25 cm.ISBN: 9780521876582 (hbk.); 0521876583 (hbk.).Subject(s): Quantum computers | Quantum theoryDDC classification: 004.1 Other classification: 54.10
Contents:
A note on references -- Cbits and Qbits: What is a quantum computer? ; Cbits and their states ; Reversible operations on Cbits ; Manipulating operations on Cbits ; Qbits and their states ; Reversible operations on Qbits ; Circuit diagrams ; Measurement gates and the Born rule ; The generalized Born rule ; Measurement gates and state preparation ; Constructing arbitrary 1- and 2-Qbit states ; Summary : Obits versus Cbits -- General features and some simple examples: The general computational process ; Deutsch's problems ; Why additional Qbits needn't mess things up ; The Bernstein-Vazirani problem ; Simon's problem ; Constructing Toffoli gates -- Breaking RSA encryption: Period finding, factoring, and cryptography ; Number-theoretic preliminaries ; RSA encryption ; Quantum period finding : preliminary remarks ; The quantum Fourier transform ; Eliminating the 2-Qbit gates ; Finding the period ; Calculating the periodic function ; The unimportance of small phase errors ; Period finding and factoring -- Searching with a quantum computer: The nature of the search ; The Grover iteration ; How to construct W ; Generalization to several special numbers ; Searching for one out of four items -- Quantum error correction: The miracle of quantum error correction ; A simplified example ; The physics of error generation ; Diagnosing error syndromes ; The 5-Qbit error-correcting code ; The 7-Qbit error-correcting code ; Operations on 7-Qbit codewords ; A 7-Qbit encoding circuit ; A 5-Qbit encoding circuit -- Protocols that use just a few Qbits: Bell states ; Quantum cryptography ; Bit commitment ; Quantum dense coding ; Teleportation ; The GHZ puzzle -- Appendices: A, Vector spaces : basic properties and Dirac notation ; B, Structure of the general 1-Qbit unitary transformation ; C, Structure of the general 1-Qbit state ; D, Spooky action at a distance ; E, Consistency of the generalized Born rule ; F, Other aspects of Deutsch's problem ; G, The probability of success in Simon's problem ; H, One way to make a cNOT gate ; I, A little elementary group theory ; J, Some simple number theory ; K, Period finding and continued fractions ; L, Better estimates of success in period finding ; M, Factoring and period finding ; N, Shor's 9-Qbit error-correcting code ; O, A circuit-diagrammatic treatment of the 7-Qbit code ; P, On bit commitment.
Summary: This book is a concise introduction to quantum computation, developing the basic elements of this new branch of computational theory without assuming any background in physics. It begins with an introduction to the quantum theory from a computer-science perspective. It illustrates the quantum-computational approach with several elementary examples of quantum speed-up, before moving to the major applications...The book is intended primarily for computer scientists who know nothing about quantum theory, but will also be of interest to physicists who want to learn the theory of quantum computation, and philosophers of science interested in quantum foundational issues. -- From publisher's description.
Tags from this library: No tags from this library for this title. Log in to add tags.
Item type Current location Call number Status Date due Barcode
Book University of Texas At Tyler
Stacks - 3rd Floor
QA76.889 .M47 2007 (Browse shelf) Available 0000002030880

Includes bibliographical references and index.

A note on references -- Cbits and Qbits: What is a quantum computer? ; Cbits and their states ; Reversible operations on Cbits ; Manipulating operations on Cbits ; Qbits and their states ; Reversible operations on Qbits ; Circuit diagrams ; Measurement gates and the Born rule ; The generalized Born rule ; Measurement gates and state preparation ; Constructing arbitrary 1- and 2-Qbit states ; Summary : Obits versus Cbits -- General features and some simple examples: The general computational process ; Deutsch's problems ; Why additional Qbits needn't mess things up ; The Bernstein-Vazirani problem ; Simon's problem ; Constructing Toffoli gates -- Breaking RSA encryption: Period finding, factoring, and cryptography ; Number-theoretic preliminaries ; RSA encryption ; Quantum period finding : preliminary remarks ; The quantum Fourier transform ; Eliminating the 2-Qbit gates ; Finding the period ; Calculating the periodic function ; The unimportance of small phase errors ; Period finding and factoring -- Searching with a quantum computer: The nature of the search ; The Grover iteration ; How to construct W ; Generalization to several special numbers ; Searching for one out of four items -- Quantum error correction: The miracle of quantum error correction ; A simplified example ; The physics of error generation ; Diagnosing error syndromes ; The 5-Qbit error-correcting code ; The 7-Qbit error-correcting code ; Operations on 7-Qbit codewords ; A 7-Qbit encoding circuit ; A 5-Qbit encoding circuit -- Protocols that use just a few Qbits: Bell states ; Quantum cryptography ; Bit commitment ; Quantum dense coding ; Teleportation ; The GHZ puzzle -- Appendices: A, Vector spaces : basic properties and Dirac notation ; B, Structure of the general 1-Qbit unitary transformation ; C, Structure of the general 1-Qbit state ; D, Spooky action at a distance ; E, Consistency of the generalized Born rule ; F, Other aspects of Deutsch's problem ; G, The probability of success in Simon's problem ; H, One way to make a cNOT gate ; I, A little elementary group theory ; J, Some simple number theory ; K, Period finding and continued fractions ; L, Better estimates of success in period finding ; M, Factoring and period finding ; N, Shor's 9-Qbit error-correcting code ; O, A circuit-diagrammatic treatment of the 7-Qbit code ; P, On bit commitment.

This book is a concise introduction to quantum computation, developing the basic elements of this new branch of computational theory without assuming any background in physics. It begins with an introduction to the quantum theory from a computer-science perspective. It illustrates the quantum-computational approach with several elementary examples of quantum speed-up, before moving to the major applications...The book is intended primarily for computer scientists who know nothing about quantum theory, but will also be of interest to physicists who want to learn the theory of quantum computation, and philosophers of science interested in quantum foundational issues. -- From publisher's description.

Reviews provided by Syndetics

CHOICE Review

In his preface, Mermin (emer., physics, Cornell Univ.) says his book is primarily for computer scientists, electrical engineers, or mathematicians who know very little about quantum physics but wish to learn about quantum computation. Secondarily, it is for physicists who know very little about computer science and for thinkers interested in the foundational issues of quantum mechanics. Mermin, well known as a scientist and textbook and popular science writer, based the book on lectures he gave at Cornell before an audience from diverse fields. The first two chapters explain the differences between Cbits or classical bits in a computer, which can be 0 or 1 but not both, and Qbits or quantum bits, which can be in a superposition of 0 and 1. They also explain the general features, with examples, of computation using Qbits. Chapters 3 and 4 explain fully "the two masterpieces of quantum-computational software," Shor's period-finding algorithm and Grover's search algorithm, and the impact of quantum computing on cryptography. Chapter 5 discusses quantum error correcting codes, and chapter 6 discusses some quantum information-theoretic protocols. There are 16 appendixes on various supplementary matters. Very thorough explanations and lucid writing in this superb introductory work. Summing Up: Highly recommended. All levels. R. Bharath emeritus, Northern Michigan University

Author notes provided by Syndetics

N. David Mermin is Horace White Professor of Physics Emeritus at Cornell University.

There are no comments for this item.

Log in to your account to post a comment.