Abstract
In the context of quantum computing, reversible computations play an important role. In this paper the model of the reversible pebble game introduced by Bennett is considered. Reversible pebble game is an abstraction of a reversible computation, that allows to examine the space and time complexity for various classes of problems. We present techniques for provinglo wer and upper bounds on time and space complexity. Usingthese techniques we show a partial lower bound on time for optimal space (time for optimal space is not o(n lg n)) and a time-space tradeoff (space O(k?n) for time 2kn) for a chain of length n. Further, we show a tight optimal space bound (h+?(lg* h)) for a binary tree of height h and we discuss space complexity for a butterfly. By these results we give an evidence, that for reversible computations more resources are needed with respect to standard irreversible computations.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
