Fault-tolerant quantum computing with the parity code and noise-biased qubits

We present a fault-tolerant universal quantum computing architecture based on a code concatenation of noise-biased qubits and the parity architecture. The parity architecture can be understood as a LDPC code tailored specifically to obtain any desired logical connectivity from nearest neighbor physi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Messinger, Anette, Torggler, Valentin, Klaver, Berend, Fellner, Michael, Lechner, Wolfgang
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Messinger, Anette
Torggler, Valentin
Klaver, Berend
Fellner, Michael
Lechner, Wolfgang
description We present a fault-tolerant universal quantum computing architecture based on a code concatenation of noise-biased qubits and the parity architecture. The parity architecture can be understood as a LDPC code tailored specifically to obtain any desired logical connectivity from nearest neighbor physical interactions. The code layout can be dynamically adjusted to algorithmic requirements on-the-fly. This allows reaching arbitrary code distances and thereby exponential suppression of errors with a universal set of fault-tolerant gates. In addition to the previously explored tool-sets for concatenated cat codes, our approach features parallelizable interactions between arbitrary sets of qubits by directly addressing the parity qubits in the code. The proposed scheme enables codes with less physical qubit overhead compared to the repetition code with the same code distances, while requiring only weight-3 and weight-4 stabilizers and nearest neighbor 2D square-lattice connectivity.
doi_str_mv 10.48550/arxiv.2404.11332
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2404_11332</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2404_11332</sourcerecordid><originalsourceid>FETCH-LOGICAL-a672-7413c37b1f06a305709238e04ae732c5272786f50e3a387b8b9999604fffc5893</originalsourceid><addsrcrecordid>eNotj79OwzAYxL0woMIDMOEXcLD92bEzoooCUlGX7tHnxKaW8g_HAfr2hMINd8PpTvoRcid4oazW_AHTd_wspOKqEAJAXpO3HS5dZnnsfMIh049l9aWnzdhPS47DO_2K-UTzydMJU8zntWk9xaGlwxhnz1zE2bfrzsU835CrgN3sb_9zQ467p-P2he0Pz6_bxz3D0khmlIAGjBOBlwhcG15JsJ4r9AZko6WRxpZBcw8I1jjrqlUlVyGERtsKNuT-7_bCU08p9pjO9S9XfeGCH1OaR8k</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Fault-tolerant quantum computing with the parity code and noise-biased qubits</title><source>arXiv.org</source><creator>Messinger, Anette ; Torggler, Valentin ; Klaver, Berend ; Fellner, Michael ; Lechner, Wolfgang</creator><creatorcontrib>Messinger, Anette ; Torggler, Valentin ; Klaver, Berend ; Fellner, Michael ; Lechner, Wolfgang</creatorcontrib><description>We present a fault-tolerant universal quantum computing architecture based on a code concatenation of noise-biased qubits and the parity architecture. The parity architecture can be understood as a LDPC code tailored specifically to obtain any desired logical connectivity from nearest neighbor physical interactions. The code layout can be dynamically adjusted to algorithmic requirements on-the-fly. This allows reaching arbitrary code distances and thereby exponential suppression of errors with a universal set of fault-tolerant gates. In addition to the previously explored tool-sets for concatenated cat codes, our approach features parallelizable interactions between arbitrary sets of qubits by directly addressing the parity qubits in the code. The proposed scheme enables codes with less physical qubit overhead compared to the repetition code with the same code distances, while requiring only weight-3 and weight-4 stabilizers and nearest neighbor 2D square-lattice connectivity.</description><identifier>DOI: 10.48550/arxiv.2404.11332</identifier><language>eng</language><subject>Physics - Quantum Physics</subject><creationdate>2024-04</creationdate><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,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2404.11332$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2404.11332$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Messinger, Anette</creatorcontrib><creatorcontrib>Torggler, Valentin</creatorcontrib><creatorcontrib>Klaver, Berend</creatorcontrib><creatorcontrib>Fellner, Michael</creatorcontrib><creatorcontrib>Lechner, Wolfgang</creatorcontrib><title>Fault-tolerant quantum computing with the parity code and noise-biased qubits</title><description>We present a fault-tolerant universal quantum computing architecture based on a code concatenation of noise-biased qubits and the parity architecture. The parity architecture can be understood as a LDPC code tailored specifically to obtain any desired logical connectivity from nearest neighbor physical interactions. The code layout can be dynamically adjusted to algorithmic requirements on-the-fly. This allows reaching arbitrary code distances and thereby exponential suppression of errors with a universal set of fault-tolerant gates. In addition to the previously explored tool-sets for concatenated cat codes, our approach features parallelizable interactions between arbitrary sets of qubits by directly addressing the parity qubits in the code. The proposed scheme enables codes with less physical qubit overhead compared to the repetition code with the same code distances, while requiring only weight-3 and weight-4 stabilizers and nearest neighbor 2D square-lattice connectivity.</description><subject>Physics - Quantum Physics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj79OwzAYxL0woMIDMOEXcLD92bEzoooCUlGX7tHnxKaW8g_HAfr2hMINd8PpTvoRcid4oazW_AHTd_wspOKqEAJAXpO3HS5dZnnsfMIh049l9aWnzdhPS47DO_2K-UTzydMJU8zntWk9xaGlwxhnz1zE2bfrzsU835CrgN3sb_9zQ467p-P2he0Pz6_bxz3D0khmlIAGjBOBlwhcG15JsJ4r9AZko6WRxpZBcw8I1jjrqlUlVyGERtsKNuT-7_bCU08p9pjO9S9XfeGCH1OaR8k</recordid><startdate>20240417</startdate><enddate>20240417</enddate><creator>Messinger, Anette</creator><creator>Torggler, Valentin</creator><creator>Klaver, Berend</creator><creator>Fellner, Michael</creator><creator>Lechner, Wolfgang</creator><scope>GOX</scope></search><sort><creationdate>20240417</creationdate><title>Fault-tolerant quantum computing with the parity code and noise-biased qubits</title><author>Messinger, Anette ; Torggler, Valentin ; Klaver, Berend ; Fellner, Michael ; Lechner, Wolfgang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a672-7413c37b1f06a305709238e04ae732c5272786f50e3a387b8b9999604fffc5893</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Physics - Quantum Physics</topic><toplevel>online_resources</toplevel><creatorcontrib>Messinger, Anette</creatorcontrib><creatorcontrib>Torggler, Valentin</creatorcontrib><creatorcontrib>Klaver, Berend</creatorcontrib><creatorcontrib>Fellner, Michael</creatorcontrib><creatorcontrib>Lechner, Wolfgang</creatorcontrib><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Messinger, Anette</au><au>Torggler, Valentin</au><au>Klaver, Berend</au><au>Fellner, Michael</au><au>Lechner, Wolfgang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Fault-tolerant quantum computing with the parity code and noise-biased qubits</atitle><date>2024-04-17</date><risdate>2024</risdate><abstract>We present a fault-tolerant universal quantum computing architecture based on a code concatenation of noise-biased qubits and the parity architecture. The parity architecture can be understood as a LDPC code tailored specifically to obtain any desired logical connectivity from nearest neighbor physical interactions. The code layout can be dynamically adjusted to algorithmic requirements on-the-fly. This allows reaching arbitrary code distances and thereby exponential suppression of errors with a universal set of fault-tolerant gates. In addition to the previously explored tool-sets for concatenated cat codes, our approach features parallelizable interactions between arbitrary sets of qubits by directly addressing the parity qubits in the code. The proposed scheme enables codes with less physical qubit overhead compared to the repetition code with the same code distances, while requiring only weight-3 and weight-4 stabilizers and nearest neighbor 2D square-lattice connectivity.</abstract><doi>10.48550/arxiv.2404.11332</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2404.11332
ispartof
issn
language eng
recordid cdi_arxiv_primary_2404_11332
source arXiv.org
subjects Physics - Quantum Physics
title Fault-tolerant quantum computing with the parity code and noise-biased qubits
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-10T19%3A26%3A02IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Fault-tolerant%20quantum%20computing%20with%20the%20parity%20code%20and%20noise-biased%20qubits&rft.au=Messinger,%20Anette&rft.date=2024-04-17&rft_id=info:doi/10.48550/arxiv.2404.11332&rft_dat=%3Carxiv_GOX%3E2404_11332%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true