07/12/2022 - 12:00


Abuzer Yakaryilmaz

The seminar will include the second part of a lecture on classical and quantum automata. After having a few examples on the DFAs with discussions on their limitations, we introduce their probabilistic and quantum variants. We present a representative algorithm for each of these variants, followed by a discussion on the quantum advantages in finite automata settings. We shortly review the recent implementations of QFA algorithms on real quantum hardware.