Quantum circuit compilation comprises many computationally hard reasoning tasks that lie
inside# P and its decision counterpart in PP. The classical simulation of universal quantum …

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 …

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 …

Variational quantum algorithms have been introduced as a promising class of quantum-
classical hybrid algorithms that can already be used with the noisy quantum computing …

In the 1970s, researchers started to utilize quantum mechanics to address questions in
computer science and information theory—establishing new research directions (such as …

By using quantum mechanical effects, quantum computers promise significant speedups in
solving problems intractable for conventional computers. However, despite recent progress …

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, which was first proposed by Richard P. Feynman in 1982, promises to
solve problems beyond the reach of today's machines and has the potential to revolutionize …

Quantum computation and optimization have recently garnered considerable attention, with
a noticeable focus on their floating-point and arithmetic designs. In classical computing …