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


  1. Is this circuit reversible?
  1. In this chapter’s Coding Deutsch’s algorithm section code, change the number of shots from 1 to 100. Then, run the modified code on a real quantum computer. How many of those 100 shots give you the correct answer (constant versus balanced)?

Run the modified code more than once. Observe the variation in the number of correct shots from one run to another.

  1. When we run Deutsch’s algorithm, the result depends on whether or not there’s a CNOT gate inside the oracle. But the result doesn’t depend on whether or not there’s an X gate in the oracle. Why not?
  2. Does the following circuitry implement the Opposite_of function? Why, or why not?
  1. Look up the compose method belonging to the QuantumCircuit class in the Qiskit documentation.

Modify the get_oracle code in this chapter’s Coding Deutsch’s algorithm...