Analogies and differences between quantum and stochastic automata
We analyze some features of the behaviour of quantum automata, providing analogies and differences with the corresponding stochastic models. In particular, we prove: •there is a quantum automaton where the change of state depends on unitary transformations defined by matrices with nonnull amplitudes...
Gespeichert in:
| Veröffentlicht in: | Theoretical computer science 2001-07, Vol.262 (1-2), p.69-81 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 81 |
|---|---|
| container_issue | 1-2 |
| container_start_page | 69 |
| container_title | Theoretical computer science |
| container_volume | 262 |
| creator | Bertoni, Alberto Carpentieri, Marco |
| description | We analyze some features of the behaviour of quantum automata, providing analogies and differences with the corresponding stochastic models. In particular, we prove: •there is a quantum automaton where the change of state depends on unitary transformations defined by matrices with nonnull amplitudes that accepts a non regular language with cut point zero and inverse error polynomially bounded,•stochastic automata with matrices having nonnull elements and with polynomial bounds on the inverse error recognize only regular languages,•the class of stochastic languages contains the class of quantum languages,•quantum languages are empty or contain an infinite number of words,•the class of quantum languages is not closed under complementation. |
| doi_str_mv | 10.1016/S0304-3975(00)00154-7 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_26828898</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0304397500001547</els_id><sourcerecordid>26828898</sourcerecordid><originalsourceid>FETCH-LOGICAL-c414t-384408c9399c3d4d4a77cb8bfb36562a65a1c3f1d580c8984f88e168919cc0ef3</originalsourceid><addsrcrecordid>eNqFkMtKxDAUhoMoOI4-gtCFiC6qSZu0yUqGwRsMuFDXIT090UgvM0mq-PZ2Log7zyYc8v35yUfIKaNXjLLi-pnmlKe5KsUFpZeUMsHTco9MmCxVmmWK75PJL3JIjkL4oOOIspiQ2awzTf_mMCSmq5PaWYseOxj3CuMXYpesBtPFod3ch9jDuwnRQWKG2LcmmmNyYE0T8GR3Tsnr3e3L_CFdPN0_zmeLFDjjMc0l51SCypWCvOY1N2UJlaxslReiyEwhDIPcslpIClJJbqVEVkjFFABFm0_J-fbdpe9XA4aoWxcAm8Z02A9BZ4XM5BgcQbEFwfcheLR66V1r_LdmVK-F6Y0wvbahKdUbYbocc2e7AhPANNabDlz4E1ZCCT5iN1sMx89-OvQ6gFsbq51HiLru3T9FPw6xfvE</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>26828898</pqid></control><display><type>article</type><title>Analogies and differences between quantum and stochastic automata</title><source>Elsevier ScienceDirect Journals</source><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>Bertoni, Alberto ; Carpentieri, Marco</creator><creatorcontrib>Bertoni, Alberto ; Carpentieri, Marco</creatorcontrib><description>We analyze some features of the behaviour of quantum automata, providing analogies and differences with the corresponding stochastic models. In particular, we prove: •there is a quantum automaton where the change of state depends on unitary transformations defined by matrices with nonnull amplitudes that accepts a non regular language with cut point zero and inverse error polynomially bounded,•stochastic automata with matrices having nonnull elements and with polynomial bounds on the inverse error recognize only regular languages,•the class of stochastic languages contains the class of quantum languages,•quantum languages are empty or contain an infinite number of words,•the class of quantum languages is not closed under complementation.</description><identifier>ISSN: 0304-3975</identifier><identifier>EISSN: 1879-2294</identifier><identifier>DOI: 10.1016/S0304-3975(00)00154-7</identifier><identifier>CODEN: TCSCDI</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Applied sciences ; Automata ; Automata. Abstract machines. Turing machines ; Computer science; control theory; systems ; Exact sciences and technology ; Formal power series ; Quantum computing ; Theoretical computing</subject><ispartof>Theoretical computer science, 2001-07, Vol.262 (1-2), p.69-81</ispartof><rights>2001</rights><rights>2001 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c414t-384408c9399c3d4d4a77cb8bfb36562a65a1c3f1d580c8984f88e168919cc0ef3</citedby><cites>FETCH-LOGICAL-c414t-384408c9399c3d4d4a77cb8bfb36562a65a1c3f1d580c8984f88e168919cc0ef3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/S0304-3975(00)00154-7$$EHTML$$P50$$Gelsevier$$Hfree_for_read</linktohtml><link.rule.ids>314,777,781,3537,27905,27906,45976</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1095954$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Bertoni, Alberto</creatorcontrib><creatorcontrib>Carpentieri, Marco</creatorcontrib><title>Analogies and differences between quantum and stochastic automata</title><title>Theoretical computer science</title><description>We analyze some features of the behaviour of quantum automata, providing analogies and differences with the corresponding stochastic models. In particular, we prove: •there is a quantum automaton where the change of state depends on unitary transformations defined by matrices with nonnull amplitudes that accepts a non regular language with cut point zero and inverse error polynomially bounded,•stochastic automata with matrices having nonnull elements and with polynomial bounds on the inverse error recognize only regular languages,•the class of stochastic languages contains the class of quantum languages,•quantum languages are empty or contain an infinite number of words,•the class of quantum languages is not closed under complementation.</description><subject>Applied sciences</subject><subject>Automata</subject><subject>Automata. Abstract machines. Turing machines</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Formal power series</subject><subject>Quantum computing</subject><subject>Theoretical computing</subject><issn>0304-3975</issn><issn>1879-2294</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2001</creationdate><recordtype>article</recordtype><recordid>eNqFkMtKxDAUhoMoOI4-gtCFiC6qSZu0yUqGwRsMuFDXIT090UgvM0mq-PZ2Log7zyYc8v35yUfIKaNXjLLi-pnmlKe5KsUFpZeUMsHTco9MmCxVmmWK75PJL3JIjkL4oOOIspiQ2awzTf_mMCSmq5PaWYseOxj3CuMXYpesBtPFod3ch9jDuwnRQWKG2LcmmmNyYE0T8GR3Tsnr3e3L_CFdPN0_zmeLFDjjMc0l51SCypWCvOY1N2UJlaxslReiyEwhDIPcslpIClJJbqVEVkjFFABFm0_J-fbdpe9XA4aoWxcAm8Z02A9BZ4XM5BgcQbEFwfcheLR66V1r_LdmVK-F6Y0wvbahKdUbYbocc2e7AhPANNabDlz4E1ZCCT5iN1sMx89-OvQ6gFsbq51HiLru3T9FPw6xfvE</recordid><startdate>20010706</startdate><enddate>20010706</enddate><creator>Bertoni, Alberto</creator><creator>Carpentieri, Marco</creator><general>Elsevier B.V</general><general>Elsevier</general><scope>6I.</scope><scope>AAFTH</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20010706</creationdate><title>Analogies and differences between quantum and stochastic automata</title><author>Bertoni, Alberto ; Carpentieri, Marco</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c414t-384408c9399c3d4d4a77cb8bfb36562a65a1c3f1d580c8984f88e168919cc0ef3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2001</creationdate><topic>Applied sciences</topic><topic>Automata</topic><topic>Automata. Abstract machines. Turing machines</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Formal power series</topic><topic>Quantum computing</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bertoni, Alberto</creatorcontrib><creatorcontrib>Carpentieri, Marco</creatorcontrib><collection>ScienceDirect Open Access Titles</collection><collection>Elsevier:ScienceDirect:Open Access</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Theoretical computer science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bertoni, Alberto</au><au>Carpentieri, Marco</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Analogies and differences between quantum and stochastic automata</atitle><jtitle>Theoretical computer science</jtitle><date>2001-07-06</date><risdate>2001</risdate><volume>262</volume><issue>1-2</issue><spage>69</spage><epage>81</epage><pages>69-81</pages><issn>0304-3975</issn><eissn>1879-2294</eissn><coden>TCSCDI</coden><abstract>We analyze some features of the behaviour of quantum automata, providing analogies and differences with the corresponding stochastic models. In particular, we prove: •there is a quantum automaton where the change of state depends on unitary transformations defined by matrices with nonnull amplitudes that accepts a non regular language with cut point zero and inverse error polynomially bounded,•stochastic automata with matrices having nonnull elements and with polynomial bounds on the inverse error recognize only regular languages,•the class of stochastic languages contains the class of quantum languages,•quantum languages are empty or contain an infinite number of words,•the class of quantum languages is not closed under complementation.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/S0304-3975(00)00154-7</doi><tpages>13</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0304-3975 |
| ispartof | Theoretical computer science, 2001-07, Vol.262 (1-2), p.69-81 |
| issn | 0304-3975 1879-2294 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_26828898 |
| source | Elsevier ScienceDirect Journals; Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals |
| subjects | Applied sciences Automata Automata. Abstract machines. Turing machines Computer science control theory systems Exact sciences and technology Formal power series Quantum computing Theoretical computing |
| title | Analogies and differences between quantum and stochastic automata |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-18T07%3A06%3A32IST&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=Analogies%20and%20differences%20between%20quantum%20and%20stochastic%20automata&rft.jtitle=Theoretical%20computer%20science&rft.au=Bertoni,%20Alberto&rft.date=2001-07-06&rft.volume=262&rft.issue=1-2&rft.spage=69&rft.epage=81&rft.pages=69-81&rft.issn=0304-3975&rft.eissn=1879-2294&rft.coden=TCSCDI&rft_id=info:doi/10.1016/S0304-3975(00)00154-7&rft_dat=%3Cproquest_cross%3E26828898%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=26828898&rft_id=info:pmid/&rft_els_id=S0304397500001547&rfr_iscdi=true |