Quantum Expander Codes
We present an efficient decoding algorithm for constant rate quantum hypergraph-product LDPC codes which provably corrects adversarial errors of weight \(\Omega(\sqrt{n})\) for codes of length \(n\). The algorithm runs in time linear in the number of qubits, which makes its performance the strongest...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2015-04 |
|---|---|
| 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 | Leverrier, Anthony Tillich, Jean-Pierre Zémor, Gilles |
| description | We present an efficient decoding algorithm for constant rate quantum hypergraph-product LDPC codes which provably corrects adversarial errors of weight \(\Omega(\sqrt{n})\) for codes of length \(n\). The algorithm runs in time linear in the number of qubits, which makes its performance the strongest to date for linear-time decoding of quantum codes. The algorithm relies on expanding properties, not of the quantum code's factor graph directly, but of the factor graph of the original classical code it is constructed from. |
| doi_str_mv | 10.48550/arxiv.1504.00822 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_1504_00822</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2084231650</sourcerecordid><originalsourceid>FETCH-LOGICAL-a520-2d2dc5b1a3d9555cef49bfa7bc03e36203a066f9cef7cb51dea2f28bf9c1d0c63</originalsourceid><addsrcrecordid>eNotj81Lw0AUxBdBsNReBU8WPCe-fZu3SY4SqhUKIvS-7Ce02CTuNlL_e9fW08DMMPyGsXsOZdUQwZOOp913yQmqEqBBvGIzFIIXTYV4wxYp7QEAZY1EYsbuPibdH6fDcnUade98XHaD8-mWXQf9mfziX-ds-7Laduti8_761j1vCk0IBTp0lgzXwrVEZH2oWhN0bSwILySC0CBlaHNQW0PceY0BG5Md7sBKMWcPl9kztBrj7qDjj_qDV2f43Hi8NMY4fE0-HdV-mGKfmRRCviS4JBC_7lpF7g</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2084231650</pqid></control><display><type>article</type><title>Quantum Expander Codes</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Leverrier, Anthony ; Tillich, Jean-Pierre ; Zémor, Gilles</creator><creatorcontrib>Leverrier, Anthony ; Tillich, Jean-Pierre ; Zémor, Gilles</creatorcontrib><description>We present an efficient decoding algorithm for constant rate quantum hypergraph-product LDPC codes which provably corrects adversarial errors of weight \(\Omega(\sqrt{n})\) for codes of length \(n\). The algorithm runs in time linear in the number of qubits, which makes its performance the strongest to date for linear-time decoding of quantum codes. The algorithm relies on expanding properties, not of the quantum code's factor graph directly, but of the factor graph of the original classical code it is constructed from.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.1504.00822</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Binary system ; Codes ; Computer Science - Information Theory ; Decoding ; Error correcting codes ; Mathematics - Information Theory ; Physics - Quantum Physics ; Qubits (quantum computing) ; Weight</subject><ispartof>arXiv.org, 2015-04</ispartof><rights>2015. 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.1109/FOCS.2015.55$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.48550/arXiv.1504.00822$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Leverrier, Anthony</creatorcontrib><creatorcontrib>Tillich, Jean-Pierre</creatorcontrib><creatorcontrib>Zémor, Gilles</creatorcontrib><title>Quantum Expander Codes</title><title>arXiv.org</title><description>We present an efficient decoding algorithm for constant rate quantum hypergraph-product LDPC codes which provably corrects adversarial errors of weight \(\Omega(\sqrt{n})\) for codes of length \(n\). The algorithm runs in time linear in the number of qubits, which makes its performance the strongest to date for linear-time decoding of quantum codes. The algorithm relies on expanding properties, not of the quantum code's factor graph directly, but of the factor graph of the original classical code it is constructed from.</description><subject>Algorithms</subject><subject>Binary system</subject><subject>Codes</subject><subject>Computer Science - Information Theory</subject><subject>Decoding</subject><subject>Error correcting codes</subject><subject>Mathematics - Information Theory</subject><subject>Physics - Quantum Physics</subject><subject>Qubits (quantum computing)</subject><subject>Weight</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</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>eNotj81Lw0AUxBdBsNReBU8WPCe-fZu3SY4SqhUKIvS-7Ce02CTuNlL_e9fW08DMMPyGsXsOZdUQwZOOp913yQmqEqBBvGIzFIIXTYV4wxYp7QEAZY1EYsbuPibdH6fDcnUade98XHaD8-mWXQf9mfziX-ds-7Laduti8_761j1vCk0IBTp0lgzXwrVEZH2oWhN0bSwILySC0CBlaHNQW0PceY0BG5Md7sBKMWcPl9kztBrj7qDjj_qDV2f43Hi8NMY4fE0-HdV-mGKfmRRCviS4JBC_7lpF7g</recordid><startdate>20150403</startdate><enddate>20150403</enddate><creator>Leverrier, Anthony</creator><creator>Tillich, Jean-Pierre</creator><creator>Zémor, Gilles</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>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20150403</creationdate><title>Quantum Expander Codes</title><author>Leverrier, Anthony ; Tillich, Jean-Pierre ; Zémor, Gilles</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a520-2d2dc5b1a3d9555cef49bfa7bc03e36203a066f9cef7cb51dea2f28bf9c1d0c63</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Algorithms</topic><topic>Binary system</topic><topic>Codes</topic><topic>Computer Science - Information Theory</topic><topic>Decoding</topic><topic>Error correcting codes</topic><topic>Mathematics - Information Theory</topic><topic>Physics - Quantum Physics</topic><topic>Qubits (quantum computing)</topic><topic>Weight</topic><toplevel>online_resources</toplevel><creatorcontrib>Leverrier, Anthony</creatorcontrib><creatorcontrib>Tillich, Jean-Pierre</creatorcontrib><creatorcontrib>Zémor, Gilles</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 Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Leverrier, Anthony</au><au>Tillich, Jean-Pierre</au><au>Zémor, Gilles</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Quantum Expander Codes</atitle><jtitle>arXiv.org</jtitle><date>2015-04-03</date><risdate>2015</risdate><eissn>2331-8422</eissn><abstract>We present an efficient decoding algorithm for constant rate quantum hypergraph-product LDPC codes which provably corrects adversarial errors of weight \(\Omega(\sqrt{n})\) for codes of length \(n\). The algorithm runs in time linear in the number of qubits, which makes its performance the strongest to date for linear-time decoding of quantum codes. The algorithm relies on expanding properties, not of the quantum code's factor graph directly, but of the factor graph of the original classical code it is constructed from.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.1504.00822</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2015-04 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_arxiv_primary_1504_00822 |
| source | arXiv.org; Free E- Journals |
| subjects | Algorithms Binary system Codes Computer Science - Information Theory Decoding Error correcting codes Mathematics - Information Theory Physics - Quantum Physics Qubits (quantum computing) Weight |
| title | Quantum Expander Codes |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T06%3A49%3A01IST&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=Quantum%20Expander%20Codes&rft.jtitle=arXiv.org&rft.au=Leverrier,%20Anthony&rft.date=2015-04-03&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.1504.00822&rft_dat=%3Cproquest_arxiv%3E2084231650%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=2084231650&rft_id=info:pmid/&rfr_iscdi=true |