{"id":"https://openalex.org/W3000457094","doi":"https://doi.org/10.1109/tit.2021.3122352","title":"Single-Shot Decoding of Linear Rate LDPC Quantum Codes With High Performance","display_name":"Single-Shot Decoding of Linear Rate LDPC Quantum Codes With High Performance","publication_year":2021,"publication_date":"2021-10-26","ids":{"openalex":"https://openalex.org/W3000457094","doi":"https://doi.org/10.1109/tit.2021.3122352","mag":"3000457094"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2021.3122352","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2021.3122352","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2001.03568","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019795211","display_name":"Nikolas P. Breuckmann","orcid":"https://orcid.org/0000-0002-7211-5515"},"institutions":[{"id":"https://openalex.org/I45129253","display_name":"University College London","ror":"https://ror.org/02jx3x895","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I45129253"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Nikolas P. Breuckmann","raw_affiliation_strings":["Department of Physics and Astronomy, University College London, London, U.K","University College London\u2020"],"raw_orcid":"https://orcid.org/0000-0002-7211-5515","affiliations":[{"raw_affiliation_string":"Department of Physics and Astronomy, University College London, London, U.K","institution_ids":["https://openalex.org/I45129253"]},{"raw_affiliation_string":"University College London\u2020","institution_ids":["https://openalex.org/I45129253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029286279","display_name":"Vivien Londe","orcid":"https://orcid.org/0000-0003-3254-1349"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Vivien Londe","raw_affiliation_strings":["SECRET Team, Inria, Paris, France","French Institute for Research in Computer Science and Automation"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"SECRET Team, Inria, Paris, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"French Institute for Research in Computer Science and Automation","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5019795211"],"corresponding_institution_ids":["https://openalex.org/I45129253"],"apc_list":null,"apc_paid":null,"fwci":0.5599,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.71619647,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"68","issue":"1","first_page":"272","last_page":"286"},"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.9998999834060669,"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.9998999834060669,"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.9994000196456909,"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/T11130","display_name":"Coding theory and cryptography","score":0.9990000128746033,"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/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.747832179069519},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6659642457962036},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5497848391532898},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5101768970489502},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.42633092403411865},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40731728076934814},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38774263858795166},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.25254982709884644}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.747832179069519},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6659642457962036},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5497848391532898},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5101768970489502},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.42633092403411865},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40731728076934814},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38774263858795166},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.25254982709884644},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1109/tit.2021.3122352","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2021.3122352","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2001.03568","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2001.03568","pdf_url":"https://arxiv.org/pdf/2001.03568","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire/932c626d-8dec-4691-97b9-e14da439d87c","is_oa":true,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/932c626d-8dec-4691-97b9-e14da439d87c","pdf_url":"https://research-information.bris.ac.uk/files/356258272/2001.03568v1.pdf","source":{"id":"https://openalex.org/S7407055359","display_name":"Explore Bristol Research","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Breuckmann, N P & Londe, V 2022, 'Single-Shot Decoding of Linear Rate LDPC Quantum Codes with High Performance', IEEE Transactions on Information Theory, vol. 68, no. 1, pp. 272-286. https://doi.org/10.1109/TIT.2021.3122352","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"mag:3000457094","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/2001.03568.pdf","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:eprints.ucl.ac.uk.OAI2:10142042","is_oa":false,"landing_page_url":"https://discovery.ucl.ac.uk/id/eprint/10142042/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400024","display_name":"UCL Discovery (University College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45129253","host_organization_name":"University College London","host_organization_lineage":["https://openalex.org/I45129253"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"   IEEE Transactions on Information Theory , 68  (1)   pp. 272-286.   (2022)      ","raw_type":"Article"},{"id":"pmh:oai:research-information.bris.ac.uk:publications/932c626d-8dec-4691-97b9-e14da439d87c","is_oa":true,"landing_page_url":"https://hdl.handle.net/1983/932c626d-8dec-4691-97b9-e14da439d87c","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Breuckmann, N P & Londe, V 2022, 'Single-Shot Decoding of Linear Rate LDPC Quantum Codes with High Performance', IEEE Transactions on Information Theory, vol. 68, no. 1, pp. 272-286. https://doi.org/10.1109/TIT.2021.3122352","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"doi:10.48550/arxiv.2001.03568","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2001.03568","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-journal"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2001.03568","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2001.03568","pdf_url":"https://arxiv.org/pdf/2001.03568","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":59,"referenced_works":["https://openalex.org/W21223778","https://openalex.org/W51037165","https://openalex.org/W142413548","https://openalex.org/W201529831","https://openalex.org/W642718757","https://openalex.org/W1516979491","https://openalex.org/W1519444547","https://openalex.org/W1531594186","https://openalex.org/W1536930200","https://openalex.org/W1551760671","https://openalex.org/W1570262040","https://openalex.org/W1680774422","https://openalex.org/W1734915372","https://openalex.org/W1965431137","https://openalex.org/W1979779904","https://openalex.org/W1981478036","https://openalex.org/W1984021697","https://openalex.org/W1993300283","https://openalex.org/W1999706070","https://openalex.org/W2003881862","https://openalex.org/W2009989296","https://openalex.org/W2017925055","https://openalex.org/W2045873381","https://openalex.org/W2052524636","https://openalex.org/W2088636071","https://openalex.org/W2105776550","https://openalex.org/W2107453273","https://openalex.org/W2141042941","https://openalex.org/W2147590609","https://openalex.org/W2157276712","https://openalex.org/W2272435756","https://openalex.org/W2569950459","https://openalex.org/W2592683362","https://openalex.org/W2779722655","https://openalex.org/W2892395081","https://openalex.org/W2894247456","https://openalex.org/W2896387136","https://openalex.org/W2926023653","https://openalex.org/W2962692965","https://openalex.org/W2963181604","https://openalex.org/W2964140423","https://openalex.org/W3092764718","https://openalex.org/W3100736866","https://openalex.org/W3102685293","https://openalex.org/W3103222061","https://openalex.org/W3104757600","https://openalex.org/W3122783844","https://openalex.org/W3163123156","https://openalex.org/W3197075912","https://openalex.org/W3207755657","https://openalex.org/W4206142531","https://openalex.org/W4241903089","https://openalex.org/W4243844488","https://openalex.org/W4253687655","https://openalex.org/W4292166790","https://openalex.org/W6682768736","https://openalex.org/W6755788883","https://openalex.org/W6761072974","https://openalex.org/W6800376655"],"related_works":["https://openalex.org/W3210923590","https://openalex.org/W3102818703","https://openalex.org/W3100736866","https://openalex.org/W3103222061","https://openalex.org/W2107453273","https://openalex.org/W3198897330","https://openalex.org/W224478164","https://openalex.org/W795131408","https://openalex.org/W2089660407","https://openalex.org/W2991133842","https://openalex.org/W3126181091","https://openalex.org/W2926023653","https://openalex.org/W2293231900","https://openalex.org/W2164424155","https://openalex.org/W2135273380","https://openalex.org/W2119388976","https://openalex.org/W2114207424","https://openalex.org/W2030867075","https://openalex.org/W1839785972"],"abstract_inverted_index":{"We":[0,87],"construct":[1],"and":[2,37,58,84,112],"analyze":[3],"a":[4,14,89,169],"family":[5,43],"of":[6,48,63,69,75,102,134,171],"low-density":[7],"parity":[8,153],"check":[9,154],"(LDPC)":[10],"quantum":[11],"codes":[12],"with":[13,148,168,179],"linear":[15,79],"encoding":[16,94],"rate,":[17],"distance":[18],"scaling":[19],"as":[20,53],"<inline-formula":[21,29,96,103],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[22,30,97,104],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">":[23,31,98,105],"<tex-math":[24,32,99,106],"notation=\"LaTeX\">$n^\\epsilon":[25],"$":[26,110],"</tex-math></inline-formula>":[27,36,101,111],"for":[28,120],"notation=\"LaTeX\">$\\epsilon":[33],"&gt;":[34],"0$":[35],"efficient":[38],"decoding":[39,132,144],"schemes.":[40],"The":[41,60],"code":[42],"is":[44,66,118,166],"based":[45],"on":[46,92],"tessellations":[47],"closed,":[49],"four-dimensional,":[50],"hyperbolic":[51],"manifolds,":[52],"first":[54],"suggested":[55],"by":[56],"Guth":[57],"Lubotzky.":[59],"main":[61],"contribution":[62],"this":[64],"work":[65],"the":[67,93,116,121,175,183],"construction":[68],"suitable":[70],"manifolds":[71],"via":[72],"finite":[73],"presentations":[74],"Coxeter":[76],"groups,":[77],"their":[78],"representations":[80],"over":[81],"Galois":[82],"fields":[83],"topological":[85],"coverings.":[86],"establish":[88],"lower":[90],"bound":[91,117],"rate":[95],"notation=\"LaTeX\">$k/n$":[100],"notation=\"LaTeX\">$13/72":[107],"=":[108],"0.180\\ldots":[109],"we":[113,124],"show":[114],"that":[115,123,130,152],"tight":[119],"examples":[122],"construct.":[125],"Numerical":[126],"simulations":[127],"give":[128],"evidence":[129],"parallelizable":[131],"schemes":[133,145],"low":[135],"computational":[136],"complexity":[137],"suffice":[138],"to":[139,159,162],"obtain":[140],"high":[141],"performance.":[142],"These":[143],"can":[146],"deal":[147],"syndrome":[149,180],"noise,":[150],"so":[151],"measurements":[155],"do":[156],"not":[157],"have":[158],"be":[160],"repeated":[161],"decode.":[163],"Our":[164],"data":[165],"consistent":[167],"threshold":[170],"around":[172],"4%":[173],"in":[174,182],"phenomenological":[176],"noise":[177,181],"model":[178],"single-shot":[184],"regime.":[185]},"counts_by_year":[{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}