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.4 Arithmetic

In section 2.5, we looked at the rudimentary ideas of doing binary addition via logic gates. We’ll revisit that but see how to do it using quantum gates. Like most such algorithms, researchers have published many papers on optimizing the circuits using methods such as the Quantum Fourier Transform, which we cover in section 10.1. algorithm$addition

Addition

I keep to a straightforward approach to help bridge the gap between classical and quantum versions. The gates we use are simple, and we replace bits with qubits. Instead of 0 and 1, we use |0⟩ and |1⟩, respectively. We call the data input qubits |x and | y, and each is in the state |0⟩ or |1⟩ at any given time. We are essentially mimicking what we would do in the classical case.

If we do not worry about carry-in and carry-out qubits, our circuit looks like

Displayed math

where “⊕” is addition...

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