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.