Reasoning about Grover's Quantum Search Algorithm using Probabilistic wp

M.J. Butler, Pieter H. Hartel

    Research output: Contribution to journalArticleAcademicpeer-review

    10 Citations (Scopus)
    18 Downloads (Pure)

    Abstract

    Grover's search algorithm is designed to be executed on a quantum mechanical computer. In this paper, the probabilistic wp-calculus is used to model and reason about Grover's algorithm. It is demonstrated that the calculus provides a rigorous programming notation for modelling this and other quantum algorithms and that it also provides a systematic framework of analysing such algorithms.
    Original languageUndefined
    Pages (from-to)417-429
    Number of pages13
    JournalACM Transactions on Programming Languages and Systems (TOPLAS)
    Volume21
    Issue number3
    DOIs
    Publication statusPublished - May 1999

    Keywords

    • EWI-1008
    • IR-55691

    Cite this