Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Quantum Computing Algorithms

You're reading from   Quantum Computing Algorithms Discover how a little math goes a long way

Arrow left icon
Product type Paperback
Published in Sep 2023
Publisher Packt
ISBN-13 9781804617373
Length 342 pages
Edition 1st Edition
Arrow right icon
Author (1):
Arrow left icon
Barry Burd Barry Burd
Author Profile Icon Barry Burd
Barry Burd
Arrow right icon
View More author details
Toc

Table of Contents (19) Chapters Close

Preface 1. Introduction to Quantum Computing 2. Part 1 Nuts and Bolts FREE CHAPTER
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

You can’t copy a qubit

The BB84 algorithm works because no eavesdropper can make a copy of a qubit’s state. Imagine that Eve intercepts one of Alice’s qubits, makes a measurement, and gets a value of 1. Eve has no way of knowing whether the qubit she measured was in the |1 state, the state, the state, or some other exotic in-between state. So, Eve doesn’t know exactly what to forward to Bob.

But wait! Can we be sure that Eve has no way to make a copy of Alice’s qubit? Yes, we can. The No-Cloning theorem shows that assuming that qubits can be copied leads to a nasty contradiction.

Let’s start by agreeing on three properties of tensor products:

  • For any three matrices, x, y, and z, a left distributive law holds – that is, {"mathml":"<math style=\"font-family:stix;font-size:16px;\" xmlns=\"http://www.w3.org/1998/Math/MathML\"><mstyle mathsize=\"16px\"><mi>x</mi><mo>&#xA0;</mo><mo>&#x2297;</mo><mo>&#xA0;</mo><mfenced><mrow><mi>y</mi><mo>&#xA0;</mo><mo>+</mo><mo>&#xA0;</mo><mi>z</mi></mrow></mfenced><mo>&#xA0;</mo><mo>=</mo><mo>&#xA0;</mo><mfenced><mrow><mi>x</mi><mo>&#xA0;</mo><mo>&#x2297;</mo><mo>&#xA0;</mo><mi>y</mi></mrow></mfenced><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></mstyle></math>"}.

You can write out a formal proof of this fact, but I always like to test with a simple example:

An example is never as good as proof, but an example helps us...

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 $19.99/month. Cancel anytime
Banner background image