A continuous domain of classical states
Keye Martin
Abstract
We introduce an omega-continuous dcpo of classical states whose order is clearly demonstrable as a continuous form of logical implication. It has Shannon entropy as a measurement and can also be used to analyze Grover's algorithm for quantum searching. The fact that the n-simplex can be naturally given the structure of a continuous domain allows for the possibility of applying many well understood techniques in applications.
Details
| Institution |
Oxford University Computing Laboratory |
| Month |
April |
| Number |
RR−04−06 |
| Year |
2004 |