Abstract
We examine some variants of computation with closed timelike curves (CTCs), where various restrictions are imposed on the memory of the computer, and the information carrying capacity and range of the CTC. We give full characterizations of the classes of languages recognized by polynomial time probabilistic and quantum computers that can send a single classical bit to their own past. Such narrow CTCs are demonstrated to add the power of limited nondeterminism to deterministic computers, and lead to exponential speedup in constant-space probabilistic and quantum computation.
This work was partially supported by the Scientific and Technological Research Council of Turkey (TÜBİTAK) with grant 108E142.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aaronson, S.: Quantum computing, postselection, and probabilistic polynomial-time. Proceedings of the Royal Society A 461(2063), 3473–3482 (2005)
Ambainis, A., Watrous, J.: Two–way finite automata with quantum and classical states. Theoretical Computer Science 287(1), 299–311 (2002)
Aaronson, S., Watrous, J.: Closed timelike curves make quantum and classical computing equivalent. Proceedings of the Royal Society A 465(2102), 631–647 (2009)
Bacon, D.: Quantum computational complexity in the presence of closed timelike curves. Physical Review A 70(032309) (2004)
Deutsch, D.: Quantum mechanics near closed timelike lines. Physical Review D 44(10), 3197–3217 (1991)
Dwork, C., Stockmeyer, L.: Finite state verifiers I: The power of interaction. Journal of the ACM 39(4), 800–828 (1992)
Freivalds, R.: Probabilistic two-way machines. In: Gruska, J., Chytil, M.P. (eds.) MFCS 1981. LNCS, vol. 118, pp. 33–45. Springer, Heidelberg (1981)
Gray, J.N., Harrison, M.A., Ibarra, O.H.: Two-way pushdown automata. Information and Control 11, 30–70 (1967)
Greenberg, A.G., Weiss, A.: A lower bound for probabilistic algorithms for finite state machines. Journal of Computer and System Sciences 33(1), 88–105 (1986)
Herzog, C.: Pushdown automata with bounded nondeterminism and bounded ambiguity. Theoretical Computer Science 181, 141–157 (1997)
Morris, M.S., Thorne, K.S., Yurtsever, U.: Wormholes, time machines, and the weak energy condition. Physical Review Letters 61(13), 1446–1449 (1988)
Shepherdson, J.C.: The reduction of two–way automata to one-way automata. IBM Journal of Research and Development 3, 198–200 (1959)
Sipser, M.: Introduction to the Theory of Computation, 2nd edn. Thomson Course Technology, United States of America (2006)
Say, A.C.C., Yakaryılmaz, A.: Computation with narrow CTCs. Technical Report arXiv:1007.3624 (2011)
Yakaryılmaz, A., Say, A.C.C.: Succinctness of two-way probabilistic and quantum finite automata. Discrete Mathematics and Theoretical Computer Science 12(4), 19–40 (2010)
Yakaryılmaz, A., Say, A.C.C.: Probabilistic and quantum finite automata with postselection. Technical Report arXiv:1102.0666 (2011)
Yakaryılmaz, A., Say, A.C.C.: Unbounded-error quantum computation with small space bounds. Information and Computation 279(6), 873–892 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Say, A.C.C., Yakaryılmaz, A. (2011). Computation with Narrow CTCs. In: Calude, C.S., Kari, J., Petre, I., Rozenberg, G. (eds) Unconventional Computation. UC 2011. Lecture Notes in Computer Science, vol 6714. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21341-0_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-21341-0_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21340-3
Online ISBN: 978-3-642-21341-0
eBook Packages: Computer ScienceComputer Science (R0)