Time and Space Bounds for Reversible Simulation

We prove a general upper bound on the trade-off between time and space that suffices for the reversible simulation of irreversible computation. Previously, only simulations using exponential time or quadratic space were known. The trade-off shows for the first time that we can simultaneously achieve subexponential time and subquadratic space. The boundary values are the exponential time with hardly any extra space required by the Lange–McKenzie–Tapp method and the (log 3)th power time with square space required by the Bennett method. We also give the first general lower bound on the extra storage space required by general reversible simulation. This lower bound is optimal in that it is achieved by some reversible simulations.

[1]  Alan T. Sherman,et al.  A Note on Bennett's Time-Space Tradeoff for Reversible Computation , 1990, SIAM J. Comput..

[2]  Charles H. Bennett,et al.  The thermodynamics of computation—a review , 1982 .

[3]  Ryan Williams,et al.  Space-Efficient Reversible Simulations , 2000 .

[4]  Kenichi Morita,et al.  A 1-Tape 2-Symbol Reversible Turing Machine , 1989 .

[5]  R. Landauer,et al.  Irreversibility and heat generation in the computing process , 1961, IBM J. Res. Dev..

[6]  Michael Sipser,et al.  Halting space-bounded computations , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[7]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[8]  T. Toffoli,et al.  Conservative logic , 2002, Collision-Based Computing.

[9]  Ming Li,et al.  Reversibility and adiabatic computation: trading time and space for energy , 1996, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[10]  Charles H. Bennett.  Time/Space Trade-Offs for Reversible Computation , 1989, SIAM J. Comput..

[11]  M. E. R..  “If” , 1921, Definitions.

[12]  Pierre McKenzie,et al.  Reversible Space Equals Deterministic Space , 2000, J. Comput. Syst. Sci..

[13]  Thomas F. Knight,et al.  Reversibility in Optimally Scalable Computer Architectures , 1997 .

[14]  Ming Li,et al.  Reversible simulation of irreversible computation , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

[15]  Charles H. Bennett,et al.  Logical reversibility of computation , 1973 .

[16]  R. W. Keyes,et al.  Miniaturization of electronics and its limits , 1988, IBM J. Res. Dev..