Hostname: page-component-586b7cd67f-t7czq Total loading time: 0 Render date: 2024-11-28T05:01:19.876Z Has data issue: false hasContentIssue false
  • English
  • Français

Time and space complexity of reversible pebbling

Published online by Cambridge University Press:  15 June 2004

Richard Královič
Richard Královič*
Affiliation:
Department of Computer Science, Faculty of Mathematics, Physics and Informatics, Comenius University, Mlynská Dolina, 842 48 Bratislava, Slovakia; [email protected].
Get access

Abstract

This paper investigates one possible model of reversible computations, animportant paradigm in the context of quantum computing. Introduced byBennett, a reversible pebble game is anabstraction of reversible computation that allows to examine the space andtime complexity of various classes of problems. We present a techniquefor proving lower and upper bounds on time and space complexity for severaltypes of graphs. Using this technique we show that the time needed toachieve optimal space for chain topology is Ω(nlgn) for infinitelymany n and we discusstime-space trade-offs for chain. Further we show a tight optimalspace bound for the binary tree of height h of the form h + Θ(lg*h)and discuss space complexity for the butterfly. These results give anevidence that reversible computations need more resources than standardcomputations. We also show an upper bound on time and space complexity ofthe reversible pebble game based on the time and space complexity of thestandard pebble game, regardless of the topology of the graph.

Keywords

Reversible computationspebbling.
Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 38 , Issue 2 , April 2004 , pp. 137 - 161
Copyright
© EDP Sciences, 2004

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Bennett, C.H., Time-space trade-offs for reversible computation. SIAM J. Comput. 18 (1989) 766-776. CrossRef
H. Buhrman, J. Tromp and P. Vitányi, Time and space bounds for reversible simulation, in Proc. ICALP 2001. Springer-Verlag, Lect. Notes Comput. Sci. 2076 (2001).
Levine, R.Y. and Sherman, A.T., A note on Bennett's time-space tradeoff for reversible computation. SIAM J. Comput. 19 (1990) 673-677. CrossRef
Li, M., Tromp, J. and Vitányi, P.M.B., Reversible simulation of irreversible computation. Physica D 120 (1998) 168-176. CrossRef
Li, M. and Vitányi, P.M.B., Reversibility and adiabatic computation: trading time and space for energy. Proc. Roy. Soc. Lond. Ser. A 452 (1996) 1-21. CrossRef
M. Li and P.M.B. Vitányi, Reversible simulation of irreversible computation, in Proc. 11th IEEE Conf. Computational Complexity, Philadelphia, Pennsylvania, May 24-27 (1996).
M.S. Paterson and C.E. Hewitt, Comparative Schematology, in MAC Conf. on Concurrent Systems and Parallel Computation (1970) 119-127.
P. Ružička, Pebbling – The Technique for Analysing Computation Efficiency. SOFSEM'89 (1989) 205-224.
Ružička, P. and Waczulík, J., Pebbling Dynamic Graphs in Minimal Space. RAIRO-Inf. Theor. Appl. 28 (1994) 557-565. CrossRef
Ružička, P. and Waczulík, J., Time-Space Trade-Offs, On in Dynamic Graph Pebbling. MFCS'93 711 (1993) 671-681.
R. Williams, Space-Efficient Reversible Simulations. DIMACS REU report (July 2000).
A. Zavarský, On the Cost of Reversible Computations: Time-Space Bounds on Reversible Pebbling. Manuscript (1998).