Reasoning about Grover's Quantum Search Algorithm using Probabilistic wp

Butler, M. J. and Hartel, P. H. (1999) Reasoning about Grover's Quantum Search Algorithm using Probabilistic wp. ACM Transactions on Programming Languages and Systems, 21, (3), 417-430.


[img] Postscript
Download (248Kb)


Grover's search algorithm is designed to be executed on a quantum-mechanical computer. In this article, 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 modeling this and other quantum algorithms and that it also provides a systematic framework of analyzing such algorithms.

Item Type: Article
ISSNs: 0164-0925
Divisions : Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Electronic & Software Systems
ePrint ID: 250484
Accepted Date and Publication Date:
May 1999Published
Date Deposited: 30 Sep 1999
Last Modified: 31 Mar 2016 13:50
Further Information:Google Scholar

Actions (login required)

View Item View Item

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics