Programming Research Group LOGICAL REVERSIBILITY
Abstract:
A technique is developed that transforms any program in the probabilistic Guarded Command Language (pGCL) into an equivalent but reversible program. The result extends previous works rstly by considering a general purpose programming language (pGCL), and secondly by dealing with \demonic " nondeterminism and probability. A formal denition of logical reversibility is given and the expectationtransformer semantics for pGCL is used to prove the result. The technique presented has a direct application in the compilation of a general purpose programming language for quantum computation. 1
Citations
| 324 | Quantum theory, the Church-Turing principle and the universal quantum computer – Deutsch - 1985 |
| 278 | Guarded commands, nondeterminacy, and formal derivation of programs – Dijkstra - 1975 |
| 255 | Local reversibility of computations – Bennett - 1973 |
| 149 | Irreversibility and heat generation in the computing process – Landauer |
| 37 | The Thermodynamics of Computation – a Review – Bennett - 1982 |
| 36 | Quantum programming – Sanders, Zuliani - 2000 |
| 33 | Proof rules for probabilistic loops – MORGAN - 1996 |
| 32 | Programming from Speci – Morgan - 1990 |
| 13 | Probabilistic models for the guarded command language – Jifeng, McIver, et al. - 1997 |
| 2 | Fredkin and Tommaso Tooli. Conservative logic – Edward - 1981 |
| 1 | Barenco et al. Elementary gates for quantum computation – Adriano - 1995 |
| 1 | est un isomorphisme de codes. Comptes rendus de l'Academie francaise des sciences – ou - 1973 |
| 1 | African Computer Journal – South - 1999 |

