{"id":"https://openalex.org/W7134067571","doi":"https://doi.org/10.48550/arxiv.2603.05486","title":"Improved Decoding of Quantum Tanner Codes Using Generalized Check Nodes","display_name":"Improved Decoding of Quantum Tanner Codes Using Generalized Check Nodes","publication_year":2026,"publication_date":"2026-03-05","ids":{"openalex":"https://openalex.org/W7134067571","doi":"https://doi.org/10.48550/arxiv.2603.05486"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2603.05486","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5098579397","display_name":"Olai \u00c5. Mostad","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mostad, Olai \u00c5.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090738616","display_name":"Eirik Rosnes","orcid":"https://orcid.org/0000-0001-8236-6601"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rosnes, Eirik","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5037147907","display_name":"Hsuan-Yin Lin","orcid":"https://orcid.org/0000-0003-2309-054X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lin, Hsuan-Yin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.8859999775886536,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.8859999775886536,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11321","display_name":"Error Correcting Code Techniques","score":0.03720000013709068,"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/T10020","display_name":"Quantum Information and Cryptography","score":0.02969999983906746,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7372000217437744},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.515500009059906},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.5},{"id":"https://openalex.org/keywords/belief-propagation","display_name":"Belief propagation","score":0.48339998722076416},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4530999958515167},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.44859999418258667},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4009000062942505},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.3691999912261963}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7372000217437744},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5389000177383423},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.515500009059906},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.5},{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.48339998722076416},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4657000005245209},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4530999958515167},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.44859999418258667},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4318000078201294},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4009000062942505},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3874000012874603},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.3691999912261963},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.3555000126361847},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3529999852180481},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.34439998865127563},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.33550000190734863},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.32749998569488525},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.3091999888420105},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.298799991607666},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.27799999713897705},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.26829999685287476},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.25619998574256897},{"id":"https://openalex.org/C64341305","wikidata":"https://www.wikidata.org/wiki/Q4919225","display_name":"Bivariate analysis","level":2,"score":0.25589999556541443},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.2524999976158142}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2603.05486","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2603.05486","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.05486","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2603.05486","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,58],"study":[1,60],"the":[2,13,37,50,61,67,79,90,168],"decoding":[3,34,36,56],"problem":[4],"for":[5,28,73,124,129,167],"quantum":[6,74,111],"Tanner":[7,75],"codes":[8,76,100],"and":[9,64,138],"propose":[10,117],"to":[11,121,143],"exploit":[12],"underlying":[14],"local":[15],"code":[16],"structure":[17],"by":[18,35,147],"grouping":[19],"check":[20,26,51],"nodes":[21,27],"into":[22,151],"more":[23,152],"powerful":[24,153],"generalized":[25,38,70,97,125],"enhanced":[29,69],"iterative":[30],"belief":[31],"propagation":[32],"(BP)":[33],"checks":[39,123,150],"using":[40],"a":[41,43,118,163],"maximum":[42],"posteriori":[44],"(MAP)":[45],"decoder":[46,72,83],"as":[47,87,89],"part":[48],"of":[49,54,110],"node":[52],"processing":[53],"each":[55],"iteration.":[57],"mainly":[59],"finite-length":[62],"setting":[63],"show":[65],"that":[66],"proposed":[68,92],"BP":[71,82,126],"significantly":[77],"outperforms":[78],"standard":[80],"quaternary":[81],"with":[84,101],"memory":[85],"effects,":[86],"well":[88],"recently":[91],"Relay-BP":[93],"decoder,":[94],"even":[95],"outperforming":[96],"bicycle":[98,133],"(GB)":[99],"comparable":[102],"parameters":[103],"in":[104],"some":[105],"cases.":[106],"For":[107],"other":[108],"classes":[109],"low-density":[112],"parity-check":[113],"(qLDPC)":[114],"codes,":[115,131,134,137,140],"we":[116,160],"greedy":[119],"algorithm":[120],"combine":[122],"decoding.":[127],"However,":[128],"GB":[130],"bivariate":[132],"hypergraph":[135],"product":[136],"lifted-product":[139],"there":[141],"seems":[142],"be":[144],"limited":[145],"gain":[146],"combining":[148],"simple":[149],"ones.":[154],"To":[155],"back":[156],"up":[157],"our":[158],"findings,":[159],"also":[161],"provide":[162],"theoretical":[164],"cycle":[165],"analysis":[166],"considered":[169],"qLDPC":[170],"codes.":[171]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-03-07T00:00:00"}