Reversible computing is a form of unconventional computing which uses deterministic transitions from one state to another, and is made possible by the unitarity of quantum mechanics. This allows for quantum circuits to be reversible, as long as they do not collapse the quantum states they operate on.

This course provides an initial dive into complexity theory, exploring computations bound by resources like time, space, and energy. Emphasis is placed on low complexity classes.