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.
Download
![[img]](http://eprints.soton.ac.uk/style/images/fileicons/application_postscript.png) |
Postscript
Download (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 |
|---|---|
| ISSNs: | 0164-0925 |
| Divisions: | Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Electronic & Software Systems |
| Item ID: | 250484 |
| Date Deposited: | 30 Sep 1999 |
| Last Modified: | 01 Mar 2012 10:18 |
| Contributors: | Butler, M. J. (Author) Hartel, P. H. (Author) |
| Date: | May 1999 |
| Status: | Published |
| Further Information: | Google Scholar |
| ISI Citation Count: | 8 |
| URI: | http://eprints.soton.ac.uk/id/eprint/250484 |
Actions (login required)
 |
View Item |
