A Type-Theoretic Account of Quantum Computation

Explore a type-theoretic approach to quantum computation in this 28-minute conference talk from ACM SIGPLAN's TyDe'23. Delve into the presentation by Takafumi Saikawa and Jacques Garrigue as they use type-theoretic concepts to describe and prove properties of quantum computations, with a focus on quantum circuits. Discover how the speakers combine several components represented using dependent and polymorphic types in Coq, including lenses, finite functions, currying, polymorphism, and subtypes. Gain insights into their comprehensive account of pure quantum circuits and learn about the process of proving properties from the ground up in this extended abstract presentation.