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.
![[file icon]](http://eprints.soton.ac.uk/style/images/fileicons/application_postscript.png) | Postscript 248Kb |
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 |
|---|---|
| ISSN: | 0164-0925 |
| Divisions: | Faculty of Physical and Applied Science > Electronics and Computer Science > Electronic & Software Systems |
| ePrint ID: | 250484 |
| Deposited On: | 30 Sep 1999 |
| Last Modified: | 01 Mar 2012 10:18 |
| Further Information: | Google Scholar |
Associated Staff Only: edit my ePrint
