We demonstrate a new unification of probability with standard computation in which a nonzero chance of disaster is treated as disaster. Laws and a Galois connection with the more traditional probabilistic model are provided. Reversibility in the probabilistic guarded-command language is discussed. Finally the formalism is applied to unify quantum computation and cryptography within the probabilistic method.
KeywordsQuantum Computation Transformer Model Quantum Channel Relational Semantic Semantic Model
Unable to display preview. Download preview PDF.
- [BB84]Bennett, C.H., Brassard, G.: Quantum cryptography: public key distribution and coin tossing. In: Proc. IEEE Conference on Computers, Systems and Signal processing, Bangalore, pp. 175–179 (1984)Google Scholar
- [G96]Grover, L.: A fast quantum mechanical algorithm for database search. In: Proceedings of 28th ACM STOC, pp. 212–219 (1996)Google Scholar
- [G99]Gruska, J.: Quantum Computing. Advanced Topics in Computer Science. McGraw-Hill International, UK (1999)Google Scholar
- [HH98]Hoare, C.A.R., He, J.: Unifying Theories of Programming. Prentice Hall, Englewood Cliffs (1998)Google Scholar
- [L61]Landauer, R.: Irreversibility and heat generated in the computing process. IBM Journal of Research and Development 5 (1961)Google Scholar
- [MM05]McIver, A.K., Morgan, C.C.: Abstraction, Refinement and Proof for Probabilistic Systems. Springer Monographs in Computer Science (2005)Google Scholar