Proceedings of Computational Complexity (Formerly Structure in Complexity Theory) (1996)
May 24, 1996 to May 27, 1996
Reversible simulation of irreversible algorithms is analyzed in the stylized form of a `reversible' pebble game. While such simulations incur little overhead in additional computation time, they use a large amount of additional memory space during the computation. We show that among all simulations which can be modeled by the pebble game, Bennett's simulation is optimal in that it uses the least auxiliary space for the greatest number of simulated steps. We give a trade-off of storage space versus irreversible erasure. Examples of reversible algorithms are algorithms for quantum computers.
Reversible computation, Irreversible computation, Computational energy dissipation, Reversible simulation, Storage space versus Energy Tradeoffs
M. Li and P. Vitanyi, "Reversible Simulation of Irreversible Computation," Proceedings of Computational Complexity (Formerly Structure in Complexity Theory)(CCC), Philadelphia, PA, 1996, pp. 301.