{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T00:52:42Z","timestamp":1783039962940,"version":"3.54.6"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000765","name":"University College London Quantum Science and Technology Institute (UCLQ) Fellowship","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000765","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council (EPSRC) Prosperity Partnership in Quantum Software for Simulation and Modelling","doi-asserted-by":"publisher","award":["EP\/S005021\/1"],"award-info":[{"award-number":["EP\/S005021\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1109\/tit.2021.3097347","type":"journal-article","created":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T23:44:32Z","timestamp":1628639072000},"page":"6653-6674","source":"Crossref","is-referenced-by-count":141,"title":["Balanced Product Quantum Codes"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7211-5515","authenticated-orcid":false,"given":"Nikolas P.","family":"Breuckmann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jens N.","family":"Eberhardt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2726064"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/18.75250"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/BF03322451"},{"key":"ref32","author":"magnus","year":"1974","journal-title":"Noneuclidean Tessellations and Their Groups"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1063\/1.4891487"},{"key":"ref30","first-page":"7190","article-title":"Super-approximation, I: $\\mathfrak{p}$\n-adic semisimple case","volume":"2017","author":"golsefidy","year":"2017","journal-title":"Int Math Res Notices"},{"key":"ref37","volume":"12","author":"van lint","year":"2012","journal-title":"Introduction to Coding Theory and Algebraic Geometry"},{"key":"ref36","article-title":"Edge transitive Ramanujan graphs and highly symmetric LDPC good codes","author":"kaufman","year":"2011","journal-title":"arXiv 1108 2960"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16367-8_25"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.2307\/2048345"},{"key":"ref10","article-title":"Quantum LDPC codes with almost linear minimum distance","author":"panteleev","year":"2020","journal-title":"arXiv 2012 04068"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00076"},{"key":"ref11","author":"james","year":"2012","journal-title":"General Topology and Homotopy Theory"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2292061"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.556667"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF02126799"},{"key":"ref15","article-title":"Single-shot decoding of linear rate LDPC quantum codes with high performance","author":"breuckmann","year":"2020","journal-title":"arXiv 2001 03568"},{"key":"ref16","article-title":"Weight reduction for quantum codes","author":"hastings","year":"2016","journal-title":"arXiv 1611 03790"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/12\/8\/083039"},{"key":"ref18","article-title":"Homological quantum codes beyond the toric code","author":"breuckmann","year":"2017"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.87.307"},{"key":"ref28","volume":"55","author":"davidoff","year":"2003","journal-title":"Elementary Number Theory Group Theory and Ramanujan Graphs"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316384"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70766-0"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8113\/47\/19\/195304"},{"key":"ref6","article-title":"Decodable quantum LDPC codes beyond the ${\\sqrt{n}}$\n distance barrier using high dimensional expanders","author":"evra","year":"2020","journal-title":"arXiv 2004 07935"},{"key":"ref29","article-title":"Constructing highly regular expanders from hyperbolic coxeter groups","author":"conder","year":"2020","journal-title":"arXiv 2009 08548"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1201\/9781420035377.ch12"},{"key":"ref8","article-title":"Fiber bundle codes","author":"hastings","year":"2020","journal-title":"arXiv preprint arXiv 2009 02026"},{"key":"ref7","first-page":"1317","article-title":"New cosystolic expanders from tensors imply explicit quantum LDPC codes with $\\omega(\\sqrt{n}\\log^{k}n)$\n distance","author":"kaufman","year":"2020","journal-title":"Proc 53rd Annu ACM SIGACT Symp Theory Comput"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2663199"},{"key":"ref1","article-title":"LDPC quantum codes","author":"breuckmann","year":"2021","journal-title":"arXiv 2103 06309"},{"key":"ref9","article-title":"Degenerate quantum LDPC codes with good finite length performance","author":"panteleev","year":"2019","journal-title":"arXiv 1904 02703"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1063\/1.2731356"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2866577"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1142\/S0219749914300010"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"ref42","volume":"149","author":"ratcliffe","year":"2006","journal-title":"Foundations of Hyperbolic Manifolds"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.122.230501"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-12492-5"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1215\/S0012-7094-03-11812-8"},{"key":"ref25","article-title":"Graph codes and local systems","author":"meshulam","year":"2018","journal-title":"arXiv 1803 05643"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555700"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9539105\/09490244.pdf?arnumber=9490244","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:30Z","timestamp":1652194470000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9490244\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10]]},"references-count":43,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2021.3097347","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10]]}}}