Book Image

Dancing with Python

By : Robert S. Sutor
Book Image

Dancing with Python

By: Robert S. Sutor

Overview of this book

Dancing with Python helps you learn Python and quantum computing in a practical way. It will help you explore how to work with numbers, strings, collections, iterators, and files. The book goes beyond functions and classes and teaches you to use Python and Qiskit to create gates and circuits for classical and quantum computing. Learn how quantum extends traditional techniques using the Grover Search Algorithm and the code that implements it. Dive into some advanced and widely used applications of Python and revisit strings with more sophisticated tools, such as regular expressions and basic natural language processing (NLP). The final chapters introduce you to data analysis, visualizations, and supervised and unsupervised machine learning. By the end of the book, you will be proficient in programming the latest and most powerful quantum computers, the Pythonic way.
Table of Contents (29 chapters)
2
Part I: Getting to Know Python
10
PART II: Algorithms and Circuits
14
PART III: Advanced Features and Libraries
19
References
20
Other Books You May Enjoy
Appendices
Appendix C: The Complete UniPoly Class
Appendix D: The Complete Guitar Class Hierarchy
Appendix F: Production Notes

9.2 Boolean operations and bit logic gates

As we saw in section 2.5, there is a direct correspondence between Booleans and bits, equating True to 1 and False to 0. I first learned about Booleans and their operations in a logic course in my college Philosophy department. [MOL] You can also take a mathematical approach and look at Boolean algebra. Bits and circuits are fundamental to electrical engineering and computer science. Perceived distinctions among these approaches can be misleading because we talk about the same ideas using different words.

In this section, I work with bits and use their associated gate language.

9.2.1 1-bit gates

The simplest 1-bit gate is id, which leaves each of 0 and 1 alone. It is the identity gate. A much more useful gate is not, which maps 0 to 1 and 1 to 0.

...