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

Is the BB84 algorithm useful?

In the previous section, Alice and Bob formed a randomly generated secret. Both Alice and Bob know 10100 or whatever other sequence their BB84 algorithm generated. But what good is that? If Alice can’t decide exactly what she wants to say to Bob, why should she bother saying anything at all?

The answer lies in what Alice does with the randomly generated secret. By combining her randomly generated secret with some meaningful information, Alice can form a sequence of characters that’s meaningful to Bob but meaningless to an eavesdropper.

Here’s some terminology:

  • The randomly generated secret is called a key.

For example, in the previous section, Alice and Bob created the key 10100.

  • The meaningful information that must be kept from prying eyes is called plaintext.

Imagine that Alice wants to send the word Stop! to Bob. Alice doesn’t want anyone else to read this message. The word Stop! is an...