Numerical Implementation of Just-In-Time Decoding in Novel Lattice Slices Through the Three-Dimensional Surface Code

We build on recent work by B. Brown (Sci. Adv. 6, eaay4929 (2020)) to develop and simulate an explicit recipe for a just-in-time decoding scheme in three 3D surface codes, which can be used to implement a transversal (non-Clifford) \(\overline{CCZ}\) between three 2D surface codes in time linear in...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2022-05
Main Authors: Scruby, T R, Browne, D E, Webster, P, Vasmer, M
Format: Article
Language:English
Subjects:
Building codes
Codes
Decoding
Error analysis
Error detection
Optimization
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Scruby, T R
Browne, D E
Webster, P
Vasmer, M
description We build on recent work by B. Brown (Sci. Adv. 6, eaay4929 (2020)) to develop and simulate an explicit recipe for a just-in-time decoding scheme in three 3D surface codes, which can be used to implement a transversal (non-Clifford) \(\overline{CCZ}\) between three 2D surface codes in time linear in the code distance. We present a fully detailed set of bounded-height lattice slices through the 3D codes which retain the code distance and measurement-error detecting properties of the full 3D code and admit a dimension-jumping process which expands from/collapses to 2D surface codes supported on the boundaries of each slice. At each timestep of the procedure the slices agree on a common set of overlapping qubits on which \(CCZ\) should be applied. We use these slices to simulate the performance of a simple JIT decoder against stochastic \(X\) and measurement errors and find evidence for a threshold \(p_c \sim 0.1\%\) in all three codes. We expect that this threshold could be improved by optimisation of the decoder.
doi_str_mv 10.48550/arxiv.2012.08536
format article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2470801058</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2470801058</sourcerecordid><originalsourceid>FETCH-LOGICAL-a528-830731bd0d9cf09db9158bdebe896f1a6899139937dcc9e4ef83aed60d60ec643</originalsourceid><addsrcrecordid>eNotjstqwzAUREWh0JDmA7oTdK1UD8uWliXpIyWki3gfZOk6UbCt1JJDP78qLQxzZzH3MAg9MLoslJT0yYzf_rrklPElVVKUN2jGhWBEFZzfoUWMZ0opLysupZihtJt6GL01Hd70lw56GJJJPgw4tPhjiolsBlL7HvAabHB-OGI_4F24Qoe3JiVvAe-77BHXpzFMxxNOJ_jNAGSd_4aYYZm-n8bW5PIqOLhHt63pIiz-7xzVry_16p1sP982q-ctMZIrogStBGscddq2VLtGM6kaBw0oXbbMlEprJrQWlbNWQwGtEgZcSbPAloWYo8c_7GUMXxPEdDiHacxj4oEXFVWUUanED8UQXYg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2470801058</pqid></control><display><type>article</type><title>Numerical Implementation of Just-In-Time Decoding in Novel Lattice Slices Through the Three-Dimensional Surface Code</title><source>Publicly Available Content Database</source><creator>Scruby, T R ; Browne, D E ; Webster, P ; Vasmer, M</creator><creatorcontrib>Scruby, T R ; Browne, D E ; Webster, P ; Vasmer, M</creatorcontrib><description>We build on recent work by B. Brown (Sci. Adv. 6, eaay4929 (2020)) to develop and simulate an explicit recipe for a just-in-time decoding scheme in three 3D surface codes, which can be used to implement a transversal (non-Clifford) \(\overline{CCZ}\) between three 2D surface codes in time linear in the code distance. We present a fully detailed set of bounded-height lattice slices through the 3D codes which retain the code distance and measurement-error detecting properties of the full 3D code and admit a dimension-jumping process which expands from/collapses to 2D surface codes supported on the boundaries of each slice. At each timestep of the procedure the slices agree on a common set of overlapping qubits on which \(CCZ\) should be applied. We use these slices to simulate the performance of a simple JIT decoder against stochastic \(X\) and measurement errors and find evidence for a threshold \(p_c \sim 0.1\%\) in all three codes. We expect that this threshold could be improved by optimisation of the decoder.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.2012.08536</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Building codes ; Codes ; Decoding ; Error analysis ; Error detection ; Optimization</subject><ispartof>arXiv.org, 2022-05</ispartof><rights>2022. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2470801058?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>776,780,25731,27902,36989,44566</link.rule.ids></links><search><creatorcontrib>Scruby, T R</creatorcontrib><creatorcontrib>Browne, D E</creatorcontrib><creatorcontrib>Webster, P</creatorcontrib><creatorcontrib>Vasmer, M</creatorcontrib><title>Numerical Implementation of Just-In-Time Decoding in Novel Lattice Slices Through the Three-Dimensional Surface Code</title><title>arXiv.org</title><description>We build on recent work by B. Brown (Sci. Adv. 6, eaay4929 (2020)) to develop and simulate an explicit recipe for a just-in-time decoding scheme in three 3D surface codes, which can be used to implement a transversal (non-Clifford) \(\overline{CCZ}\) between three 2D surface codes in time linear in the code distance. We present a fully detailed set of bounded-height lattice slices through the 3D codes which retain the code distance and measurement-error detecting properties of the full 3D code and admit a dimension-jumping process which expands from/collapses to 2D surface codes supported on the boundaries of each slice. At each timestep of the procedure the slices agree on a common set of overlapping qubits on which \(CCZ\) should be applied. We use these slices to simulate the performance of a simple JIT decoder against stochastic \(X\) and measurement errors and find evidence for a threshold \(p_c \sim 0.1\%\) in all three codes. We expect that this threshold could be improved by optimisation of the decoder.</description><subject>Building codes</subject><subject>Codes</subject><subject>Decoding</subject><subject>Error analysis</subject><subject>Error detection</subject><subject>Optimization</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNotjstqwzAUREWh0JDmA7oTdK1UD8uWliXpIyWki3gfZOk6UbCt1JJDP78qLQxzZzH3MAg9MLoslJT0yYzf_rrklPElVVKUN2jGhWBEFZzfoUWMZ0opLysupZihtJt6GL01Hd70lw56GJJJPgw4tPhjiolsBlL7HvAabHB-OGI_4F24Qoe3JiVvAe-77BHXpzFMxxNOJ_jNAGSd_4aYYZm-n8bW5PIqOLhHt63pIiz-7xzVry_16p1sP982q-ctMZIrogStBGscddq2VLtGM6kaBw0oXbbMlEprJrQWlbNWQwGtEgZcSbPAloWYo8c_7GUMXxPEdDiHacxj4oEXFVWUUanED8UQXYg</recordid><startdate>20220520</startdate><enddate>20220520</enddate><creator>Scruby, T R</creator><creator>Browne, D E</creator><creator>Webster, P</creator><creator>Vasmer, M</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></search><sort><creationdate>20220520</creationdate><title>Numerical Implementation of Just-In-Time Decoding in Novel Lattice Slices Through the Three-Dimensional Surface Code</title><author>Scruby, T R ; Browne, D E ; Webster, P ; Vasmer, M</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a528-830731bd0d9cf09db9158bdebe896f1a6899139937dcc9e4ef83aed60d60ec643</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Building codes</topic><topic>Codes</topic><topic>Decoding</topic><topic>Error analysis</topic><topic>Error detection</topic><topic>Optimization</topic><toplevel>online_resources</toplevel><creatorcontrib>Scruby, T R</creatorcontrib><creatorcontrib>Browne, D E</creatorcontrib><creatorcontrib>Webster, P</creatorcontrib><creatorcontrib>Vasmer, M</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</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><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Scruby, T R</au><au>Browne, D E</au><au>Webster, P</au><au>Vasmer, M</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Numerical Implementation of Just-In-Time Decoding in Novel Lattice Slices Through the Three-Dimensional Surface Code</atitle><jtitle>arXiv.org</jtitle><date>2022-05-20</date><risdate>2022</risdate><eissn>2331-8422</eissn><abstract>We build on recent work by B. Brown (Sci. Adv. 6, eaay4929 (2020)) to develop and simulate an explicit recipe for a just-in-time decoding scheme in three 3D surface codes, which can be used to implement a transversal (non-Clifford) \(\overline{CCZ}\) between three 2D surface codes in time linear in the code distance. We present a fully detailed set of bounded-height lattice slices through the 3D codes which retain the code distance and measurement-error detecting properties of the full 3D code and admit a dimension-jumping process which expands from/collapses to 2D surface codes supported on the boundaries of each slice. At each timestep of the procedure the slices agree on a common set of overlapping qubits on which \(CCZ\) should be applied. We use these slices to simulate the performance of a simple JIT decoder against stochastic \(X\) and measurement errors and find evidence for a threshold \(p_c \sim 0.1\%\) in all three codes. We expect that this threshold could be improved by optimisation of the decoder.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.2012.08536</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2022-05
issn 2331-8422
language eng
recordid cdi_proquest_journals_2470801058
source Publicly Available Content Database
subjects Building codes
Codes
Decoding
Error analysis
Error detection
Optimization
title Numerical Implementation of Just-In-Time Decoding in Novel Lattice Slices Through the Three-Dimensional Surface Code
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-06T13%3A06%3A20IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Numerical%20Implementation%20of%20Just-In-Time%20Decoding%20in%20Novel%20Lattice%20Slices%20Through%20the%20Three-Dimensional%20Surface%20Code&rft.jtitle=arXiv.org&rft.au=Scruby,%20T%20R&rft.date=2022-05-20&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.2012.08536&rft_dat=%3Cproquest%3E2470801058%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-a528-830731bd0d9cf09db9158bdebe896f1a6899139937dcc9e4ef83aed60d60ec643%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2470801058&rft_id=info:pmid/&rfr_iscdi=true