Reasoning about Grover's Quantum Search Algorithm using Probabilistic wp

Simple item page
dc.creatorButler, Michael
dc.creatorHartel, Pieter
dc.date1998-10-22
dc.date.accessioned2026-07-07T06:15:45Z
dc.date.available2026-07-07T06:15:45Z
dc.descriptionGrover'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.
dc.description11 pages, 5 Postscript figures
dc.identifierhttps://arxiv.org/abs/quant-ph/9810066
dc.identifierhttp://arxiv.org/abs/quant-ph/9810066
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/93855
dc.subjectQuantum Physics
dc.titleReasoning about Grover's Quantum Search Algorithm using Probabilistic wp
dc.typetext

Files

Collections

arXiv