Toggle Main Menu Toggle Search

ePrints

A formal derivation of Grover's quantum search algorithm

Lookup NU author(s): Dr Paolo Zuliani

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


Abstract

In this paper we aim at applying established formal methods techniques to a recent software area: quantum programming. In particular, we aim at providing a stepwise derivation of Grover's quantum search algorithm. Our work shows that, in principle, traditional software engineering techniques such as specification and refinement can be applied to quantum programs. We have chosen Grover's algorithm as an example because it is one of the two main quantum algorithms. The algorithm can find with high probability an element in an unordered array of length L in just O(radicL) steps (while any classical probabilistic algorithm needs Omega(L) steps). The derivation starts from a rigorous probabilistic specification of the search problem, then we stepwise refine that specification via standard refinement laws and quantum laws, until we arrive at a quantum program. The final program will thus be correct by construction.


Publication metadata

Author(s): Zuliani P

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: 1st Joint Symposium on Theoretical Aspects of Software Engineering (TASE)

Year of Conference: 2007

Pages: 67-74

ISSN: 9780769528564

Publisher: IEEE

URL: http://dx.doi.org/10.1109/TASE.2007.3

DOI: 10.1109/TASE.2007.3


Share