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 (TOPLAS), 21 (3). pp. 417-429. ISSN 0164-0925

PDF
Restricted to UT campus only: Request a copy
201Kb

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
Copyright:	© 1999 ACM
Link to this item:	http://purl.utwente.nl/publications/55691
Official URL:	http://dx.doi.org/10.1145/319301.319303
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page