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)
Part I: Getting to Know Python
PART II: Algorithms and Circuits
PART III: Advanced Features and Libraries
Other Books You May Enjoy
Appendix C: The Complete UniPoly Class
Appendix D: The Complete Guitar Class Hierarchy
Appendix F: Production Notes

12.2 Regular expressions

Suppose you post a question on an online software developer channel or website asking about some complex text search problem. Someone is likely to give a regular expression answer written as a combination of most of the letters and punctuation marks you can imagine.

Python’s engine to process the expression and find your text via regular expressions is in the re module. [PYR2] We also use regular expressions to perform sophisticated text substitutions.

Let’s begin by thinking about how we would find the substring "ecos" in

string = "Economic, ecological ecosystem"

Our process should return None if substring is not present in string. If it is, the function returns a tuple where the first item is the index of the first position at which it occurs, and the second is the length of the substring. We call this tuple the match information...