Fault Tolerance in Parity-State Linear Optical Quantum Computing
We use a combination of analytical and numerical techniques to calculate the noise threshold and resource requirements for a linear optical quantum computing scheme based on parity-state encoding. Parity-state encoding is used at the lowest level of code concatenation in order to efficiently correct...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2009-11 |
|---|---|
| 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 | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | arXiv.org |
| container_volume | |
| creator | Hayes, A J F Haselgrove, H L Gilchrist, Alexei Ralph, T C |
| description | We use a combination of analytical and numerical techniques to calculate the noise threshold and resource requirements for a linear optical quantum computing scheme based on parity-state encoding. Parity-state encoding is used at the lowest level of code concatenation in order to efficiently correct errors arising from the inherent nondeterminism of two-qubit linear-optical gates. When combined with teleported error-correction (using either a Steane or Golay code) at higher levels of concatenation, the parity-state scheme is found to achieve a saving of approximately three orders of magnitude in resources when compared to a previous scheme, at a cost of a somewhat reduced noise threshold. |
| doi_str_mv | 10.48550/arxiv.0908.3932 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_0908_3932</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2085206862</sourcerecordid><originalsourceid>FETCH-LOGICAL-a512-d3aeff612434321add529bf5b6fcde59701293a195358c830776cbbe8c1317c03</originalsourceid><addsrcrecordid>eNotj89LwzAYhoMgOObuniTguTP5vqZNb8pwKhSm2Hv5mqaS0V-mqbj_3s15ei8PL8_D2I0U61grJe7J_7jvtciEXmOGcMEWgCgjHQNcsdU07YUQkKSgFC7Yw5bmNvBiaK2n3ljuev5G3oVD9BEoWJ673pLnuzE4Qy1_n6kPc8c3QzfOwfWf1-yyoXayq_9dsmL7VGxeonz3_Lp5zCNSEqIayTZNIiHGGEFSXSvIqkZVSWNqq7JUSMiQZKZQaaNRpGliqspqI1GmRuCS3Z5v_-rK0buO_KE8VZanyiNwdwZGP3zNdgrlfph9f1QqQWgFItEJ4C8ZUVPO</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2085206862</pqid></control><display><type>article</type><title>Fault Tolerance in Parity-State Linear Optical Quantum Computing</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Hayes, A J F ; Haselgrove, H L ; Gilchrist, Alexei ; Ralph, T C</creator><creatorcontrib>Hayes, A J F ; Haselgrove, H L ; Gilchrist, Alexei ; Ralph, T C</creatorcontrib><description>We use a combination of analytical and numerical techniques to calculate the noise threshold and resource requirements for a linear optical quantum computing scheme based on parity-state encoding. Parity-state encoding is used at the lowest level of code concatenation in order to efficiently correct errors arising from the inherent nondeterminism of two-qubit linear-optical gates. When combined with teleported error-correction (using either a Steane or Golay code) at higher levels of concatenation, the parity-state scheme is found to achieve a saving of approximately three orders of magnitude in resources when compared to a previous scheme, at a cost of a somewhat reduced noise threshold.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.0908.3932</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Error correction ; Fault tolerance ; Golay codes ; Noise threshold ; Parity ; Physics - Quantum Physics ; Quantum computing ; Qubits (quantum computing)</subject><ispartof>arXiv.org, 2009-11</ispartof><rights>2009. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,784,885,27925</link.rule.ids><backlink>$$Uhttps://doi.org/10.1103/PhysRevA.82.022323$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.48550/arXiv.0908.3932$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Hayes, A J F</creatorcontrib><creatorcontrib>Haselgrove, H L</creatorcontrib><creatorcontrib>Gilchrist, Alexei</creatorcontrib><creatorcontrib>Ralph, T C</creatorcontrib><title>Fault Tolerance in Parity-State Linear Optical Quantum Computing</title><title>arXiv.org</title><description>We use a combination of analytical and numerical techniques to calculate the noise threshold and resource requirements for a linear optical quantum computing scheme based on parity-state encoding. Parity-state encoding is used at the lowest level of code concatenation in order to efficiently correct errors arising from the inherent nondeterminism of two-qubit linear-optical gates. When combined with teleported error-correction (using either a Steane or Golay code) at higher levels of concatenation, the parity-state scheme is found to achieve a saving of approximately three orders of magnitude in resources when compared to a previous scheme, at a cost of a somewhat reduced noise threshold.</description><subject>Error correction</subject><subject>Fault tolerance</subject><subject>Golay codes</subject><subject>Noise threshold</subject><subject>Parity</subject><subject>Physics - Quantum Physics</subject><subject>Quantum computing</subject><subject>Qubits (quantum computing)</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2009</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GOX</sourceid><recordid>eNotj89LwzAYhoMgOObuniTguTP5vqZNb8pwKhSm2Hv5mqaS0V-mqbj_3s15ei8PL8_D2I0U61grJe7J_7jvtciEXmOGcMEWgCgjHQNcsdU07YUQkKSgFC7Yw5bmNvBiaK2n3ljuev5G3oVD9BEoWJ673pLnuzE4Qy1_n6kPc8c3QzfOwfWf1-yyoXayq_9dsmL7VGxeonz3_Lp5zCNSEqIayTZNIiHGGEFSXSvIqkZVSWNqq7JUSMiQZKZQaaNRpGliqspqI1GmRuCS3Z5v_-rK0buO_KE8VZanyiNwdwZGP3zNdgrlfph9f1QqQWgFItEJ4C8ZUVPO</recordid><startdate>20091103</startdate><enddate>20091103</enddate><creator>Hayes, A J F</creator><creator>Haselgrove, H L</creator><creator>Gilchrist, Alexei</creator><creator>Ralph, T C</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>GOX</scope></search><sort><creationdate>20091103</creationdate><title>Fault Tolerance in Parity-State Linear Optical Quantum Computing</title><author>Hayes, A J F ; Haselgrove, H L ; Gilchrist, Alexei ; Ralph, T C</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a512-d3aeff612434321add529bf5b6fcde59701293a195358c830776cbbe8c1317c03</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Error correction</topic><topic>Fault tolerance</topic><topic>Golay codes</topic><topic>Noise threshold</topic><topic>Parity</topic><topic>Physics - Quantum Physics</topic><topic>Quantum computing</topic><topic>Qubits (quantum computing)</topic><toplevel>online_resources</toplevel><creatorcontrib>Hayes, A J F</creatorcontrib><creatorcontrib>Haselgrove, H L</creatorcontrib><creatorcontrib>Gilchrist, Alexei</creatorcontrib><creatorcontrib>Ralph, T C</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Hayes, A J F</au><au>Haselgrove, H L</au><au>Gilchrist, Alexei</au><au>Ralph, T C</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Fault Tolerance in Parity-State Linear Optical Quantum Computing</atitle><jtitle>arXiv.org</jtitle><date>2009-11-03</date><risdate>2009</risdate><eissn>2331-8422</eissn><abstract>We use a combination of analytical and numerical techniques to calculate the noise threshold and resource requirements for a linear optical quantum computing scheme based on parity-state encoding. Parity-state encoding is used at the lowest level of code concatenation in order to efficiently correct errors arising from the inherent nondeterminism of two-qubit linear-optical gates. When combined with teleported error-correction (using either a Steane or Golay code) at higher levels of concatenation, the parity-state scheme is found to achieve a saving of approximately three orders of magnitude in resources when compared to a previous scheme, at a cost of a somewhat reduced noise threshold.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.0908.3932</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2009-11 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_arxiv_primary_0908_3932 |
| source | arXiv.org; Free E- Journals |
| subjects | Error correction Fault tolerance Golay codes Noise threshold Parity Physics - Quantum Physics Quantum computing Qubits (quantum computing) |
| title | Fault Tolerance in Parity-State Linear Optical Quantum Computing |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T02%3A11%3A45IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Fault%20Tolerance%20in%20Parity-State%20Linear%20Optical%20Quantum%20Computing&rft.jtitle=arXiv.org&rft.au=Hayes,%20A%20J%20F&rft.date=2009-11-03&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.0908.3932&rft_dat=%3Cproquest_arxiv%3E2085206862%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2085206862&rft_id=info:pmid/&rfr_iscdi=true |