Over the past 27 years, quantum computing has seen a huge rise in interest from both
academia and industry. At the current rate, quantum computers are growing in size rapidly …

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 …

Quantitative formal models capture probabilistic behaviour, real-time aspects, or general
continuous dynamics. A number of tools support their automatic analysis with respect to …

Abstract Model-checking techniques have been extended to analyze quantum programs
and communication protocols represented as quantum Markov chains, an extension of …

Quantitative verification tools compute probabilities, expected rewards, or steady-state
values for formal models of stochastic and timed systems. Exact results often cannot be …

Verifying temporal properties of quantum systems, including quantum Markov chains
(QMCs), has attracted an increasing interest in the last decade. Typically, the properties are …

Model checking is a well-established and widely adopted framework used to verify whether
a given system satisfies the desired properties. Properties are usually given by means of …

Verifying quantum systems has attracted a lot of interests in the last decades. In this paper,
we initialised the model checking of quantum continuous-time Markov chain (QCTMC). As a …

Constrained reachability is a kind of quantitative path property, which is generally specified
by multiphase until formulas originated in continuous stochastic logic. In this paper, through …

Reachability analysis plays a central role in system design and verification. The reachability
problem, denoted◊ jΦ, asks whether the system will meet the property Φ after some time in a …