Abstract
Grover's search algorithm is designed to be executed on a quantum mechanical
computer. In this paper, 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 modelling this and other
quantum algorithms and that it also provides a systematic framework of
analysing such algorithms.
Original language | Undefined |
---|---|
Pages (from-to) | 417-429 |
Number of pages | 13 |
Journal | ACM Transactions on Programming Languages and Systems (TOPLAS) |
Volume | 21 |
Issue number | 3 |
DOIs | |
Publication status | Published - May 1999 |
Keywords
- EWI-1008
- IR-55691