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

Coding Deutsch’s algorithm

Most of the code in this section uses Qiskit features from previous chapters.

First, we have our import declarations:

from qiskit import QuantumCircuit, executefrom qiskit_ibm_provider import IBMProvider
from enum import Enum

To distinguish between the simple binary functions, we create a Python enumeration:

class SimpleBinary(Enum):    ZERO        = 0
    ONE         = 1
    SAME_AS     = 2

This chapter’s code makes little use of the SimpleBinary enumeration. But having an enumeration feels better than just assigning the numbers 0, 1, 2, and 3 to the four functions.

Our get_oracle code adds different gates to a circuit depending on which of the simple binary functions we want to implement:

def get_oracle(circ, function...