Reasoning about Grover's quantum search algorithm using probabilistic wp

Authors:
Michael Butler;Pieter Hartel
Affiliations:
Univ. of Southampton, Southampton, UK;Univ. of Southampton, Southampton, UK
Venue:
ACM Transactions on Programming Languages and Systems (TOPLAS)
Year:
1999

Citing 6
Cited 6

Quantum complexity theory

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Programming from specifications (2nd ed.)

Programming from specifications (2nd ed.)
Probabilistic predicate transformers

ACM Transactions on Programming Languages and Systems (TOPLAS)
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Quantum computation

Complexity theory retrospective II
A Discipline of Programming

A Discipline of Programming

SIGACT news logic column 13

ACM SIGACT News
Quantum weakest preconditions

Mathematical Structures in Computer Science
Proof rules for the correctness of quantum programs

Theoretical Computer Science
Security, Probability and Nearly Fair Coins in the Cryptographers' Café

FM '09 Proceedings of the 2nd World Congress on Formal Methods
Unifying probability

UTP'06 Proceedings of the First international conference on Unifying Theories of Programming
Quantum predicative programming

MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction

Quantified Score

Hi-index	0.00

Visualization

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.