
Runtime Analysis of Quantum Programs: A Formal Approach
In this extended abstract we provide a first step towards a tool to esti...
read it

Computing Expected Runtimes for Constant Probability Programs
We introduce the class of constant probability (CP) programs and show th...
read it

Modular Runtime Complexity Analysis of Probabilistic While Programs
We are concerned with the average case runtime complexity analysis of a ...
read it

Scientific Programs Imply Uncertainty. Results Expected and Unexpected
Science and engineering have requests for a wide variety of programs, bu...
read it

An extended quantum process algebra (eQPAlg) approach for distributed quantum systems
In this work, we have expounded the communication procedure of quantum s...
read it

Poq: Projectionbased Runtime Assertions for Debugging on a Quantum Computer
In this paper, we propose Poq, a runtime assertion scheme for debugging ...
read it

Rational proofs for quantum computing
It is an open problem whether a classical client (verifier) can delegate...
read it
Expected Runtime of Quantum Programs
Building upon recent work on probabilistic programs, we formally define the notion of expected runtime for quantum programs. A representation of the expected runtimes of quantum programs is introduced with an interpretation as an observable in physics. A method for computing the expected runtimes of quantum programs in finitedimensional state spaces is developed. Several examples are provided as applications of this method; in particular, an open problem of computing the expected runtime of quantum random walks is solved using our method.
READ FULL TEXT
Comments
There are no comments yet.