This repository contains code with tutorials on how to approach optimization problems using quantum computing. I used Travelling Salesman Problem for this tutorials, though the idea is, that after finishing it, you should be able to implement any similar optimization problem.

I have created this tutorial with specific audience in mind. It means people, who:

• are curious about quantum computing,
• don't have any background in quantum physics,
• have some programming experience,
• really want to learn this topic.

The last point is the most important. My goal here is not to show you how to solve TSP with a quantum computer. My goal is to teach you how to solve optimization problems with QC, make sure your solution works and how to improve it. To do all that you need to put some effort into it and spend a couple of hours trying to understand all the concepts. But this is on purpose - this is the best way I know to actually learn the topic and integrate this knowledge.

I did my best to provide you with all the necessary knowledge, code examples etc. If you think something is not clear, missing, you have a better idea - well, I encourage you to do one of these two things:

• Do a pull request to this repository
• Write me an e-mail at [email protected]

I don't want to say that it is super advanced and hard - as stated earlier, you don't have to be a quantum computing expert.

In this tutorial I used pyquil 2.2.1 and grove 1.7.0 . API of these librares may change in next versions - let me know if something is broken so I can fix it :)

My name is Michał and I work as Quantum Software Engineer at Zapata Computing. You can find more materials onmy blog Musty thoughts.

If you want to contact me - feel free to do so: [email protected] .

This project is supported by Unitary Fund. If you have an idea for an open-source project for near term hybrid quantum-classical programming, this is a good place for you!

Thanks to Jacek Łysiak and Katerina Gratsea for feedback!