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.
A thorough exposition of quantum computing and the underlying concepts of quantum physics, with explanations of the relevant mathematics and numerous examples.
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.
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.
Combining physics, mathematics and computer science, topological quantum computation is a rapidly expanding research area focused on the exploration of quantum evolutions that are immune to errors. In this book, the author presents a variety of different topics developed together for the first time, forming an excellent introduction to topological quantum computation. The makings of anyonic systems, their properties and their computational power are presented in a pedagogical way. Relevant calculations are fully explained, and numerous worked examples and exercises support and aid understanding. Special emphasis is given to the motivation and physical intuition behind every mathematical concept. Demystifying difficult topics by using accessible language, this book has broad appeal and is ideal for graduate students and researchers from various disciplines who want to get into this new and exciting research field.
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.
"Introduction to Quantum Computation" is an introduction to a new rapidly developing theory of quantum computing. The book is a comprehensive introduction to the main ideas and techniques of quantum computation. It begins with the basics of classical theory of computation: NP-complete problems, Boolean circuits, Finite state machine, Turing machine and the idea of complexity of an algorithm. The general quantum formalism (pure states, qubit, superposition, evolution of quantum system, entanglement, multi-qubit system ...) and complex algorithm examples are also presented. Matlab is a well known in engineer academia as matrix computing environment, which makes it well suited for simulating quantum algorithms. The (Quantum Computer Toolbox) QCT is written entirely in the Matlab and m-files are listed in book's sections. There are certain data types that are implicitly defined by the QCT, including data types for qubit registers and transformations. The QCT contains many functions designed to mimic the actions of a quantum computer. In addition, the QCT contains several convenience functions designed to aid in the creation and modification of the data types used in algorithms. The main purposes of the QCT are for research involving Quantum Computation and as a teaching tool to aid in learning about Quantum Computing systems. The readers will learn to implement complex quantum algorithm (quantum teleportation and Deutsch, Grover, Shor algorithm) under Matlab environment (complete Matlab code 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.
An introduction to a rapidly developing topic: the theory of quantum computing. Following the basics of classical theory of computation, the book provides an exposition of quantum computation theory. In concluding sections, related topics, including parallel quantum computation, are discussed.
An accessible introduction to an exciting new area in computation, explaining such topics as qubits, entanglement, and quantum teleportation for the general reader. Quantum computing is a beautiful fusion of quantum physics and computer science, incorporating some of the most stunning ideas from twentieth-century physics into an entirely new way of thinking about computation. In this book, Chris Bernhardt offers an introduction to quantum computing that is accessible to anyone who is comfortable with high school mathematics. He explains qubits, entanglement, quantum teleportation, quantum algorithms, and other quantum-related topics as clearly as possible for the general reader. Bernhardt, a mathematician himself, simplifies the mathematics as much as he can and provides elementary examples that illustrate both how the math works and what it means. Bernhardt introduces the basic unit of quantum computing, the qubit, and explains how the qubit can be measured; discusses entanglement—which, he says, is easier to describe mathematically than verbally—and what it means when two qubits are entangled (citing Einstein's characterization of what happens when the measurement of one entangled qubit affects the second as “spooky action at a distance”); and introduces quantum cryptography. He recaps standard topics in classical computing—bits, gates, and logic—and describes Edward Fredkin's ingenious billiard ball computer. He defines quantum gates, considers the speed of quantum algorithms, and describes the building of quantum computers. By the end of the book, readers understand that quantum computing and classical computing are not two distinct disciplines, and that quantum computing is the fundamental form of computing. The basic unit of computation is the qubit, not the bit.