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), pp. 417-430.

Download

[img] Postscript grover.ps - Other
Download (254kB)

Description/Abstract

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
Organisations: Electronic & Software Systems
ePrint ID: 250484
Date :
Date Event
May 1999Published
Date Deposited: 30 Sep 1999
Last Modified: 18 Apr 2017 00:20
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/250484

Actions (login required)

View Item View Item