Quantum Algorithmic Structures

What did you learn last week?
Last week you were introduced to the Deutsch-Jozsa algorithm, which was the first computational algorithm to show a speed-up over any classical algorithm. You also learned about how to perform digital logic in a quantum computation and create quantum oracles.
What will you learn this week?
This week you will learn about the high-level structure of quantum algorithms and some primitives such as superposition, digital logic, phase logic, and uncomputation. With these you’ll at least be able to fake it until you make it!
What will you be able to do at the end of this week 5?
At the end of this module, you should be able to answer these questions:
What is uncomputation?
What are the core primitives of quantum algorithms?
What is the basic structure of a quantum algorithm?

Would you recognise a quantum computation if you saw it?

Have a go at https://scratch.mit.edu/.

Computing in superposition

Just a phase this state will grow out of

Uncompute but not uncomputable

Play with this circuit on Quirk.
Play with this circuit on Quirk.
The full uncomputed circuit of the CCCNOT gate can be found on Quirk.
My IMBQ implementation of an uncomputed Deutsch-Jozsa circuit. You can also play around this circuit in simulation on Quirk.

Additional Resources

Quantum theorist by day, father by night. Occasionally moonlights as a children’s book author. www.csferrie.com @csferrie

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store