{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:55:36Z","timestamp":1773377736862,"version":"3.50.1"},"reference-count":25,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1855879,NSF-ERC 1941583"],"award-info":[{"award-number":["CCF-1855879,NSF-ERC 1941583"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9518154","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"1564-1569","source":"Crossref","is-referenced-by-count":1,"title":["Trapping Set Analysis of Finite-Length Quantum LDPC Codes"],"prefix":"10.1109","author":[{"given":"Nithin","family":"Raveendran","sequence":"first","affiliation":[{"name":"Center for Quantum Networks, University of Arizona,Department of Electrical and Computer Engineering,Tucson,AZ,85721"}]},{"given":"Bane","family":"Vasi\u0107","sequence":"additional","affiliation":[{"name":"Center for Quantum Networks, University of Arizona,Department of Electrical and Computer Engineering,Tucson,AZ,85721"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Decoding across the quantum LDPC code landscape","author":"roffe","year":"2020","journal-title":"ArXiv"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.090513.120443"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849833"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.100.012330"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.2988676"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1103\/PhysRevA.54.1098","article-title":"Good quantum error-correcting codes exist","volume":"54","author":"calderbank","year":"1996","journal-title":"Phys Rev A"},{"key":"ref16","author":"nielsen","year":"2011","journal-title":"Quantum Computation and Quantum Information 10th Anniversary Edition"},{"key":"ref17","author":"gottesman","year":"1997","journal-title":"Stabilizer codes and quantum error correction"},{"key":"ref18","first-page":"799","article-title":"Quantum LDPC codes with positive rate and minimum distance proportional to $n^{1\/2}$","author":"tillich","year":"2009","journal-title":"Proc IEEE Int Symp Inform Theory"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2017.7996747"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"1338","DOI":"10.26421\/QIC14.15-16-5","article-title":"Fault-tolerant quantum computation with constant overhead","volume":"14","author":"gottesman","year":"2014","journal-title":"Quantum Information and Computation"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.52.R2493"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.26421\/QIC8.10-8"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.87.020304"},{"key":"ref8","first-page":"299","article-title":"Chapter 6 - failures and error floors of iterative decoders","author":"vasi?","year":"2014","journal-title":"Channel Coding Theory Algorithms and Applications Academic Press Library in Mobile and Wireless Commun"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2015.2503267"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834737"},{"key":"ref9","article-title":"Degenerate quantum LDPC codes with good finite length performance","author":"panteleev","year":"2019","journal-title":"ArXiv"},{"key":"ref1","article-title":"Trapping sets of quantum LDPC codes","author":"raveendran","year":"2020","journal-title":"ArXiv"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/SIPS.2004.1363033"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173733"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2205663"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.88.012311"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2013.6502981"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284206"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09518154.pdf?arnumber=9518154","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:01Z","timestamp":1773347701000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9518154\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9518154","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}