Programming Research Group
Research ReportRR-03-06
Epistemic motion in quantum searching
Keye Martin
March 2003, 19pp.
Abstract
We formalize elementary kinematics of motion on domains with measurements,
and then use these ideas to calculate the complexity of Grover's algorithm
for quantum searching. In particular, it is now possible to analyze
classical and quantum searching in a single semantic framework.
This paper is available as a 109381 bytes gzipped PostScript file.
|
![[Oxford Spires]](/im/spires.gif){kind=small}
oucl