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

10.7 Shor’s factoring algorithm

We now have the tools we need for Shor’s factoring algorithm to factor integers in polynomial time on a sufficiently large quantum computer. The is a near-exponential improvement over the best known classical methods we described in section 10.2. algorithm$Shor’s factoring Shor’s factoring algorithm factoring$Shor’s algorithm

The complete algorithm has both classical and quantum components. Work is done on both kinds of machines to get to the answer. The quantum portion drops us down to polynomial complexity in the number of gates using phase estimation, order finding, modular exponentiation, and the QFT.

Let odd M in Z be greater than 3 for which you have already tried the basic tricks from section 10.2.3 to check that it is not a multiple of 3, 5, 7, and so on. So that you don’t waste your time, you should also try trial division using a small list of primes, although this is not necessary...

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