Quantum computing (QC) introduces a novel mode of computation with the possibility of
greater computational power that remains to be exploited—presenting exciting opportunities …

Existing quantum languages force the programmer to work at a low level of abstraction
leading to unintuitive and cluttered code. A fundamental reason is that dropping temporary …

We present VOQC, the first fully verified optimizer for quantum circuits, written using the Coq
proof assistant. Quantum circuits are expressed as programs in a simple, low-level language …

CoqQ is a framework for reasoning about quantum programs in the Coq proof assistant. Its
main components are: a deeply embedded quantum programming language, in which …

We introduce Qunity, a new quantum programming language designed to treat quantum
computing as a natural generalization of classical computing. Qunity presents a unified …

While recent progress in quantum hardware open the door for significant speedup in certain
key areas, quantum algorithms are still hard to implement right, and the validation of such …

This paper presents Giallar, a fully-automated verification toolkit for quantum compilers.
Giallar requires no manual specifications, invariants, or proofs, and can automatically verify …

Near-term quantum computers are expected to work in an environment where each
operation is noisy, with no error correction. Therefore, quantum-circuit optimizers are applied …

Quantum programming languages enable developers to implement algorithms for quantum
computers that promise computational breakthroughs in classically intractable tasks …

To implement quantum algorithms on quantum computers it is crucial to decompose their
operators into the limited gate set supported by those computers. Unfortunately, existing …