Verification of higher-order probabilistic programs is a challenging problem. We present a
verification method that supports several quantitative properties of higher-order probabilistic …

Verifying quantum programs has attracted a lot of interest in recent years. In this article, we
consider the following two categories of termination problems of quantum programs with …

This thesis (Habilitation\a diriger des recherches) presents some of my research
contributions since my Ph. D defense in 2008. I have had the chance to participate in the …

We introduce a type system for the Quipper language designed to derive upper bounds on
the size of the circuits produced by the typed program. This size can be measured according …

Numerous quantum algorithms require the use of quantum error correction to overcome the
intrinsic unreliability of physical qubits. However, error correction imposes a unique …

Circuit description languages are a class of quantum programming languages in which
programs are classical and produce a description of a quantum computation, in the form of a …

This article proves a structured program theorem for flowchart quantum programs. The
theorem states that any flowchart quantum program is equivalent to a single quantum …

We consider the two categories of termination problems of quantum programs with
nondeterminism: 1) Is an input of a program terminating with probability one under all …

Circuit description languages are a class of quantum programming languages in which
programs are classical and produce a description of a quantum computation, in the form of a …

We report on ongoing work for providing software support for quantum computing, ranging
from a high-level quantum programming language and its formal semantics down to the …