Relativized Separation of Reversible and Irreversible Space-Time Complexity Classes

TL;DR

This paper investigates the differences between reversible and irreversible space-time complexity classes, providing theoretical evidence that they are separated and analyzing the efficiency of Bennett's reduction in reversible computing.

Contribution

It offers the first oracle-relativized proof of the separation between reversible and irreversible space-time classes and establishes lower bounds for reversible simulations.

Findings

Oracle-relativized separation of complexity classes

Lower bounds on reversible simulation space complexity

Bennett's reduction minimizes space-time product in reversible computing

Abstract

Reversible computing can reduce the energy dissipation of computation, which can improve cost-efficiency in some contexts. But the practical applicability of this method depends sensitively on the space and time overhead required by reversible algorithms. Time and space complexity classes for reversible machines match conventional ones, but we conjecture that the joint space-time complexity classes are different, and that a particular reduction by Bennett minimizes the space-time product complexity of general reversible computations. We provide an oracle-relativized proof of the separation, and of a lower bound on space for linear-time reversible simulations. A non-oracle proof applies when a read-only input is omitted from the space accounting. Both constructions model one-way function iteration, conjectured to be a problem for which Bennett's algorithm is optimal.