Book Image

Quantum Computing Algorithms

By : Barry Burd
5 (1)
Book Image

Quantum Computing Algorithms

5 (1)
By: Barry Burd

Overview of this book

Navigate the quantum computing spectrum with this book, bridging the gap between abstract, math-heavy texts and math-avoidant beginner guides. Unlike intermediate-level books that often leave gaps in comprehension, this all-encompassing guide offers the missing links you need to truly understand the subject. Balancing intuition and rigor, this book empowers you to become a master of quantum algorithms. No longer confined to canned examples, you'll acquire the skills necessary to craft your own quantum code. Quantum Computing Algorithms is organized into four sections to build your expertise progressively. The first section lays the foundation with essential quantum concepts, ensuring that you grasp qubits, their representation, and their transformations. Moving to quantum algorithms, the second section focuses on pivotal algorithms — specifically, quantum key distribution and teleportation. The third section demonstrates the transformative power of algorithms that outpace classical computation and makes way for the fourth section, helping you to expand your horizons by exploring alternative quantum computing models. By the end of this book, quantum algorithms will cease to be mystifying as you make this knowledge your asset and enter a new era of computation, where you have the power to shape the code of reality.
Table of Contents (19 chapters)
Free Chapter
Part 1 Nuts and Bolts
Part 2 Making Qubits Work for You
Part 3 Quantum Computing Algorithms
Part 4 Beyond Gate-Based Quantum Computing

Some Other Directions for Quantum Computing

This book is about gate-based quantum computing. In each example, we prepare qubits and apply operations with gates. Most of the gates perform reversible quantum operations. The main exceptions to the reversibility rule are the measurement gates, which destroy superposition and yield solutions to our intricate, mathematical problems.

Gate-based quantum computing is great for certain problems such as cracking RSA encryption, but, as far as we know, many other problems are more easily solved using classical computing. To search for a value in an unsorted list, you can run Grover’s algorithm on a quantum computer, but to find out how much tax you owe the government this year, you should run a Java program on a classical computer. (In fact, doing all your tax calculations by hand would probably be more efficient than relying on any kind of quantum computer for help.)

Nevertheless, gate-based quantum computing is an example of general...