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

Describing Deutsch’s problem

Deutsch’s algorithm solves a problem concerning constant and balanced functions. So, as you start this chapter, I want to make sure that you’re familiar with the terms algorithm, function, constant function, and balanced function. This section covers those essential ideas.


You may have seen friendly signs that display the equivalent of “Welcome!” in many languages. Figure 7.1 does the same kind of thing for a particular sequence of instructions:

Figure 7.1 – Expressing the steps that add 1 to a number

Figure 7.1 – Expressing the steps that add 1 to a number

Each part of Figure 7.1 inputs a number and outputs that number plus 1. The parts look different, but they all describe the same sequence of steps. This sequence of steps is an example of an algorithm.


An algorithm is a sequence of steps.

You can change the way you describe a particular sequence of steps. But when you do, you still have the same algorithm...