On the simulation of quantum turing machines
In this article we shall review several basic definitions and results regarding quantum computation. In particular, after defining Quantum Turing Machines and networks the paper contains an exposition on continued fractions and on errors in quantum networks. The topic of simulation of Quantum Turing...
Gespeichert in:
| Veröffentlicht in: | Theoretical computer science 2003-07, Vol.304 (1-3), p.103-128 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 128 |
|---|---|
| container_issue | 1-3 |
| container_start_page | 103 |
| container_title | Theoretical computer science |
| container_volume | 304 |
| creator | Carpentieri, Marco |
| description | In this article we shall review several basic definitions and results regarding quantum computation. In particular, after defining Quantum Turing Machines and networks the paper contains an exposition on continued fractions and on errors in quantum networks. The topic of simulation of Quantum Turing Machines by means of obvious computation is introduced. We give a full discussion of the simulation of multitape Quantum Turing Machines in a slight generalization of the class introduced by Bernstein and Vazirani. As main result we show that the Fisher-Pippenger technique can be used to give an O(tlogt) simulation of a multi-tape Quantum Turing Machine by another belonging to the extended Bernstein and Vazirani class. This result, even if regarding a slightly restricted class of Quantum Turing Machines improves the simulation results currently known in the literature. |
| doi_str_mv | 10.1016/S0304-3975(03)00054-9 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_27905311</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0304397503000549</els_id><sourcerecordid>27905311</sourcerecordid><originalsourceid>FETCH-LOGICAL-c316t-469587bb7916cf339ed4c021e19e1ecbf20c22cc9f8f73085ff2707d14d3c8993</originalsourceid><addsrcrecordid>eNqFkEtLxDAUhYMoOI7-BKEbRcFqXm2alcjgCwZmoa5D5vZGI22qSSv4753ODLp0dTffPYfzEXLM6CWjrLx6ooLKXGhVnFFxTiktZK53yIRVSueca7lLJr_IPjlI6Z2OlCon5GIRsv4Ns-TbobG970LWuexzsKEf2qwfog-vWWvhzQdMh2TP2Sbh0fZOycvd7fPsIZ8v7h9nN_McBCv7XJa6qNRyqTQrwQmhsZZAOUOmkSEsHafAOYB2lVOCVoVzXFFVM1kLqLQWU3K6yf2I3eeAqTetT4BNYwN2QzJcaVoIxlZgsQEhdilFdOYj-tbGb8OoGd2YtRszDjdUmLUbMxacbAtsAtu4aAP49PcstZKVHvOvNxyu1n55jCaBxwBY-4jQm7rz_zT9ABn9dxo</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>27905311</pqid></control><display><type>article</type><title>On the simulation of quantum turing machines</title><source>Elsevier ScienceDirect Journals</source><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>Carpentieri, Marco</creator><creatorcontrib>Carpentieri, Marco</creatorcontrib><description>In this article we shall review several basic definitions and results regarding quantum computation. In particular, after defining Quantum Turing Machines and networks the paper contains an exposition on continued fractions and on errors in quantum networks. The topic of simulation of Quantum Turing Machines by means of obvious computation is introduced. We give a full discussion of the simulation of multitape Quantum Turing Machines in a slight generalization of the class introduced by Bernstein and Vazirani. As main result we show that the Fisher-Pippenger technique can be used to give an O(tlogt) simulation of a multi-tape Quantum Turing Machine by another belonging to the extended Bernstein and Vazirani class. This result, even if regarding a slightly restricted class of Quantum Turing Machines improves the simulation results currently known in the literature.</description><identifier>ISSN: 0304-3975</identifier><identifier>EISSN: 1879-2294</identifier><identifier>DOI: 10.1016/S0304-3975(03)00054-9</identifier><identifier>CODEN: TCSCDI</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Applied sciences ; Automata. Abstract machines. Turing machines ; Computer science; control theory; systems ; Exact sciences and technology ; Logic and foundations ; Mathematical logic, foundations, set theory ; Mathematics ; Recursion theory ; Sciences and techniques of general use ; Theoretical computing</subject><ispartof>Theoretical computer science, 2003-07, Vol.304 (1-3), p.103-128</ispartof><rights>2003</rights><rights>2003 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c316t-469587bb7916cf339ed4c021e19e1ecbf20c22cc9f8f73085ff2707d14d3c8993</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(03)00054-9$$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=14974891$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Carpentieri, Marco</creatorcontrib><title>On the simulation of quantum turing machines</title><title>Theoretical computer science</title><description>In this article we shall review several basic definitions and results regarding quantum computation. In particular, after defining Quantum Turing Machines and networks the paper contains an exposition on continued fractions and on errors in quantum networks. The topic of simulation of Quantum Turing Machines by means of obvious computation is introduced. We give a full discussion of the simulation of multitape Quantum Turing Machines in a slight generalization of the class introduced by Bernstein and Vazirani. As main result we show that the Fisher-Pippenger technique can be used to give an O(tlogt) simulation of a multi-tape Quantum Turing Machine by another belonging to the extended Bernstein and Vazirani class. This result, even if regarding a slightly restricted class of Quantum Turing Machines improves the simulation results currently known in the literature.</description><subject>Applied sciences</subject><subject>Automata. Abstract machines. Turing machines</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Logic and foundations</subject><subject>Mathematical logic, foundations, set theory</subject><subject>Mathematics</subject><subject>Recursion theory</subject><subject>Sciences and techniques of general use</subject><subject>Theoretical computing</subject><issn>0304-3975</issn><issn>1879-2294</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2003</creationdate><recordtype>article</recordtype><recordid>eNqFkEtLxDAUhYMoOI7-BKEbRcFqXm2alcjgCwZmoa5D5vZGI22qSSv4753ODLp0dTffPYfzEXLM6CWjrLx6ooLKXGhVnFFxTiktZK53yIRVSueca7lLJr_IPjlI6Z2OlCon5GIRsv4Ns-TbobG970LWuexzsKEf2qwfog-vWWvhzQdMh2TP2Sbh0fZOycvd7fPsIZ8v7h9nN_McBCv7XJa6qNRyqTQrwQmhsZZAOUOmkSEsHafAOYB2lVOCVoVzXFFVM1kLqLQWU3K6yf2I3eeAqTetT4BNYwN2QzJcaVoIxlZgsQEhdilFdOYj-tbGb8OoGd2YtRszDjdUmLUbMxacbAtsAtu4aAP49PcstZKVHvOvNxyu1n55jCaBxwBY-4jQm7rz_zT9ABn9dxo</recordid><startdate>20030728</startdate><enddate>20030728</enddate><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>20030728</creationdate><title>On the simulation of quantum turing machines</title><author>Carpentieri, Marco</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c316t-469587bb7916cf339ed4c021e19e1ecbf20c22cc9f8f73085ff2707d14d3c8993</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Applied sciences</topic><topic>Automata. Abstract machines. Turing machines</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Logic and foundations</topic><topic>Mathematical logic, foundations, set theory</topic><topic>Mathematics</topic><topic>Recursion theory</topic><topic>Sciences and techniques of general use</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><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>Carpentieri, Marco</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On the simulation of quantum turing machines</atitle><jtitle>Theoretical computer science</jtitle><date>2003-07-28</date><risdate>2003</risdate><volume>304</volume><issue>1-3</issue><spage>103</spage><epage>128</epage><pages>103-128</pages><issn>0304-3975</issn><eissn>1879-2294</eissn><coden>TCSCDI</coden><abstract>In this article we shall review several basic definitions and results regarding quantum computation. In particular, after defining Quantum Turing Machines and networks the paper contains an exposition on continued fractions and on errors in quantum networks. The topic of simulation of Quantum Turing Machines by means of obvious computation is introduced. We give a full discussion of the simulation of multitape Quantum Turing Machines in a slight generalization of the class introduced by Bernstein and Vazirani. As main result we show that the Fisher-Pippenger technique can be used to give an O(tlogt) simulation of a multi-tape Quantum Turing Machine by another belonging to the extended Bernstein and Vazirani class. This result, even if regarding a slightly restricted class of Quantum Turing Machines improves the simulation results currently known in the literature.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/S0304-3975(03)00054-9</doi><tpages>26</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0304-3975 |
| ispartof | Theoretical computer science, 2003-07, Vol.304 (1-3), p.103-128 |
| issn | 0304-3975 1879-2294 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_27905311 |
| source | Elsevier ScienceDirect Journals; Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals |
| subjects | Applied sciences Automata. Abstract machines. Turing machines Computer science control theory systems Exact sciences and technology Logic and foundations Mathematical logic, foundations, set theory Mathematics Recursion theory Sciences and techniques of general use Theoretical computing |
| title | On the simulation of quantum turing machines |
| 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%3A17%3A51IST&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=On%20the%20simulation%20of%20quantum%20turing%20machines&rft.jtitle=Theoretical%20computer%20science&rft.au=Carpentieri,%20Marco&rft.date=2003-07-28&rft.volume=304&rft.issue=1-3&rft.spage=103&rft.epage=128&rft.pages=103-128&rft.issn=0304-3975&rft.eissn=1879-2294&rft.coden=TCSCDI&rft_id=info:doi/10.1016/S0304-3975(03)00054-9&rft_dat=%3Cproquest_cross%3E27905311%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=27905311&rft_id=info:pmid/&rft_els_id=S0304397503000549&rfr_iscdi=true |