In the not-so-distant future, quantum computing will change the way we tackle certain
problems. It promises to dramatically speed-up many chemical, financial, cryptographical …

We introduce a new paradigm for analysing and finding bugs in quantum circuits. In our
approach, the problem is given by a ‍triple {P} C {Q} and the question is whether, given a set …

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 …

We are at the dawn of a new “computing age” in which quantum computers will find their
way into practical applications. Although quantum computers work differently than classical …

Realizing a conceptual quantum algorithm on an actual physical device necessitates the
algorithm's quantum circuit description to undergo certain transformations in order to adhere …

We consider the problem of estimating quantum observables on a collection of qubits, given
as a linear combination of Pauli operators, with shallow quantum circuits consisting of single …

Satisfiability Testing (SAT) techniques are well-established in classical computing where
they are used to solve a broad variety of problems, eg, in the design of classical circuits and …

With quantum computers promising advantages even in the near-term NISQ era, there is a
lively community that develops software and toolkits for the design of corresponding …

With quantum computers on the brink of practical applicability, there is a lively community
that develops toolkits for the design of corresponding quantum circuits. Many of the …

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