Quantum error correction below the surface code threshold
Quantum error correction [1, 2, 3, 4] provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit, where the logical error rate is suppressed exponentially as more qubits are added. However, this exponential suppression only occurs if the physical...
Gespeichert in:
Veröffentlicht in: | Nature (London) 2024-12 |
---|---|
1. Verfasser: | |
Format: | Artikel |
Sprache: | eng |
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 | Nature (London) |
container_volume | |
creator | Google Quantum AI and Collaborators |
description | Quantum error correction [1, 2, 3, 4] provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit, where the logical error rate is suppressed exponentially as more qubits are added. However, this exponential suppression only occurs if the physical error rate is below a critical threshold. Here, we present two below-threshold surface code memories on our newest generation of superconducting processors, Willow: a distance-7 code, and a distance-5 code integrated with a real-time decoder. The logical error rate of our larger quantum memory is suppressed by a factor of
when increasing the code distance by two, culminating in a 101-qubit distance-7 code with 0.143% ± 0.003% error per cycle of error correction. This logical memory is also beyond break-even, exceeding its best physical qubit's lifetime by a factor of
. Our system maintains below-threshold performance when decoding in real time, achieving an average decoder latency of 63 μs at distance-5 up to a million cycles, with a cycle time of 1.1 μs. We also run repetition codes up to distance-29 and find that logical performance is limited by rare correlated error events occurring approximately once every hour, or
cycles. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms. |
format | Article |
fullrecord | <record><control><sourceid>pubmed</sourceid><recordid>TN_cdi_pubmed_primary_39653125</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>39653125</sourcerecordid><originalsourceid>FETCH-pubmed_primary_396531253</originalsourceid><addsrcrecordid>eNpjYuA0NDE30zUxszDnYOAqLs4yMDAwNTQ3YWfgMLY0MzU2NDLlZLAMLE3MKynNVUgtKsovUkjOLypKTS7JzM9TSErNyS9XKMlIVSguLUpLTE4FSqakAgWKUosz8nNSeBhY0xJzilN5oTQ3g5yba4izh25BaVJuakp8QVFmbmJRZTzMLmOCCgBWGjRT</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Quantum error correction below the surface code threshold</title><source>Nature</source><source>Alma/SFX Local Collection</source><creator>Google Quantum AI and Collaborators</creator><creatorcontrib>Google Quantum AI and Collaborators</creatorcontrib><description>Quantum error correction [1, 2, 3, 4] provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit, where the logical error rate is suppressed exponentially as more qubits are added. However, this exponential suppression only occurs if the physical error rate is below a critical threshold. Here, we present two below-threshold surface code memories on our newest generation of superconducting processors, Willow: a distance-7 code, and a distance-5 code integrated with a real-time decoder. The logical error rate of our larger quantum memory is suppressed by a factor of
when increasing the code distance by two, culminating in a 101-qubit distance-7 code with 0.143% ± 0.003% error per cycle of error correction. This logical memory is also beyond break-even, exceeding its best physical qubit's lifetime by a factor of
. Our system maintains below-threshold performance when decoding in real time, achieving an average decoder latency of 63 μs at distance-5 up to a million cycles, with a cycle time of 1.1 μs. We also run repetition codes up to distance-29 and find that logical performance is limited by rare correlated error events occurring approximately once every hour, or
cycles. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms.</description><identifier>EISSN: 1476-4687</identifier><identifier>PMID: 39653125</identifier><language>eng</language><publisher>England</publisher><ispartof>Nature (London), 2024-12</ispartof><rights>2024. The Author(s), under exclusive licence to Springer Nature Limited.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>315,781,785</link.rule.ids><backlink>$$Uhttps://www.ncbi.nlm.nih.gov/pubmed/39653125$$D View this record in MEDLINE/PubMed$$Hfree_for_read</backlink></links><search><creatorcontrib>Google Quantum AI and Collaborators</creatorcontrib><title>Quantum error correction below the surface code threshold</title><title>Nature (London)</title><addtitle>Nature</addtitle><description>Quantum error correction [1, 2, 3, 4] provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit, where the logical error rate is suppressed exponentially as more qubits are added. However, this exponential suppression only occurs if the physical error rate is below a critical threshold. Here, we present two below-threshold surface code memories on our newest generation of superconducting processors, Willow: a distance-7 code, and a distance-5 code integrated with a real-time decoder. The logical error rate of our larger quantum memory is suppressed by a factor of
when increasing the code distance by two, culminating in a 101-qubit distance-7 code with 0.143% ± 0.003% error per cycle of error correction. This logical memory is also beyond break-even, exceeding its best physical qubit's lifetime by a factor of
. Our system maintains below-threshold performance when decoding in real time, achieving an average decoder latency of 63 μs at distance-5 up to a million cycles, with a cycle time of 1.1 μs. We also run repetition codes up to distance-29 and find that logical performance is limited by rare correlated error events occurring approximately once every hour, or
cycles. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms.</description><issn>1476-4687</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><recordid>eNpjYuA0NDE30zUxszDnYOAqLs4yMDAwNTQ3YWfgMLY0MzU2NDLlZLAMLE3MKynNVUgtKsovUkjOLypKTS7JzM9TSErNyS9XKMlIVSguLUpLTE4FSqakAgWKUosz8nNSeBhY0xJzilN5oTQ3g5yba4izh25BaVJuakp8QVFmbmJRZTzMLmOCCgBWGjRT</recordid><startdate>20241209</startdate><enddate>20241209</enddate><creator>Google Quantum AI and Collaborators</creator><scope>NPM</scope></search><sort><creationdate>20241209</creationdate><title>Quantum error correction below the surface code threshold</title></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-pubmed_primary_396531253</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Google Quantum AI and Collaborators</creatorcontrib><collection>PubMed</collection><jtitle>Nature (London)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><aucorp>Google Quantum AI and Collaborators</aucorp><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Quantum error correction below the surface code threshold</atitle><jtitle>Nature (London)</jtitle><addtitle>Nature</addtitle><date>2024-12-09</date><risdate>2024</risdate><eissn>1476-4687</eissn><abstract>Quantum error correction [1, 2, 3, 4] provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit, where the logical error rate is suppressed exponentially as more qubits are added. However, this exponential suppression only occurs if the physical error rate is below a critical threshold. Here, we present two below-threshold surface code memories on our newest generation of superconducting processors, Willow: a distance-7 code, and a distance-5 code integrated with a real-time decoder. The logical error rate of our larger quantum memory is suppressed by a factor of
when increasing the code distance by two, culminating in a 101-qubit distance-7 code with 0.143% ± 0.003% error per cycle of error correction. This logical memory is also beyond break-even, exceeding its best physical qubit's lifetime by a factor of
. Our system maintains below-threshold performance when decoding in real time, achieving an average decoder latency of 63 μs at distance-5 up to a million cycles, with a cycle time of 1.1 μs. We also run repetition codes up to distance-29 and find that logical performance is limited by rare correlated error events occurring approximately once every hour, or
cycles. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms.</abstract><cop>England</cop><pmid>39653125</pmid></addata></record> |
fulltext | fulltext |
identifier | EISSN: 1476-4687 |
ispartof | Nature (London), 2024-12 |
issn | 1476-4687 |
language | eng |
recordid | cdi_pubmed_primary_39653125 |
source | Nature; Alma/SFX Local Collection |
title | Quantum error correction below the surface code threshold |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-14T20%3A45%3A35IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pubmed&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Quantum%20error%20correction%20below%20the%20surface%20code%20threshold&rft.jtitle=Nature%20(London)&rft.aucorp=Google%20Quantum%20AI%20and%20Collaborators&rft.date=2024-12-09&rft.eissn=1476-4687&rft_id=info:doi/&rft_dat=%3Cpubmed%3E39653125%3C/pubmed%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/39653125&rfr_iscdi=true |