Sign In Start Free Trial
Account

Add to playlist

Create a Playlist

Modal Close icon
You need to login to use this feature.
  • Dancing with Qubits
  • Toc
  • feedback
Dancing with Qubits

Dancing with Qubits

By : Robert S. Sutor
5 (24)
close
Dancing with Qubits

Dancing with Qubits

5 (24)
By: Robert S. Sutor

Overview of this book

Dancing with Qubits, Second Edition, is a comprehensive quantum computing textbook that starts with an overview of why quantum computing is so different from classical computing and describes several industry use cases where it can have a major impact. A full description of classical computing and the mathematical underpinnings of quantum computing follows, helping you better understand concepts such as superposition, entanglement, and interference. Next up are circuits and algorithms, both basic and sophisticated, as well as a survey of the physics and engineering ideas behind how quantum computing hardware is built. Finally, the book looks to the future and gives you guidance on understanding how further developments may affect you. This new edition is updated throughout with more than 100 new exercises and includes new chapters on NISQ algorithms and quantum machine learning. Understanding quantum computing requires a lot of math, and this book doesn't shy away from the necessary math concepts you'll need. Each topic is explained thoroughly and with helpful examples, leaving you with a solid foundation of knowledge in quantum computing that will help you pursue and leverage quantum-led technologies.
Table of Contents (26 chapters)
close
1
I Foundations
8
II Quantum Computing
14
III Advanced Topics
18
Afterword
22
Other Books You May Enjoy
23
References
24
Index
Appendices

9.8 The Deutsch-Jozsa algorithm

I will now walk you through another early quantum algorithm that employs oracles. It shows us another form in which we express oracles in quantum circuits. algorithm$Deutsch-Jozsa Deutsch-Jozsa algorithm

Let’s begin with an example. Suppose I buy two standard decks of 52 playing cards. In a separate room where you cannot see me, I create a single deck of 52 cards where one of the following is true:

  1. All the cards are red, or all the cards are black.
  2. Half the cards (26) are black, and half are red.

We call the first option “constant” and the second “balanced.”

I now go to you and give you the problem of finding out which of the two possibilities is the case for the deck I am holding. You do so by looking at and then discarding cards at the top of the deck.

In the best case, the first card is one color, and the second is the other. Therefore, the...

bookmark search playlist download font-size

Change the font size

margin-width

Change margin width

day-mode

Change background colour

Close icon Search
Country selected

Close icon Your notes and bookmarks

Delete Bookmark

Modal Close icon
Are you sure you want to delete it?
Cancel
Yes, Delete