Automated reasoning techniques have been proven of immense importance in classical
applications like formal verification, circuit design and probabilistic inference. The domain of …

Checking whether two quantum circuits are equivalent is important for the design and
optimization of quantum-computer applications with real-world devices. We consider …

This paper presents a new data structure, called Weighted Context-Free-Language Ordered
BDDs (WCFLOBDDs), which are a hierarchically structured decision diagram, akin to …

We present a new method for the verification of quantum circuits based on a novel symbolic
representation of sets of quantum states using level-synchronized tree automata (LSTAs) …

This tutorial introduces quantum computing with a focus on the applicability of formal
methods in this relatively new domain. We describe quantum circuits and convey an …

Quantum computing is finding promising applications in optimization, machine learning and
physics, leading to the development of various models for representing quantum …

We present a new method for the verification of quantum circuits based on a novel symbolic
representation of sets of quantum states using level-synchronized tree automata (LSTAs) …

Quantum computing holds the promise of revolutionizing the field of computation by
surpassing classical computers in terms of efficiency, particularly in tackling tasks that are …