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

2.5 Addition, logically

We can put these logic gates together to do addition using binary arithmetic, as we discussed in section 2.2: algorithm$addition

Displayed math

Focus on the values after the equal signs, and temporarily forget the carrying in the last case. The results are the same as what xor does with two inputs:

Displayed math Displayed math

We lost the carry bit but limited ourselves to having only one output bit. What gate operation would give us that 1 carry bit only if both inputs were also 1 and otherwise return 0? Correct, it’s and! If we combine the xor and the and, and give ourselves two bits of output, we can do a simple addition of two bits.

Exercise 2.6

Try drawing a circuit that would do this before peeking at what follows. You are allowed to clone the value of a bit and send it to two different gates.

The circuit is

Displayed math

where A, B, S, and C are bits. The circuit takes two single input...

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