Quantum Computation and Quantum Information: 10th Anniversary EditionOne of the most cited books in physics of all time, Quantum Computation and Quantum Information remains the best textbook in this exciting field of science. This 10th anniversary edition includes an introduction from the authors setting the work in context. This comprehensive textbook describes such remarkable effects as fast quantum algorithms, quantum teleportation, quantum cryptography and quantum error-correction. Quantum mechanics and computer science are introduced before moving on to describe what a quantum computer is, how it can be used to solve problems faster than 'classical' computers and its real-world implementation. It concludes with an in-depth treatment of quantum information. Containing a wealth of figures and exercises, this well-known textbook is ideal for courses on the subject, and will interest beginning graduate students and researchers in physics, computer science, mathematics, and electrical engineering. |
From inside the book
Results 1-5 of 9
Page xvii
What makes quantum systems difficult to understand and simulate by
conventional classical means? ... is clear such questions offer a sustained force
encouraging a broad research program at the foundations of physics and
computer science.
What makes quantum systems difficult to understand and simulate by
conventional classical means? ... is clear such questions offer a sustained force
encouraging a broad research program at the foundations of physics and
computer science.
Page 7
called 'discrete logarithm' problem – could be solved efficiently on a quantum
computer. This attracted widespread interest because these two problems were
and still are widely believed to have no efficient solution on a classical computer.
called 'discrete logarithm' problem – could be solved efficiently on a quantum
computer. This attracted widespread interest because these two problems were
and still are widely believed to have no efficient solution on a classical computer.
Page 39
Quantum simulation Simulating naturally occurring quantum mechanical systems
is an obvious candidate for a task at which quantum computers may excel, yet
which is believed to be difficult on a classical computer. Classical computers
have ...
Quantum simulation Simulating naturally occurring quantum mechanical systems
is an obvious candidate for a task at which quantum computers may excel, yet
which is believed to be difficult on a classical computer. Classical computers
have ...
Page 40
computers will double once every two years or so, for constant cost. However,
suppose we are simulating a quantum system on a classical computer, and want
to add a single qubit (or a larger system) to the system being simulated.
computers will double once every two years or so, for constant cost. However,
suppose we are simulating a quantum system on a classical computer, and want
to add a single qubit (or a larger system) to the system being simulated.
Page 120
You have reached your viewing limit for this book.
You have reached your viewing limit for this book.
What people are saying - Write a review
User Review - Flag as inappropriate
it's good
User Review - Flag as inappropriate
It is a good starting point.
Contents
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 |
Entropy and information | 500 |
Quantum information theory | 528 |
Appendices | 608 |
The SolovayKitaev theorem | 617 |
Number theory | 625 |
Public key cryptography and the RSA cryptosystem | 640 |
Bibliography | 649 |
Index | 665 |
Other editions - View all
Quantum Computation and Quantum Information: 10th Anniversary Edition Michael A. Nielsen,Isaac L. Chuang No preview available - 2010 |
Common terms and phrases
Alice and Bob ancilla applied arbitrary atom bit flip Bloch sphere chapter classical computer classical information computation and quantum computational basis construction controlled defined definition density matrix density operator described difficult efficiently eigenvalues encoded entanglement entropy equation error error-correcting codes example Exercise factor fault-tolerant fidelity field Figure final find finite first fixed function gives Hadamard gate Hamiltonian implement inequality input integer interaction linear noise obtain operation elements oracle order-finding orthonormal output Pauli perform phase flip physical polynomial possible POVM probability problem procedure proof properties protocol prove quantum algorithms quantum circuit quantum codes quantum computation quantum error-correction quantum Fourier transform quantum gates quantum information processing quantum mechanics quantum operation quantum search algorithm quantum system result satisfies Section Show simulation single qubit solve specific spin subadditivity sufficient Suppose Toffoli gate trace distance Turing machine unitary matrix unitary operator unitary transform vector space