Quantum Computation and Quantum InformationIn this first comprehensive introduction to the main ideas and techniques of quantum computation and information, Michael Nielsen and Isaac Chuang ask the question: What are the ultimate physical limits to computation and communication? They detail such remarkable effects as fast quantum algorithms, quantum teleportation, quantum cryptography and quantum error correction. A wealth of accompanying figures and exercises illustrate and develop the material in more depth. They describe what a quantum computer is, how it can be used to solve problems faster than familiar "classical" computers, and the realworld implementation of quantum computers. Their book concludes with an explanation of how quantum states can be used to perform remarkable feats of communication, and of how it is possible to protect quantum states against the effects of noise. 
What people are saying  Write a review
User ratings
5 stars 
 
4 stars 
 
3 stars 
 
2 stars 
 
1 star 

Review: Quantum Computation and Quantum Information (Cambridge Series on Information and the Natural Sciences)
User Review  Brian  GoodreadsGreat introduction because it reviews both the basic of quantum and computer science, giving a broad perspective that fills in a lot of gaps left by other texts. Read full review
Review: Quantum Computation and Quantum Information (Cambridge Series on Information and the Natural Sciences)
User Review  Niraj Kumar  Goodreadsrigorous.. and a must for all quantum computing persuers.. Read full review
Contents
Fundamental concepts  1 
Introduction to quantum mechanics  60 
Introduction to computer science  120 
Quantum computation  171 
The quantum Fourier transform and its applications  216 
Quantum search algorithms  248 
physical realization  277 
Quantum information  353 
Common terms and phrases
Alice and Bob ancilla applied approximation arbitrary atom bit flip Bloch sphere bound chapter classical computer classical information CNOT complex numbers computation and quantum computational basis construction controlledNOT gate defined denote density matrix density operator described efficiently eigenstates eigenvalues encoded entanglement equation error errorcorrecting codes example Exercise factor faulttolerant fidelity Figure finite function gives Hadamard gate Hamiltonian History and further implemented inequality input integer interaction known linear model of computation noise notation obtain operation elements oracle orderfinding output Pauli perform phase estimation phase flip physical polynomial possible POVM problem procedure proof properties protocol prove quantum algorithms quantum circuit quantum codes quantum computation quantum errorcorrection quantum Fourier transform quantum information processing quantum mechanics quantum operation quantum search algorithm quantum system result Section sequence Show simulation single qubit solve spin subadditivity Suppose Toffoli gate trace distance Turing machine unitary matrix unitary operator unitary transform vector space
Popular passages
Page 650  CH Bennett, G. Brassard, S. Popescu, B. Schumacher, J. A. Smolin, and WK Wootters. Purification of noisy entanglement and faithful teleportation via noisy channels.
Page 659  Dense coding in experimental quantum communication," Phys. Rev. Lett., vol. 76, p. 4656, 1996. 11 CH Bennett and G. Brassard, in Proceedings of the IntemationalConference on Computer Systems and Signal Processing, Bangalore, 1984, p.