{"id":"https://openalex.org/W7092546779","doi":"https://doi.org/10.1109/isit63088.2025.11195585","title":"Belief Propagation Decoding on a Sparsified Graph Ensemble of the Surface Code","display_name":"Belief Propagation Decoding on a Sparsified Graph Ensemble of the Surface Code","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W7092546779","doi":"https://doi.org/10.1109/isit63088.2025.11195585"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195585","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195585","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Boqing Zhang","orcid":null},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Boqing Zhang","raw_affiliation_strings":["Duke Quantum Center, Duke University,Durham,NC,USA"],"affiliations":[{"raw_affiliation_string":"Duke Quantum Center, Duke University,Durham,NC,USA","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Hanwen Yao","orcid":null},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hanwen Yao","raw_affiliation_strings":["Duke Quantum Center, Duke University,Durham,NC,USA"],"affiliations":[{"raw_affiliation_string":"Duke Quantum Center, Duke University,Durham,NC,USA","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"last","author":{"id":null,"display_name":"Henry D. Pfister","orcid":null},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Henry D. Pfister","raw_affiliation_strings":["Duke Quantum Center, Duke University,Durham,NC,USA"],"affiliations":[{"raw_affiliation_string":"Duke Quantum Center, Duke University,Durham,NC,USA","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I170897317"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.56642244,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9455000162124634,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9455000162124634,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.014700000174343586,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11458","display_name":"Advanced Wireless Communication Technologies","score":0.008200000040233135,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/belief-propagation","display_name":"Belief propagation","score":0.8611000180244446},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6567000150680542},{"id":"https://openalex.org/keywords/factor-graph","display_name":"Factor graph","score":0.6159999966621399},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4726000130176544},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.43230000138282776},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4106000065803528},{"id":"https://openalex.org/keywords/surface","display_name":"Surface (topology)","score":0.4050000011920929}],"concepts":[{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.8611000180244446},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6567000150680542},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.6159999966621399},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5454000234603882},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5432999730110168},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4726000130176544},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.43230000138282776},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4106000065803528},{"id":"https://openalex.org/C2776799497","wikidata":"https://www.wikidata.org/wiki/Q484298","display_name":"Surface (topology)","level":2,"score":0.4050000011920929},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.3343000113964081},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.31929999589920044},{"id":"https://openalex.org/C123614077","wikidata":"https://www.wikidata.org/wiki/Q1364905","display_name":"Propagation of uncertainty","level":2,"score":0.3142000138759613},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31189998984336853},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.28139999508857727},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2793000042438507},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.2777000069618225},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.2549000084400177},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2533000111579895},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2515000104904175}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195585","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195585","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G523548219","display_name":null,"funder_award_id":"2120757,2106213","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1850344377","https://openalex.org/W2051540665","https://openalex.org/W2094848842","https://openalex.org/W2114207424","https://openalex.org/W2131690084","https://openalex.org/W2132914434","https://openalex.org/W2135273380","https://openalex.org/W2215279005","https://openalex.org/W2566505556","https://openalex.org/W2616493737","https://openalex.org/W2997228950","https://openalex.org/W3025282692","https://openalex.org/W3112993639","https://openalex.org/W3206809046","https://openalex.org/W3207833463","https://openalex.org/W3216521614","https://openalex.org/W4281396526","https://openalex.org/W4379801991","https://openalex.org/W4401693145"],"related_works":[],"abstract_inverted_index":{"This":[0],"work":[1],"exploits":[2],"the":[3,23,44,64,91,105,130,156],"product":[4,33],"structure":[5,34],"of":[6,43,96,118,141,159],"surface":[7,25,146],"codes":[8,147],"to":[9,30,35,109],"improve":[10],"their":[11],"belief":[12],"propagation":[13],"(BP)":[14],"decoding":[15,120],"performance.":[16],"To":[17,102],"promote":[18],"BP":[19,81,89,128],"convergence,":[20],"we":[21,78,114],"sparsify":[22],"original":[24,92],"code":[26],"graph":[27,86,93],"with":[28],"respect":[29],"its":[31,37],"topological":[32],"break":[36],"dominant":[38],"short":[39],"cycles.":[40],"Analytical":[41],"justification":[42],"proposed":[45],"sparsification":[46],"methods":[47],"is":[48,69],"provided":[49],"through":[50],"analysis":[51],"and":[52,74,98],"minimum-weight":[53],"perfect":[54],"matching":[55,155],"(MWPM)":[56],"on":[57,82,90,129,145],"sparsified":[58,85,119],"graphs.":[59,121],"The":[60],"results":[61,123],"demonstrate":[62],"that":[63,80,125],"increase":[65],"in":[66,71,94],"logical":[67],"error":[68,100],"well-controlled":[70],"both":[72],"worst-case":[73],"average-case":[75],"scenarios.":[76],"Practically,":[77],"show":[79,124],"a":[83,139],"single":[84],"significantly":[87],"outperforms":[88],"terms":[95],"convergence":[97],"total":[99],"rate.":[101],"further":[103],"address":[104],"performance":[106],"loss":[107],"relative":[108],"MWPM":[110],"caused":[111],"by":[112],"sparsification,":[113],"construct":[115],"an":[116],"ensemble":[117],"Numerical":[122],"running":[126],"standard":[127],"ensemble,":[131],"without":[132],"any":[133],"post-processing":[134],"or":[135],"auxiliary":[136],"subroutines,":[137],"achieves":[138],"threshold":[140,158],"9.":[142,161],"0":[143],"\\%":[144],"under":[148],"Pauli-":[149],"<tex":[150],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[151],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$X$</tex>":[152],"noise,":[153],"closely":[154],"BP-OSD":[157],"approximately":[160],"1":[162],"\\%.":[163]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-21T00:00:00"}