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.
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.
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.
Demystify quantum computing by learning the math it is built on Key Features Build a solid mathematical foundation to get started with developing powerful quantum solutions Understand linear algebra, calculus, matrices, complex numbers, vector spaces, and other concepts essential for quantum computing Learn the math needed to understand how quantum algorithms function Book DescriptionQuantum computing is an exciting subject that offers hope to solve the world’s most complex problems at a quicker pace. It is being used quite widely in different spheres of technology, including cybersecurity, finance, and many more, but its concepts, such as superposition, are often misunderstood because engineers may not know the math to understand them. This book will teach the requisite math concepts in an intuitive way and connect them to principles in quantum computing. Starting with the most basic of concepts, 2D vectors that are just line segments in space, you'll move on to tackle matrix multiplication using an instinctive method. Linearity is the major theme throughout the book and since quantum mechanics is a linear theory, you'll see how they go hand in hand. As you advance, you'll understand intrinsically what a vector is and how to transform vectors with matrices and operators. You'll also see how complex numbers make their voices heard and understand the probability behind it all. It’s all here, in writing you can understand. This is not a stuffy math book with definitions, axioms, theorems, and so on. This book meets you where you’re at and guides you to where you need to be for quantum computing. Already know some of this stuff? No problem! The book is componentized, so you can learn just the parts you want. And with tons of exercises and their answers, you'll get all the practice you need.What you will learn Operate on vectors (qubits) with matrices (gates) Define linear combinations and linear independence Understand vector spaces and their basis sets Rotate, reflect, and project vectors with matrices Realize the connection between complex numbers and the Bloch sphere Determine whether a matrix is invertible and find its eigenvalues Probabilistically determine the measurement of a qubit Tie it all together with bra-ket notation Who this book is for If you want to learn quantum computing but are unsure of the math involved, this book is for you. If you’ve taken high school math, you’ll easily understand the topics covered. And even if you haven’t, the book will give you a refresher on topics such as trigonometry, matrices, and vectors. This book will help you gain the confidence to fully understand quantum computation without losing you in the process!
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.
Among the most exciting developments in science today is the design and construction of the quantum computer. Its realization will be the result of multidisciplinary efforts, but ultimately, it is mathematics that lies at the heart of theoretical quantum computer science. Mathematics of Quantum Computation brings together leading computer sc
Quantum computers are poised to kick-start a new computing revolution—and you can join in right away. If you’re in software engineering, computer graphics, data science, or just an intrigued computerphile, this book provides a hands-on programmer’s guide to understanding quantum computing. Rather than labor through math and theory, you’ll work directly with examples that demonstrate this technology’s unique capabilities. Quantum computing specialists Eric Johnston, Nic Harrigan, and Mercedes Gimeno-Segovia show you how to build the skills, tools, and intuition required to write quantum programs at the center of applications. You’ll understand what quantum computers can do and learn how to identify the types of problems they can solve. This book includes three multichapter sections: Programming for a QPU—Explore core concepts for programming quantum processing units, including how to describe and manipulate qubits and how to perform quantum teleportation. QPU Primitives—Learn algorithmic primitives and techniques, including amplitude amplification, the Quantum Fourier Transform, and phase estimation. QPU Applications—Investigate how QPU primitives are used to build existing applications, including quantum search techniques and Shor’s factoring algorithm.
A thorough exposition of quantum computing and the underlying concepts of quantum physics, with explanations of the relevant mathematics and numerous examples.
Quantum computing is on the horizon, ready to impact everything from scientific research to encryption and security. But you don't need a physics degree to get started in quantum computing. Quantum Computing for Developers shows you how to leverage your existing Java skills into writing your first quantum software so you're ready for the revolution. Rather than a hardware manual or academic theory guide, this book is focused on practical implementations of quantum computing algorithms. Using Strange, a Java-based quantum computer simulator, you'll go hands-on with quantum computing's core components including qubits and quantum gates as you write your very first quantum code. Purchase of the print book includes a free eBook in PDF, Kindle, and ePub formats from Manning Publications.
