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

Questions

  1. Figure 5.6 contains lots of little details. Keep me honest by checking to make sure that the H letters, question marks, zeros, ones, and arrows are all placed correctly on Bob’s side of the figure.
  2. Repeat your work from Question 1, this time verifying the ones, zeros, and question marks in Eve’s column in Figure 5.10.
  3. In carrying out the BB84 algorithm, Alice and Bob share some information out in the open. Bob shares all of his Hadamard choices, Alice announces which qubits are Hadamard agreement qubits, and Bob displays half of his Hadamard agreement bits. Justify the claim that making this information public doesn’t help Eve discover the key.
  4. Make up an example to build your intuitions about the right distributive law for tensor products: {"mathml":"<math style=\"font-family:stix;font-size:16px;\" xmlns=\"http://www.w3.org/1998/Math/MathML\"><mstyle mathsize=\"16px\"><mfenced><mrow><mi>x</mi><mo>&#xA0;</mo><mo>+</mo><mo>&#xA0;</mo><mi>y</mi></mrow></mfenced><mo>&#xA0;</mo><mo>&#x2297;</mo><mo>&#xA0;</mo><mi>z</mi><mo>&#xA0;</mo><mo>=</mo><mo>&#xA0;</mo><mfenced><mrow><mi>x</mi><mo>&#xA0;</mo><mo>&#x2297;</mo><mo>&#xA0;</mo><mi>z</mi></mrow></mfenced><mo>&#xA0;</mo><mo>+</mo><mo>&#xA0;</mo><mfenced><mrow><mi>y</mi><mo>&#xA0;</mo><mo>&#x2297;</mo><mo>&#xA0;</mo><mi>z</mi></mrow></mfenced></mstyle></math>"}.
  5. We began this chapter’s You can’t copy a qubit section by stating three laws for tensor products. Do we use all three of these laws in our argument about the truth of the No-Cloning...