Quantum software tools for a wide variety of design tasks on and across different levels of
abstraction are crucial in order to eventually realize useful quantum applications. This …

As state-of-the-art quantum computers are capable of running increasingly complex
algorithms, the need for automated methods to design and test potential applications rises …

Quantum programs exhibit inherent non-deterministic behavior, which poses more
significant challenges for error discovery compared to classical programs. While several …

Verifying equivalence between two quantum circuits is a hard problem, that is nonetheless
crucial in compiling and optimizing quantum algorithms for real-world devices. This paper …

Tensor networks have been successfully applied in simulation of quantum physical systems
for decades. Recently, they have also been employed in classical simulation of quantum …

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

Universal and fault-tolerant quantum computation is a promising new paradigm that may
efficiently conquer difficult computation tasks beyond the reach of classical computation. It …

Efficient methods for the representation and simulation of quantum states and quantum
operations are crucial for the optimization of quantum circuits. Decision diagrams (DDs), a …

Quantum circuit verification is essential, ensuring that quantum program compilation yields a
sequence of primitive unitary operators executable correctly and reliably on a quantum …

As state-of-the-art quantum computers are capable of running increasingly complex
algorithms, the need for automated methods to design and test potential applications rises …