ACM Symposium on Theory of Computing (STOC)

Undecidability on quantum finite automata

Masami Amano, Kazuo Iwama

Published May 1, 1999• 53 citations

Abstract

Article Undecidability on quantum finite automata Share on Authors: Masami Amano School of Informatics, Kyoto University, Kyata 606-8501, Japan School of Informatics, Kyoto University, Kyata 606-8501, JapanView Profile , Kazuo Iwama School of Informatics, Kyoto University, Kyata 606-8501, Japan School of Informatics, Kyoto University, Kyata 606-8501, JapanView Profile Authors Info & Claims STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of ComputingMay 1999 Pages 368–375https://doi.org/10.1145/301250.301344Online:01 May 1999Publication History 23citation442DownloadsMetricsTotal Citations23Total Downloads442Last 12 Months14Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

DOI: 10.1145/301250.301344

Related papers

Automata and Quantum Computing

Andris Ambainis, Abuzer Yakaryılmaz

Quantum computing is a new model of computation, based on quantum physics. Quantum computers can be exponentially faster than conventional computers for problems such as factoring. Besides full-scale quantum computers, more restricted models such as quantum versions of finite automata have been studied. In this paper, we survey various models of quantum finite automata and their properties. We also provide some open questions and new directions for researchers. Keywords: quantum finite automata, probabilistic finite automata, nondeterminism, bounded error, unbounded error, state complexity, decidability and undecidability, computational complexity

arXiv:1507.01988Jul 7, 201516 citations

Quantum bit escrow

Dorit Aharonov, Amnon Ta‐Shma, Umesh V. Vazirani +1 more

Article Free Access Share on Quantum bit escrow Authors: Dorit Aharonov University of California, Berkeley, CA University of California, Berkeley, CAView Profile , Amnon Ta-Shma University of California, Berkeley, CA University of California, Berkeley, CAView Profile , Umesh V. Vazirani University of California, Berkeley, CA University of California, Berkeley, CAView Profile , Andrew C. Yao Princeton University, Princeton, NJ Princeton University, Princeton, NJView Profile Authors Info & Claims STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computingMay 2000 Pages 705–714https://doi.org/10.1145/335305.335404Published:01 May 2000Publication History 46citation619DownloadsMetricsTotal Citations46Total Downloads619Last 12 Months56Last 6 weeks6 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

ACM Symposium on Theory of Computing (STOC)May 1, 2000106 citations

Automata and quantum computing

Andris Ambainis, Abuzer Yakaryılmaz

EMS Press eBooksSep 13, 202133 citations

Secure computation with honest-looking parties (extended abstract)

Ran Canetti, Rafail Ostrovsky

Article Free Access Share on Secure computation with honest-looking parties (extended abstract): what if nobody is truly honest? Authors: Ran Canetti IBM T.J. Watson Research Center IBM T.J. Watson Research CenterView Profile , Rafail Ostrovsky Bell Communications Research, MCC-1C365B, 445 South Street, Morristown, New Jersey Bell Communications Research, MCC-1C365B, 445 South Street, Morristown, New JerseyView Profile Authors Info & Claims STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of ComputingMay 1999Pages 255–264https://doi.org/10.1145/301250.301313Published:01 May 1999Publication History 15citation383DownloadsMetricsTotal Citations15Total Downloads383Last 12 Months19Last 6 weeks5 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

ACM Symposium on Theory of Computing (STOC)May 1, 199918 citations

Quantum automata and quantum computing

Marats Golovkins

Quantum finite automata were introduced by C.Moore and J.P.Crutchfield in [MC 97] and by A.Kondacs and J.Watrous in [KW 97]. This notion is not a generalization of the deterministic finite automata, but rather a generalization of deterministic reversible (permutation) automata. In [AF 98] A.Ambainis and R.Freivalds raised the question what kind of probabilistic automata can be viewed as a special case of quantum finite automata. To answer that question and study relationship between quantum finite automata and probabilistic finite automata, we introduce a notion of probabilistic reversible automata (PRA, or doubly stochastic automata). We give the necessary condition for a language to be recognized by PRA. We find that there is a strong relationship between different possible models of PRA and corresponding models of quantum finite automata. In these thesis we regard quantum automata, probabilistic reversible and deterministic reversible automata as reversible automata. At least two non-equivalent definitions of language recognition are used for one-way reversible finite automata in various papers. Both of these definitions have their own advantages and disadvantages, summarized in our classification of one-way reversible automata. Further, we introduce a notion of quantum finite multitape automata and prove that there is a language recognized by a quantum finite multitape automaton but not by deterministic finite multitape automata. Additionally we discover unexpected probabilistic automata recognizing complicated languages. Finally, we revise the concept of quantum pushdown automata (QPA), first introduced by C.Moore and J.P.Cruthchfield in [MC 97]. We give the definition of QPA in a non-equivalent way, including unitarity criteria, by using the definition of quantum finite automata of [KW 97]. It is established that the unitary criteria of QPA are not equivalent to the corresponding unitary criteria of quantum Turing machines [BV 97]. We show that QPA can recognize every regular language. We also present some simple non-context-free languages recognized by QPA (hence not recognizable by deterministic and nondeterministic pushdown automata).

Jan 1, 20020 citations

Quantum computation and quantum communication: theory and experiments Author of book: Mladen Pavicic

George Hacken

review-article Share on Quantum computation and quantum communication: theory and experiments Author of book: Mladen Pavicic Author: George Hacken View Profile Authors Info & Claims ACM SIGACT NewsVolume 40Issue 4December 2009 pp 10–14https://doi.org/10.1145/1711475.1711478Published:25 January 2010Publication History 0citation172DownloadsMetricsTotal Citations0Total Downloads172Last 12 Months4Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

ACM SIGACT NewsJan 25, 20100 citations