Quantum versus Classical Pushdown Automata in Exact Computation

Quantum versus Classical Pushdown Automata in Exact Computation

Even though quantum computation is useful for solving certain problems, classical computation is more powerful in some cases. Thus, it is significant to compare the abilities of quantum computation and its classical counterpart, based on such a simple computation model as automata. In this paper we...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IPSJ Digital Courier 2005, Vol.1, pp.426-435
Hauptverfasser: Murakami, Yumiko, Nakanishi, Masaki, Yamashita, Shigeru, Watanabe, Katsumasa
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 435
container_issue
container_start_page 426
container_title IPSJ Digital Courier
container_volume 1
creator Murakami, Yumiko
Nakanishi, Masaki
Yamashita, Shigeru
Watanabe, Katsumasa
description Even though quantum computation is useful for solving certain problems, classical computation is more powerful in some cases. Thus, it is significant to compare the abilities of quantum computation and its classical counterpart, based on such a simple computation model as automata. In this paper we focus on the quantum pushdown automata which were defined by Golovkins in 2000, who showed that the class of languages recognized by quantum pushdown automata properly contains the class of languages recognized by finite automata. However, no one knows the entire relationship between the recognitive abilities of quantum and classical pushdown automata. As a part, we show a proposition that quantum pushdown automata can deterministically solve a certain problem that cannot be solved by any deterministic pushdown automata.
doi_str_mv 10.2197/ipsjdc.1.426
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_1441327778</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3096203381</sourcerecordid><originalsourceid>FETCH-LOGICAL-c3706-96dc6d599aabecaf81dd4e9445232dbdae123766ac106d4df1d3e7e43a6078643</originalsourceid><addsrcrecordid>eNpNkNtKAzEQhoMoWKt3PsCCt25NNmmyudKy1AMUVNDrME2ydpc9mYOHt3e1Ur0YZuD_ZgY-hE4JnmVEiotq8LXRMzJjGd9DE0KZTAWb8_1_8yE68r7GmOcykxN0-RihC7FN3qzz0SdFA95XGprkIfqN6d-7ZBFD30KApOqS5QfokBR9O8QAoeq7Y3RQQuPtyW-foufr5VNxm67ub-6KxSrVVGCeSm40N3MpAdZWQ5kTY5iVjM0zmpm1AUsyKjgHTTA3zJTEUCsso8CxyDmjU3S2vTu4_jVaH1TdR9eNLxVhjNBMCJGP1PmW0q733tlSDa5qwX0qgtW3IrVVpIgaFY341RavfYAXu4PBhUo39g_GPzWu7CK9AadsR78AgGlytg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1441327778</pqid></control><display><type>article</type><title>Quantum versus Classical Pushdown Automata in Exact Computation</title><source>J-STAGE Free</source><source>EZB-FREE-00999 freely available EZB journals</source><creator>Murakami, Yumiko ; Nakanishi, Masaki ; Yamashita, Shigeru ; Watanabe, Katsumasa</creator><creatorcontrib>Murakami, Yumiko ; Nakanishi, Masaki ; Yamashita, Shigeru ; Watanabe, Katsumasa</creatorcontrib><description>Even though quantum computation is useful for solving certain problems, classical computation is more powerful in some cases. Thus, it is significant to compare the abilities of quantum computation and its classical counterpart, based on such a simple computation model as automata. In this paper we focus on the quantum pushdown automata which were defined by Golovkins in 2000, who showed that the class of languages recognized by quantum pushdown automata properly contains the class of languages recognized by finite automata. However, no one knows the entire relationship between the recognitive abilities of quantum and classical pushdown automata. As a part, we show a proposition that quantum pushdown automata can deterministically solve a certain problem that cannot be solved by any deterministic pushdown automata.</description><identifier>ISSN: 1349-7456</identifier><identifier>EISSN: 1349-7456</identifier><identifier>DOI: 10.2197/ipsjdc.1.426</identifier><language>eng</language><publisher>Tokyo: Information Processing Society of Japan</publisher><ispartof>IPSJ Digital Courier, 2005, Vol.1, pp.426-435</ispartof><rights>2005 by the Information Processing Society of Japan</rights><rights>Copyright Japan Science and Technology Agency 2005</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c3706-96dc6d599aabecaf81dd4e9445232dbdae123766ac106d4df1d3e7e43a6078643</citedby><cites>FETCH-LOGICAL-c3706-96dc6d599aabecaf81dd4e9445232dbdae123766ac106d4df1d3e7e43a6078643</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,1882,4023,27922,27923,27924</link.rule.ids></links><search><creatorcontrib>Murakami, Yumiko</creatorcontrib><creatorcontrib>Nakanishi, Masaki</creatorcontrib><creatorcontrib>Yamashita, Shigeru</creatorcontrib><creatorcontrib>Watanabe, Katsumasa</creatorcontrib><title>Quantum versus Classical Pushdown Automata in Exact Computation</title><title>IPSJ Digital Courier</title><addtitle>ipsjdc</addtitle><description>Even though quantum computation is useful for solving certain problems, classical computation is more powerful in some cases. Thus, it is significant to compare the abilities of quantum computation and its classical counterpart, based on such a simple computation model as automata. In this paper we focus on the quantum pushdown automata which were defined by Golovkins in 2000, who showed that the class of languages recognized by quantum pushdown automata properly contains the class of languages recognized by finite automata. However, no one knows the entire relationship between the recognitive abilities of quantum and classical pushdown automata. As a part, we show a proposition that quantum pushdown automata can deterministically solve a certain problem that cannot be solved by any deterministic pushdown automata.</description><issn>1349-7456</issn><issn>1349-7456</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2005</creationdate><recordtype>article</recordtype><recordid>eNpNkNtKAzEQhoMoWKt3PsCCt25NNmmyudKy1AMUVNDrME2ydpc9mYOHt3e1Ur0YZuD_ZgY-hE4JnmVEiotq8LXRMzJjGd9DE0KZTAWb8_1_8yE68r7GmOcykxN0-RihC7FN3qzz0SdFA95XGprkIfqN6d-7ZBFD30KApOqS5QfokBR9O8QAoeq7Y3RQQuPtyW-foufr5VNxm67ub-6KxSrVVGCeSm40N3MpAdZWQ5kTY5iVjM0zmpm1AUsyKjgHTTA3zJTEUCsso8CxyDmjU3S2vTu4_jVaH1TdR9eNLxVhjNBMCJGP1PmW0q733tlSDa5qwX0qgtW3IrVVpIgaFY341RavfYAXu4PBhUo39g_GPzWu7CK9AadsR78AgGlytg</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Murakami, Yumiko</creator><creator>Nakanishi, Masaki</creator><creator>Yamashita, Shigeru</creator><creator>Watanabe, Katsumasa</creator><general>Information Processing Society of Japan</general><general>Japan Science and Technology Agency</general><scope>AAYXX</scope><scope>CITATION</scope><scope>JQ2</scope></search><sort><creationdate>2005</creationdate><title>Quantum versus Classical Pushdown Automata in Exact Computation</title><author>Murakami, Yumiko ; Nakanishi, Masaki ; Yamashita, Shigeru ; Watanabe, Katsumasa</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c3706-96dc6d599aabecaf81dd4e9445232dbdae123766ac106d4df1d3e7e43a6078643</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2005</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Murakami, Yumiko</creatorcontrib><creatorcontrib>Nakanishi, Masaki</creatorcontrib><creatorcontrib>Yamashita, Shigeru</creatorcontrib><creatorcontrib>Watanabe, Katsumasa</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Computer Science Collection</collection><jtitle>IPSJ Digital Courier</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Murakami, Yumiko</au><au>Nakanishi, Masaki</au><au>Yamashita, Shigeru</au><au>Watanabe, Katsumasa</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Quantum versus Classical Pushdown Automata in Exact Computation</atitle><jtitle>IPSJ Digital Courier</jtitle><addtitle>ipsjdc</addtitle><date>2005</date><risdate>2005</risdate><volume>1</volume><spage>426</spage><epage>435</epage><pages>426-435</pages><issn>1349-7456</issn><eissn>1349-7456</eissn><abstract>Even though quantum computation is useful for solving certain problems, classical computation is more powerful in some cases. Thus, it is significant to compare the abilities of quantum computation and its classical counterpart, based on such a simple computation model as automata. In this paper we focus on the quantum pushdown automata which were defined by Golovkins in 2000, who showed that the class of languages recognized by quantum pushdown automata properly contains the class of languages recognized by finite automata. However, no one knows the entire relationship between the recognitive abilities of quantum and classical pushdown automata. As a part, we show a proposition that quantum pushdown automata can deterministically solve a certain problem that cannot be solved by any deterministic pushdown automata.</abstract><cop>Tokyo</cop><pub>Information Processing Society of Japan</pub><doi>10.2197/ipsjdc.1.426</doi><tpages>10</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1349-7456
ispartof IPSJ Digital Courier, 2005, Vol.1, pp.426-435
issn 1349-7456
1349-7456
language eng
recordid cdi_proquest_journals_1441327778
source J-STAGE Free; EZB-FREE-00999 freely available EZB journals
title Quantum versus Classical Pushdown Automata in Exact Computation
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T17%3A34%3A59IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Quantum%20versus%20Classical%20Pushdown%20Automata%20in%20Exact%20Computation&rft.jtitle=IPSJ%20Digital%20Courier&rft.au=Murakami,%20Yumiko&rft.date=2005&rft.volume=1&rft.spage=426&rft.epage=435&rft.pages=426-435&rft.issn=1349-7456&rft.eissn=1349-7456&rft_id=info:doi/10.2197/ipsjdc.1.426&rft_dat=%3Cproquest_cross%3E3096203381%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1441327778&rft_id=info:pmid/&rfr_iscdi=true