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

Solving unsolvable problems

In 1936, Alan Turing wrote a landmark paper [4] in which he showed that a particular well-defined mathematical problem is impossible to solve. In this case, the word “impossible” means that no classical algorithm running for a finite amount of time will ever reach a final, concluding step. To prove his claim, Turing created a precise definition of what it means to be an algorithm and went on to devise a problem that contains its own circular knot.

Consider the following sentence:

Is “no” the correct answer to the question that you’re reading right now?

This sentence is like a double-edged sword:

  • If you answer “yes” to the sentence, you’re saying “Yes. It’s true that “no” is the correct answer.” But, if “no” is really the correct answer, your utterance of the word “yes” is incorrect.
  • If you answer “no” to...