5 (1)

5 (1)

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.
Introduction to Quantum Computing
Free Chapter
Part 1 Nuts and Bolts
Chapter 1: New Ways to Think about Bits
Chapter 2: What Is a Qubit?
Chapter 3: Math for Qubits and Quantum Gates
Chapter 4: Qubit Conspiracy Theories
Part 2 Making Qubits Work for You
Chapter 5: A Fanciful Tale about Cryptography
Chapter 6: Quantum Networking and Teleportation
Part 3 Quantum Computing Algorithms
Chapter 7: Deutsch’s Algorithm
Chapter 8: Grover’s Algorithm
Chapter 9: Shor’s Algorithm
Part 4 Beyond Gate-Based Quantum Computing
Chapter 10: Some Other Directions for Quantum Computing
Index
Other Books You May Enjoy

Chapter 7, Deutsch’s Algorithm

1. This circuit is not reversible. When x = y, the output is 01 regardless of whether x and y are both 0 or x and y are both 1. When x y, the output is 10 regardless of which input is 0 and which is 1.
2. The number of correct shots varies quite a lot because the amount of noise isn’t predictable. Also, some quantum computers tend to be less noisy than others. On IBM devices, the number of correct shots out of 100 is typically in the 90s but sometimes in the 80s.
3. The CNOT gate affects both the top and bottom qubits. But when we add an X gate, we add it to the bottom qubit. The top qubit (the qubit that we eventually measure) remains unchanged.
4. This circuit implements the Opposite_of function. The leftmost X gate reverses the roles of inputs 0 and 1 from what they’d be with the Identity function. Then, the rightmost X gate restores the top qubit to its original 0 value or 1 value. That rightmost X gate has no effect on...