Automata-based verification of quantum circuits

Ondřej Lengál (Brno University of Technology)

Wed May 20, 13:00-14:00 (3 months from now)
(Password: Subscribe to the mailing list to receive the password)

Abstract: Development of quantum programs is hard due to their intricate structure and inherently probabilistic nature. Computer-aided tool support is therefore essential. Computer-based reasoning over quantum programs is, however, also challenging due to the exponential size of the program's state. In this talk, I will present a recent framework for automated formal verification of quantum programs that uses automata to represent complex sets of quantum states compactly.

formal languages and automata theory

Audience: researchers in the topic


One FLAT World Seminar

Organizers: Luca Prigioniero*, Rogério Reis*
*contact for this listing

Export talk to