{"id":"https://openalex.org/W4414231831","doi":"https://doi.org/10.1109/istc65386.2025.11154487","title":"Quantum LDPC Codes with Enhanced Error-Floor Performance under Min-Sum Decoding","display_name":"Quantum LDPC Codes with Enhanced Error-Floor Performance under Min-Sum Decoding","publication_year":2025,"publication_date":"2025-08-18","ids":{"openalex":"https://openalex.org/W4414231831","doi":"https://doi.org/10.1109/istc65386.2025.11154487"},"language":"en","primary_location":{"id":"doi:10.1109/istc65386.2025.11154487","is_oa":false,"landing_page_url":"https://doi.org/10.1109/istc65386.2025.11154487","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 13th International Symposium on Topics in Coding (ISTC)","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":"https://openalex.org/A5092537234","display_name":"Michele Pacenti","orcid":"https://orcid.org/0009-0002-9648-9041"},"institutions":[{"id":"https://openalex.org/I138006243","display_name":"University of Arizona","ror":"https://ror.org/03m2x1q45","country_code":"US","type":"education","lineage":["https://openalex.org/I138006243"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michele Pacenti","raw_affiliation_strings":["University of Arizona,Department of Electrical and Computer Engineering,Tucson,AZ,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Arizona,Department of Electrical and Computer Engineering,Tucson,AZ,USA","institution_ids":["https://openalex.org/I138006243"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048875408","display_name":"Dimitris Chytas","orcid":"https://orcid.org/0009-0006-7260-9263"},"institutions":[{"id":"https://openalex.org/I138006243","display_name":"University of Arizona","ror":"https://ror.org/03m2x1q45","country_code":"US","type":"education","lineage":["https://openalex.org/I138006243"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dimitris Chytas","raw_affiliation_strings":["University of Arizona,Department of Electrical and Computer Engineering,Tucson,AZ,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Arizona,Department of Electrical and Computer Engineering,Tucson,AZ,USA","institution_ids":["https://openalex.org/I138006243"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040676835","display_name":"Bane Vasi\u0107","orcid":"https://orcid.org/0000-0003-2365-4106"},"institutions":[{"id":"https://openalex.org/I138006243","display_name":"University of Arizona","ror":"https://ror.org/03m2x1q45","country_code":"US","type":"education","lineage":["https://openalex.org/I138006243"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bane Vasi\u0107","raw_affiliation_strings":["University of Arizona,Department of Electrical and Computer Engineering,Tucson,AZ,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Arizona,Department of Electrical and Computer Engineering,Tucson,AZ,USA","institution_ids":["https://openalex.org/I138006243"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11538236,"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":"5"},"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.9909999966621399,"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.9909999966621399,"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.9641000032424927,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/quantum-convolutional-code","display_name":"Quantum convolutional code","score":0.5453000068664551},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.4661000072956085},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.44839999079704285},{"id":"https://openalex.org/keywords/tornado-code","display_name":"Tornado code","score":0.44339999556541443},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.42800000309944153},{"id":"https://openalex.org/keywords/quantum-error-correction","display_name":"Quantum error correction","score":0.4268999993801117},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.40860000252723694},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.3953999876976013},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.3797999918460846},{"id":"https://openalex.org/keywords/quantum-algorithm","display_name":"Quantum algorithm","score":0.3741999864578247}],"concepts":[{"id":"https://openalex.org/C69497775","wikidata":"https://www.wikidata.org/wiki/Q7269025","display_name":"Quantum convolutional code","level":5,"score":0.5453000068664551},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5299999713897705},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4715000092983246},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.4661000072956085},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.44839999079704285},{"id":"https://openalex.org/C65058987","wikidata":"https://www.wikidata.org/wiki/Q7826005","display_name":"Tornado code","level":5,"score":0.44339999556541443},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.42800000309944153},{"id":"https://openalex.org/C51003876","wikidata":"https://www.wikidata.org/wiki/Q1536431","display_name":"Quantum error correction","level":4,"score":0.4268999993801117},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.420199990272522},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.40860000252723694},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.3953999876976013},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.3797999918460846},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.3741999864578247},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.3571000099182129},{"id":"https://openalex.org/C64948573","wikidata":"https://www.wikidata.org/wiki/Q625117","display_name":"BCJR algorithm","level":5,"score":0.3560999929904938},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.3472000062465668},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.33970001339912415},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32100000977516174},{"id":"https://openalex.org/C41241483","wikidata":"https://www.wikidata.org/wiki/Q7269015","display_name":"Quantum capacity","level":5,"score":0.32089999318122864},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.2985999882221222},{"id":"https://openalex.org/C128151799","wikidata":"https://www.wikidata.org/wiki/Q13563306","display_name":"Luby transform code","level":5,"score":0.2978000044822693},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29089999198913574},{"id":"https://openalex.org/C101252705","wikidata":"https://www.wikidata.org/wiki/Q7294373","display_name":"Raptor code","level":5,"score":0.2858999967575073},{"id":"https://openalex.org/C2777727622","wikidata":"https://www.wikidata.org/wiki/Q5251772","display_name":"Degeneracy (biology)","level":2,"score":0.2847000062465668},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.2842999994754791},{"id":"https://openalex.org/C169021753","wikidata":"https://www.wikidata.org/wiki/Q201972","display_name":"Reed\u2013Muller code","level":5,"score":0.2793000042438507},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.27489998936653137},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.2732999920845032},{"id":"https://openalex.org/C108509264","wikidata":"https://www.wikidata.org/wiki/Q5420758","display_name":"Expander code","level":5,"score":0.263700008392334},{"id":"https://openalex.org/C76132124","wikidata":"https://www.wikidata.org/wiki/Q5474786","display_name":"Fountain code","level":5,"score":0.2628999948501587},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.25519999861717224},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.25060001015663147}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/istc65386.2025.11154487","is_oa":false,"landing_page_url":"https://doi.org/10.1109/istc65386.2025.11154487","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 13th International Symposium on Topics in Coding (ISTC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"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":11,"referenced_works":["https://openalex.org/W2001732758","https://openalex.org/W2054649237","https://openalex.org/W2114207424","https://openalex.org/W2127370988","https://openalex.org/W2162312124","https://openalex.org/W3207833463","https://openalex.org/W3216957975","https://openalex.org/W4226332664","https://openalex.org/W4391530691","https://openalex.org/W4393234688","https://openalex.org/W4404037819"],"related_works":[],"abstract_inverted_index":{"Quantum":[0,20],"low-density":[1],"parity-check":[2],"codes":[3,22,29,51,114,134,151,157],"are":[4,23],"a":[5,24,66,119],"promising":[6],"approach":[7,143],"to":[8,81,129],"fault-tolerant":[9],"quantum":[10,45,132,149],"computation,":[11],"offering":[12],"potential":[13],"advantages":[14],"in":[15,100,158],"rate":[16],"and":[17,126,138],"decoding":[18,56],"efficiency.":[19],"Margulis":[21,46,133,150],"new":[25],"class":[26],"of":[27,97,122,135],"QLDPC":[28,101],"derived":[30],"from":[31],"Margulis'":[32],"classical":[33],"LDPC":[34],"construction":[35],"via":[36],"the":[37,94,159],"two-block":[38],"group":[39,90],"algebra":[40],"framework.":[41],"We":[42,140],"show":[43],"that":[44,148],"codes,":[47],"unlike":[48],"bivariate":[49],"bicycle":[50],"which":[52,86],"require":[53],"ordered":[54],"statistics":[55],"for":[57,111],"effective":[58],"error":[59,98,160],"correction,":[60],"can":[61],"be":[62],"efficiently":[63],"decoded":[64,74],"using":[65],"standard":[67],"min-sum":[68,164],"decoder":[69],"with":[70,115],"linear":[71],"complexity,":[72],"when":[73],"under":[75,163],"depolarizing":[76],"noise.":[77],"This":[78],"is":[79],"attributed":[80],"their":[82],"Tanner":[83],"graph":[84],"structure,":[85],"does":[87],"not":[88],"exhibit":[89],"symmetry,":[91],"thereby":[92],"mitigating":[93],"well-known":[95],"problem":[96],"degeneracy":[99],"decoding.":[102,165],"To":[103],"further":[104],"enhance":[105],"performance,":[106],"we":[107],"propose":[108],"an":[109],"algorithm":[110],"constructing":[112],"2BGA":[113],"controlled":[116],"girth,":[117],"ensuring":[118],"minimum":[120],"girth":[121],"6":[123],"or":[124],"8,":[125],"use":[127],"it":[128],"generate":[130],"several":[131],"length":[136],"240":[137],"642.":[139],"validate":[141],"our":[142],"through":[144],"numerical":[145],"simulations,":[146],"demonstrating":[147],"behave":[152],"significantly":[153],"better":[154],"than":[155],"BB":[156],"floor":[161],"region,":[162]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}