Demonstration of qubit operations below a rigorous fault tolerance threshold with gate set tomography
Quantum information processors promise fast algorithms for problems inaccessible to classical computers. But since qubits are noisy and error-prone, they will depend on fault-tolerant quantum error correction (FTQEC) to compute reliably. Quantum error correction can protect against general noise if...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2017-01 |
|---|---|
| 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 | Blume-Kohout, Robin John King Gamble Nielsen, Erik Rudinger, Kenneth Mizrahi, Jonathan tier, Kevin Maunz, Peter |
| description | Quantum information processors promise fast algorithms for problems inaccessible to classical computers. But since qubits are noisy and error-prone, they will depend on fault-tolerant quantum error correction (FTQEC) to compute reliably. Quantum error correction can protect against general noise if -- and only if -- the error in each physical qubit operation is smaller than a certain threshold. The threshold for general errors is quantified by their diamond norm. Until now, qubits have been assessed primarily by randomized benchmarking, which reports a different "error rate" that is not sensitive to all errors, and cannot be compared directly to diamond norm thresholds. Here we use gate set tomography (GST) to completely characterize operations on a trapped-Yb\(^+\)-ion qubit and demonstrate with very high (\(>95\%\)) confidence that they satisfy a rigorous threshold for FTQEC (diamond norm \(\leq6.7\times10^{-4}\)). |
| doi_str_mv | 10.48550/arxiv.1605.07674 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_1605_07674</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2075310987</sourcerecordid><originalsourceid>FETCH-LOGICAL-a527-e8f44380702fbf16ec1c249a8df54a0b2f88c8b58970f97620057d028cf712493</originalsourceid><addsrcrecordid>eNot0MtqwzAQQFFRKDSk-YCuKuja6ehlycuSPiHQTfZGdiTbwbYcSW6av68TdzUwHIbhIvRAYM2VEPCs_W_zsyYpiDXIVPIbtKCMkURxSu_QKoQDANBUUiHYAplX07k-RK9j43rsLD6ORROxG8y8CrgwrTthjX1TOe_GgK0e24ijayfSlwbH2ptQu3aPT02scaWjwcFcROcqr4f6fI9urW6DWf3PJdq9v-02n8n2--Nr87JNtKAyMcpyzhRIoLawJDUlKSnPtNpbwTUU1CpVqkKoTILNZEoBhNwDVaWVZIJsiR7ns9cG-eCbTvtzfmmRX1tM4mkWg3fH0YSYH9zo--mnnIIUjECmJPsDZaNi_g</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2075310987</pqid></control><display><type>article</type><title>Demonstration of qubit operations below a rigorous fault tolerance threshold with gate set tomography</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Blume-Kohout, Robin ; John King Gamble ; Nielsen, Erik ; Rudinger, Kenneth ; Mizrahi, Jonathan ; tier, Kevin ; Maunz, Peter</creator><creatorcontrib>Blume-Kohout, Robin ; John King Gamble ; Nielsen, Erik ; Rudinger, Kenneth ; Mizrahi, Jonathan ; tier, Kevin ; Maunz, Peter</creatorcontrib><description>Quantum information processors promise fast algorithms for problems inaccessible to classical computers. But since qubits are noisy and error-prone, they will depend on fault-tolerant quantum error correction (FTQEC) to compute reliably. Quantum error correction can protect against general noise if -- and only if -- the error in each physical qubit operation is smaller than a certain threshold. The threshold for general errors is quantified by their diamond norm. Until now, qubits have been assessed primarily by randomized benchmarking, which reports a different "error rate" that is not sensitive to all errors, and cannot be compared directly to diamond norm thresholds. Here we use gate set tomography (GST) to completely characterize operations on a trapped-Yb\(^+\)-ion qubit and demonstrate with very high (\(>95\%\)) confidence that they satisfy a rigorous threshold for FTQEC (diamond norm \(\leq6.7\times10^{-4}\)).</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.1605.07674</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Diamonds ; Error correction ; Error correction & detection ; Error detection ; Fault tolerance ; Physics - Atomic Physics ; Physics - Quantum Physics ; Quantum computing ; Quantum phenomena ; Quantum theory ; Qubits (quantum computing) ; Tomography</subject><ispartof>arXiv.org, 2017-01</ispartof><rights>2017. 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.1038/ncomms14485$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.48550/arXiv.1605.07674$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Blume-Kohout, Robin</creatorcontrib><creatorcontrib>John King Gamble</creatorcontrib><creatorcontrib>Nielsen, Erik</creatorcontrib><creatorcontrib>Rudinger, Kenneth</creatorcontrib><creatorcontrib>Mizrahi, Jonathan</creatorcontrib><creatorcontrib>tier, Kevin</creatorcontrib><creatorcontrib>Maunz, Peter</creatorcontrib><title>Demonstration of qubit operations below a rigorous fault tolerance threshold with gate set tomography</title><title>arXiv.org</title><description>Quantum information processors promise fast algorithms for problems inaccessible to classical computers. But since qubits are noisy and error-prone, they will depend on fault-tolerant quantum error correction (FTQEC) to compute reliably. Quantum error correction can protect against general noise if -- and only if -- the error in each physical qubit operation is smaller than a certain threshold. The threshold for general errors is quantified by their diamond norm. Until now, qubits have been assessed primarily by randomized benchmarking, which reports a different "error rate" that is not sensitive to all errors, and cannot be compared directly to diamond norm thresholds. Here we use gate set tomography (GST) to completely characterize operations on a trapped-Yb\(^+\)-ion qubit and demonstrate with very high (\(>95\%\)) confidence that they satisfy a rigorous threshold for FTQEC (diamond norm \(\leq6.7\times10^{-4}\)).</description><subject>Algorithms</subject><subject>Diamonds</subject><subject>Error correction</subject><subject>Error correction & detection</subject><subject>Error detection</subject><subject>Fault tolerance</subject><subject>Physics - Atomic Physics</subject><subject>Physics - Quantum Physics</subject><subject>Quantum computing</subject><subject>Quantum phenomena</subject><subject>Quantum theory</subject><subject>Qubits (quantum computing)</subject><subject>Tomography</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</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>eNot0MtqwzAQQFFRKDSk-YCuKuja6ehlycuSPiHQTfZGdiTbwbYcSW6av68TdzUwHIbhIvRAYM2VEPCs_W_zsyYpiDXIVPIbtKCMkURxSu_QKoQDANBUUiHYAplX07k-RK9j43rsLD6ORROxG8y8CrgwrTthjX1TOe_GgK0e24ijayfSlwbH2ptQu3aPT02scaWjwcFcROcqr4f6fI9urW6DWf3PJdq9v-02n8n2--Nr87JNtKAyMcpyzhRIoLawJDUlKSnPtNpbwTUU1CpVqkKoTILNZEoBhNwDVaWVZIJsiR7ns9cG-eCbTvtzfmmRX1tM4mkWg3fH0YSYH9zo--mnnIIUjECmJPsDZaNi_g</recordid><startdate>20170129</startdate><enddate>20170129</enddate><creator>Blume-Kohout, Robin</creator><creator>John King Gamble</creator><creator>Nielsen, Erik</creator><creator>Rudinger, Kenneth</creator><creator>Mizrahi, Jonathan</creator><creator>tier, Kevin</creator><creator>Maunz, Peter</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>20170129</creationdate><title>Demonstration of qubit operations below a rigorous fault tolerance threshold with gate set tomography</title><author>Blume-Kohout, Robin ; John King Gamble ; Nielsen, Erik ; Rudinger, Kenneth ; Mizrahi, Jonathan ; tier, Kevin ; Maunz, Peter</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a527-e8f44380702fbf16ec1c249a8df54a0b2f88c8b58970f97620057d028cf712493</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Algorithms</topic><topic>Diamonds</topic><topic>Error correction</topic><topic>Error correction & detection</topic><topic>Error detection</topic><topic>Fault tolerance</topic><topic>Physics - Atomic Physics</topic><topic>Physics - Quantum Physics</topic><topic>Quantum computing</topic><topic>Quantum phenomena</topic><topic>Quantum theory</topic><topic>Qubits (quantum computing)</topic><topic>Tomography</topic><toplevel>online_resources</toplevel><creatorcontrib>Blume-Kohout, Robin</creatorcontrib><creatorcontrib>John King Gamble</creatorcontrib><creatorcontrib>Nielsen, Erik</creatorcontrib><creatorcontrib>Rudinger, Kenneth</creatorcontrib><creatorcontrib>Mizrahi, Jonathan</creatorcontrib><creatorcontrib>tier, Kevin</creatorcontrib><creatorcontrib>Maunz, Peter</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>Blume-Kohout, Robin</au><au>John King Gamble</au><au>Nielsen, Erik</au><au>Rudinger, Kenneth</au><au>Mizrahi, Jonathan</au><au>tier, Kevin</au><au>Maunz, Peter</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Demonstration of qubit operations below a rigorous fault tolerance threshold with gate set tomography</atitle><jtitle>arXiv.org</jtitle><date>2017-01-29</date><risdate>2017</risdate><eissn>2331-8422</eissn><abstract>Quantum information processors promise fast algorithms for problems inaccessible to classical computers. But since qubits are noisy and error-prone, they will depend on fault-tolerant quantum error correction (FTQEC) to compute reliably. Quantum error correction can protect against general noise if -- and only if -- the error in each physical qubit operation is smaller than a certain threshold. The threshold for general errors is quantified by their diamond norm. Until now, qubits have been assessed primarily by randomized benchmarking, which reports a different "error rate" that is not sensitive to all errors, and cannot be compared directly to diamond norm thresholds. Here we use gate set tomography (GST) to completely characterize operations on a trapped-Yb\(^+\)-ion qubit and demonstrate with very high (\(>95\%\)) confidence that they satisfy a rigorous threshold for FTQEC (diamond norm \(\leq6.7\times10^{-4}\)).</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.1605.07674</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2017-01 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_arxiv_primary_1605_07674 |
| source | arXiv.org; Free E- Journals |
| subjects | Algorithms Diamonds Error correction Error correction & detection Error detection Fault tolerance Physics - Atomic Physics Physics - Quantum Physics Quantum computing Quantum phenomena Quantum theory Qubits (quantum computing) Tomography |
| title | Demonstration of qubit operations below a rigorous fault tolerance threshold with gate set tomography |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T19%3A12%3A49IST&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=Demonstration%20of%20qubit%20operations%20below%20a%20rigorous%20fault%20tolerance%20threshold%20with%20gate%20set%20tomography&rft.jtitle=arXiv.org&rft.au=Blume-Kohout,%20Robin&rft.date=2017-01-29&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.1605.07674&rft_dat=%3Cproquest_arxiv%3E2075310987%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=2075310987&rft_id=info:pmid/&rfr_iscdi=true |