Reasoning about Grover's Quantum Search Algorithm using Probabilistic wp

M.J. Butler, Pieter H. Hartel

    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
    StatePublished - May 1999

    Keywords

    • EWI-1008
    • IR-55691

    Cite this

    Butler, M.J.; Hartel, Pieter H. / Reasoning about Grover's Quantum Search Algorithm using Probabilistic wp.

    In: ACM Transactions on Programming Languages and Systems (TOPLAS), Vol. 21, No. 3, 05.1999, p. 417-429.

    Research output: Scientific - peer-reviewArticle

    @article{2daf706fd9084a2a88e7fb146e10f07a,
    title = "Reasoning about Grover's Quantum Search Algorithm using Probabilistic wp",
    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.",
    keywords = "EWI-1008, IR-55691",
    author = "M.J. Butler and Hartel, {Pieter H.}",
    note = "Imported from DIES",
    year = "1999",
    month = "5",
    doi = "10.1145/319301.319303",
    volume = "21",
    pages = "417--429",
    journal = "ACM Transactions on Programming Languages and Systems (TOPLAS)",
    issn = "0164-0925",
    publisher = "Association for Computing Machinery",
    number = "3",

    }

    Reasoning about Grover's Quantum Search Algorithm using Probabilistic wp. / Butler, M.J.; Hartel, Pieter H.

    In: ACM Transactions on Programming Languages and Systems (TOPLAS), Vol. 21, No. 3, 05.1999, p. 417-429.

    Research output: Scientific - peer-reviewArticle

    TY - JOUR

    T1 - Reasoning about Grover's Quantum Search Algorithm using Probabilistic wp

    AU - Butler,M.J.

    AU - Hartel,Pieter H.

    N1 - Imported from DIES

    PY - 1999/5

    Y1 - 1999/5

    N2 - 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.

    AB - 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.

    KW - EWI-1008

    KW - IR-55691

    U2 - 10.1145/319301.319303

    DO - 10.1145/319301.319303

    M3 - Article

    VL - 21

    SP - 417

    EP - 429

    JO - ACM Transactions on Programming Languages and Systems (TOPLAS)

    T2 - ACM Transactions on Programming Languages and Systems (TOPLAS)

    JF - ACM Transactions on Programming Languages and Systems (TOPLAS)

    SN - 0164-0925

    IS - 3

    ER -