{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T06:54:57Z","timestamp":1729666497143,"version":"3.28.0"},"reference-count":48,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,2]]},"DOI":"10.1109\/ita.2013.6502967","type":"proceedings-article","created":{"date-parts":[[2013,4,26]],"date-time":"2013-04-26T21:30:12Z","timestamp":1367011812000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Linked-cluster technique for finding the distance of a quantum LDPC code"],"prefix":"10.1109","author":[{"given":"A. A.","family":"Kovalev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"Dumer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L. P.","family":"Pryadko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.2.011006"},{"journal-title":"Integral Hecke Modules Integral Generalized Reedmuller Codes and Linear Codes","year":"1996","author":"zimmermann","key":"35"},{"journal-title":"New Constructions of CSS Codes Obtained by Moving to Higher Alphabets","year":"2012","author":"andriyanova","key":"17"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-37634-7_13"},{"key":"18","article-title":"Fault-tolerance of \"bad\" quantum low-density parity check codes","author":"kovalev","year":"2012","journal-title":"Phys Rev Lett [Online]"},{"key":"33","first-page":"1","volume":"19","year":"1983","journal-title":"Prob Inf Transm (USSR)"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284206"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1109\/18.556688"},{"journal-title":"Quantum \"Hyperbicycle\" Low-density Parity Check Codes with Finite Rate","year":"2012","author":"kovalev","key":"16"},{"key":"39","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.54.1098"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834737"},{"key":"14","first-page":"799","article-title":"Quantum ldpc codes with positive rate and minimum distance proportional to ?n","author":"tillich","year":"0","journal-title":"Information Theory 2009 ISIT 2009 IEEE International Symposium on 28 2009-july 3 2009"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261958"},{"journal-title":"A Primer on Surface Codes Developing a Machine Language for a Quantum Computer","year":"2012","author":"fowler","key":"11"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838088"},{"journal-title":"A Proposed Quantum Low Density Parity Check Code","year":"2001","author":"postol","key":"12"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1126\/science.1107572"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1038\/nature02015"},{"key":"43","doi-asserted-by":"publisher","DOI":"10.1109\/18.57202"},{"key":"42","first-page":"103","article-title":"Decoding complexity bound for linear block codes","volume":"25","author":"kruk","year":"1989","journal-title":"Probl Peredachi Inf"},{"key":"41","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0019850"},{"key":"40","doi-asserted-by":"publisher","DOI":"10.1109\/18.21270"},{"key":"48","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/20\/18\/059"},{"key":"45","first-page":"24","article-title":"Two decoding algorithms for linear codes","volume":"25","author":"dumer","year":"1989","journal-title":"Probl Peredachi Informacii (USSR)"},{"journal-title":"Probabilistic Methods in Combinatorics","year":"1974","author":"erdos","key":"44"},{"key":"47","doi-asserted-by":"publisher","DOI":"10.1109\/18.904512"},{"key":"46","first-page":"17","volume":"25","year":"1989","journal-title":"Probl Inf Transm"},{"key":"22","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1038\/nphys961","article-title":"Towards fault-tolerant quantum computing with trapped ions","volume":"4","author":"benhelm","year":"2008","journal-title":"Nature Physics"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1038\/nphys1032"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.70.1895"},{"key":"25","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1038\/46503","article-title":"Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations","volume":"402","author":"gottesman","year":"1999","journal-title":"Nature"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.110.070503"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"journal-title":"Information Theory Inference & Learning Algorithms","year":"2002","author":"mackay","key":"28"},{"key":"29","first-page":"987","article-title":"On the iterative decoding of sparse quantum codes","volume":"8","author":"poulin","year":"2008","journal-title":"Quant Inform Comp"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.54.3824"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.55.900"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.104.050503"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.52.R2493"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2167593"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.83.020302"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.98.190504"},{"key":"32","first-page":"3","article-title":"Complexity of decoding for linear codes","volume":"19","author":"evseev","year":"1983","journal-title":"Probl Peredachi Informacii (USSR)"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1063\/1.1499754"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1109\/18.681315"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/S0003-4916(02)00018-0"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.2.021004"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.86.032324"}],"event":{"name":"2013 Information Theory and Applications Workshop (ITA 2013)","start":{"date-parts":[[2013,2,10]]},"location":"San Diego, CA","end":{"date-parts":[[2013,2,15]]}},"container-title":["2013 Information Theory and Applications Workshop (ITA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6495586\/6502916\/06502967.pdf?arnumber=6502967","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T12:03:41Z","timestamp":1498046621000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6502967\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2]]},"references-count":48,"URL":"https:\/\/doi.org\/10.1109\/ita.2013.6502967","relation":{},"subject":[],"published":{"date-parts":[[2013,2]]}}}