Reversible Simulation of Irreversible Computation by Pebble Games

@article{Li1997ReversibleSO,
  title={Reversible Simulation of Irreversible Computation by Pebble Games},
  author={Ming Li and John Tromp and Paul M. B. Vit{\'a}nyi},
  journal={ArXiv},
  year={1997},
  volume={quant-ph/9703009}
}
  • Ming Li, John Tromp, Paul M. B. Vitányi
  • Published in ArXiv 1997
  • Mathematics, Computer Science, Physics
  • Abstract Computer computations are generally irreversible while the laws of physics are reversible. This mismatch is penalized by among other things generating excess thermic entropy in the computation. Computing performance has improved to the extent that efficiency degrades unless all algorithms are executed reversibly, for example by a universal reversible simulation of irreversible computations. All known reversible simulations are either space hungry or time hungry. The leanest method was… CONTINUE READING

    Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-7 OF 7 CITATIONS

    Just a Pebble Game

    • Siu Man Chan
    • Mathematics, Computer Science
    • 2013 IEEE Conference on Computational Complexity
    • 2013
    VIEW 1 EXCERPT
    CITES BACKGROUND

    Pebble games and complexity

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Universal test set for bridging fault detection in reversible circuit

    Linear programs in a simple reversible language

    Quantum Reversibility and a New Model of Quantum Automaton

    VIEW 2 EXCERPTS
    CITES BACKGROUND

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 11 REFERENCES

    Time/Space Trade-Offs for Reversible Computation

    VIEW 8 EXCERPTS
    HIGHLY INFLUENTIAL

    Logical reversibility of computation

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    A fast quantum mechanical algorithm for database search

    VIEW 1 EXCERPT

    Reversibility and adiabatic computation: trading time and space for energy

    • Ming Li, Paul M. B. Vitányi
    • Mathematics, Computer Science, Physics
    • Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
    • 1996
    VIEW 3 EXCERPTS

    A Note on Bennett's Time-Space Tradeoff for Reversible Computation

    VIEW 1 EXCERPT

    Illinois Press

    • J. von Neumann. Theory of Self-Reproducing Automata. Burks, Ed., Univ
    • Urbana,
    • 1966
    VIEW 1 EXCERPT

    Machines de Turing réversibles. Récursive insolubilité en n ∈ N de l'´ equation u = θ n , o` u θ est un " isomorphisme de codes

    • Y Lecerf, Lecerf
    • Comptes Rendus
    • 1963
    VIEW 1 EXCERPT

    Shor , Algorithms for quantum computation : Discrete log and factoring

    • P.
    • Proc . 35 th IEEE Symposium on Foundations of Computer Science