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
2
Part 1 Nuts and Bolts
7
Part 2 Making Qubits Work for You
10
Part 3 Quantum Computing Algorithms
14
Part 4 Beyond Gate-Based Quantum Computing

Deutsch’s algorithm F.A.Q.

Like most people, you may view Deutsch’s algorithm with a bit of skepticism. Is this all we can do with a multi-million-dollar quantum computer? Let’s consider such questions:

  • With Deutsch’s algorithm, you evaluate f(x) once instead of twice. Is that time-saving such a big deal?

The time saving is tiny, but tiny time savings add up when you’re doing billions of calculations. Besides, the fact that we can evaluate a function only once and discover something about two possible output values (f(0) and f(1)) is amazing. You have to admit that.

  • Deutsch’s algorithm requires circuitry that’s not needed in the classical algorithm. You need a few Hadamard gates and an oracle with two outputs. Does this mean that Deutsch’s algorithm is less efficient than the classical algorithm?

To measure efficiency, computer scientists consider the relationship between the amount of input and the...