The authors provide an introduction to quantum computing. Aimed at advanced undergraduate and beginning graduate students in these disciplines, this text is illustrated with diagrams and exercises.

This book provides a self-contained undergraduate course on quantum computing based on classroom-tested lecture notes. It reviews the fundamentals of quantum mechanics from the double-slit experiment to entanglement, before progressing to the basics of qubits, quantum gates, quantum circuits, quantum key distribution, and some of the famous quantum algorithms. As well as covering quantum gates in depth, it also describes promising platforms for their physical implementation, along with error correction, and topological quantum computing. With quantum computing expanding rapidly in the private sector, understanding quantum computing has never been so important for graduates entering the workplace or PhD programs. Assuming minimal background knowledge, this book is highly accessible, with rigorous step-by-step explanations of the principles behind quantum computation, further reading, and end-of-chapter exercises, ensuring that undergraduate students in physics and engineering emerge well prepared for the future.

A thorough exposition of quantum computing and the underlying concepts of quantum physics, with explanations of the relevant mathematics and numerous examples.

In 1994 Peter Shor [65] published a factoring algorithm for a quantum computer that finds the prime factors of a composite integer N more efficiently than is possible with the known algorithms for a classical com puter. Since the difficulty of the factoring problem is crucial for the se curity of a public key encryption system, interest (and funding) in quan tum computing and quantum computation suddenly blossomed. Quan tum computing had arrived. The study of the role of quantum mechanics in the theory of computa tion seems to have begun in the early 1980s with the publications of Paul Benioff [6]' [7] who considered a quantum mechanical model of computers and the computation process. A related question was discussed shortly thereafter by Richard Feynman [35] who began from a different perspec tive by asking what kind of computer should be used to simulate physics. His analysis led him to the belief that with a suitable class of "quantum machines" one could imitate any quantum system.

Quantum computing promises to solve problems which are intractable on digital computers. Highly parallel quantum algorithms can decrease the computational time for some problems by many orders of magnitude. This important book explains how quantum computers can do these amazing things. Several algorithms are illustrated: the discrete Fourier transform, Shor's algorithm for prime factorization; algorithms for quantum logic gates; physical implementations of quantum logic gates in ion traps and in spin chains; the simplest schemes for quantum error correction; correction of errors caused by imperfect resonant pulses; correction of errors caused by the nonresonant actions of a pulse; and numerical simulations of dynamical behavior of the quantum Control-Not gate. An overview of some basic elements of computer science is presented, including the Turing machine, Boolean algebra, and logic gates. The required quantum ideas are explained.

This textbook presents the elementary aspects of quantum computing in a mathematical form. It is intended as core or supplementary reading for physicists, mathematicians, and computer scientists taking a first course on quantum computing. It starts by introducing the basic mathematics required for quantum mechanics, and then goes on to present, in detail, the notions of quantum mechanics, entanglement, quantum gates, and quantum algorithms, of which Shor's factorisation and Grover's search algorithm are discussed extensively. In addition, the algorithms for the Abelian Hidden Subgroup and Discrete Logarithm problems are presented and the latter is used to show how the Bitcoin digital signature may be compromised. It also addresses the problem of error correction as well as giving a detailed exposition of adiabatic quantum computing. The book contains around 140 exercises for the student, covering all of the topics treated, together with an appendix of solutions.

One 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.