Search icon
Arrow left icon
All Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Newsletters
Free Learning
Arrow right icon
Quantum Computing Algorithms

You're reading from  Quantum Computing Algorithms

Product type Book
Published in Sep 2023
Publisher Packt
ISBN-13 9781804617373
Pages 342 pages
Edition 1st Edition
Languages
Author (1):
Barry Burd Barry Burd
Profile icon Barry Burd

Table of Contents (19) Chapters

Preface 1. Introduction to Quantum Computing 2. Part 1 Nuts and Bolts
3. Chapter 1: New Ways to Think about Bits 4. Chapter 2: What Is a Qubit? 5. Chapter 3: Math for Qubits and Quantum Gates 6. Chapter 4: Qubit Conspiracy Theories 7. Part 2 Making Qubits Work for You
8. Chapter 5: A Fanciful Tale about Cryptography 9. Chapter 6: Quantum Networking and Teleportation 10. Part 3 Quantum Computing Algorithms
11. Chapter 7: Deutsch’s Algorithm 12. Chapter 8: Grover’s Algorithm 13. Chapter 9: Shor’s Algorithm 14. Part 4 Beyond Gate-Based Quantum Computing
15. Chapter 10: Some Other Directions for Quantum Computing 16. Assessments 17. Index 18. Other Books You May Enjoy

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...
lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $15.99/month. Cancel anytime}