English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We study expected runtimes for quantum programs. Inspired by recent work onprobabilistic programs, we first define expected runtime as a generalisation ofquantum weakest precondition. Then, we show that the expected runtime of aquantum program can be represented as the expectation of an observable (inphysics). A method for computing the expected runtimes of quantum programs infinite-dimensional state spaces is developed. Several examples are provided asapplications of this method, including computing the expected runtime ofquantum Bernoulli Factory -- a quantum algorithm for generating random numbers.In particular, using our new method, an open problem of computing the expectedruntime of quantum random walks introduced by Ambainis et al. (STOC 2001) issolved.

Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum Programs (Extended Version)