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

We present a new technique for accelerating quantum program testing. Given a quantum
circuit with an input/output specification, our goal is to check whether executing the program …

Quantum recursive programming has been recently introduced for describing sophisticated
and complicated quantum algorithms in a compact and elegant way. However …

Grover's algorithm harnesses the power of quantum computing to swiftly locate specific
elements in an unstructured database, outperforming classical computers in tasks like …

Recursive techniques have recently been introduced into quantum programming so that a
variety of large quantum circuits and algorithms can be elegantly and economically …