{"id":"https://openalex.org/W3126181091","doi":"https://doi.org/10.1109/focs46700.2020.00029","title":"Decodable quantum LDPC codes beyond the square root distance barrier using high dimensional expanders","display_name":"Decodable quantum LDPC codes beyond the square root distance barrier using high dimensional expanders","publication_year":2020,"publication_date":"2020-11-01","ids":{"openalex":"https://openalex.org/W3126181091","doi":"https://doi.org/10.1109/focs46700.2020.00029","mag":"3126181091"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs46700.2020.00029","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5010782723","display_name":"Shai Evra","orcid":null},"institutions":[{"id":"https://openalex.org/I40036882","display_name":"Institute for Advanced Study","ror":"https://ror.org/00f809463","country_code":"US","type":"funder","lineage":["https://openalex.org/I40036882"]},{"id":"https://openalex.org/I4210108547","display_name":"EarthTech International (United States)","ror":"https://ror.org/01mjdf856","country_code":"US","type":"company","lineage":["https://openalex.org/I4210108547"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shai Evra","raw_affiliation_strings":["Institute for Advanced Studies, Princeton, USA"],"affiliations":[{"raw_affiliation_string":"Institute for Advanced Studies, Princeton, USA","institution_ids":["https://openalex.org/I40036882","https://openalex.org/I4210108547"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109110331","display_name":"Tali Kaufman","orcid":null},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"funder","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Tali Kaufman","raw_affiliation_strings":["Bar-Ilan University, Israel"],"affiliations":[{"raw_affiliation_string":"Bar-Ilan University, Israel","institution_ids":["https://openalex.org/I13955877"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064676731","display_name":"Gilles Z\u00e9mor","orcid":"https://orcid.org/0000-0002-6041-9554"},"institutions":[{"id":"https://openalex.org/I4210166017","display_name":"Institut de Math\u00e9matiques de Bordeaux","ror":"https://ror.org/05m3r1b84","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I15057530","https://openalex.org/I4210141950","https://openalex.org/I4210160189","https://openalex.org/I4210166017"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Gilles Zemor","raw_affiliation_strings":["Institut de Math\u00e9matiques de Bordeaux, UMR 5251, universit\u00e9 de Bordeaux, Bordeaux, France"],"affiliations":[{"raw_affiliation_string":"Institut de Math\u00e9matiques de Bordeaux, UMR 5251, universit\u00e9 de Bordeaux, Bordeaux, France","institution_ids":["https://openalex.org/I4210166017"]}]}],"institution_assertions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.959,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.859501,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"218","last_page":"227"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9999,"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.9999,"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/T11130","display_name":"Coding theory and cryptography","score":0.9967,"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.9944,"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/square-root","display_name":"Square root","score":0.54788625},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.50708437},{"id":"https://openalex.org/keywords/square","display_name":"Square (algebra)","score":0.49189043},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.4678657},{"id":"https://openalex.org/keywords/root","display_name":"Root (linguistics)","score":0.41698885}],"concepts":[{"id":"https://openalex.org/C131220774","wikidata":"https://www.wikidata.org/wiki/Q1441456","display_name":"Ramanujan's sum","level":2,"score":0.614638},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.6087812},{"id":"https://openalex.org/C11577676","wikidata":"https://www.wikidata.org/wiki/Q134237","display_name":"Square root","level":2,"score":0.54788625},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.50708437},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49869108},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49484485},{"id":"https://openalex.org/C135692309","wikidata":"https://www.wikidata.org/wiki/Q111124","display_name":"Square (algebra)","level":2,"score":0.49189043},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.47019634},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.4678657},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.45989802},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.4247074},{"id":"https://openalex.org/C171078966","wikidata":"https://www.wikidata.org/wiki/Q111029","display_name":"Root (linguistics)","level":2,"score":0.41698885},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.41168475},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3042736},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2771693},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.25192493},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.19977856},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.18491006},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.14993754},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.10324147},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs46700.2020.00029","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[{"funder":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation","award_id":"DMS-1638352"},{"funder":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche","award_id":"ANR-18-CE47-0010"},{"funder":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council","award_id":null}],"datasets":[],"versions":[],"referenced_works_count":37,"referenced_works":["https://openalex.org/W1531594186","https://openalex.org/W1549436331","https://openalex.org/W1841286492","https://openalex.org/W1948567022","https://openalex.org/W1971516277","https://openalex.org/W2002761492","https://openalex.org/W2006469590","https://openalex.org/W2017925055","https://openalex.org/W2018047324","https://openalex.org/W2024269665","https://openalex.org/W2048984244","https://openalex.org/W2114207424","https://openalex.org/W2131690084","https://openalex.org/W2135273380","https://openalex.org/W2255379171","https://openalex.org/W2293231900","https://openalex.org/W2509331039","https://openalex.org/W280079156","https://openalex.org/W2894935780","https://openalex.org/W2962692965","https://openalex.org/W2962777863","https://openalex.org/W2963091690","https://openalex.org/W2963265122","https://openalex.org/W2963410169","https://openalex.org/W2964140423","https://openalex.org/W2964321404","https://openalex.org/W2972821414","https://openalex.org/W3040586665","https://openalex.org/W3100206575","https://openalex.org/W3102685293","https://openalex.org/W3102818703","https://openalex.org/W3103222061","https://openalex.org/W3104757600","https://openalex.org/W3106097399","https://openalex.org/W340661644","https://openalex.org/W4210453336","https://openalex.org/W4253902644"],"related_works":["https://openalex.org/W4290033678","https://openalex.org/W4287271148","https://openalex.org/W4255310570","https://openalex.org/W4241348014","https://openalex.org/W4232537912","https://openalex.org/W3168862451","https://openalex.org/W3166507069","https://openalex.org/W2984694848","https://openalex.org/W204312252","https://openalex.org/W1994612030"],"abstract_inverted_index":{"Constructing":[0],"quantum":[1,50,88,92,148,164,185,224],"LDPC":[2,70,93,165,186,225],"codes":[3,53,94],"with":[4,66],"a":[5,12,20,56,60,67,73,78,112,123,134,160,170,178,184],"minimum":[6,96,151,189],"distance":[7,97,152,190],"that":[8,34,54,76,129,216],"grows":[9],"faster":[10],"than":[11],"square":[13,100,113,135,220],"root":[14,101,114,221],"of":[15,23,80,87,102,115,136,139,150,177,188,206],"the":[16,24,84,99,103,116,120,137,140,175,203,207,211,219],"length":[17,105],"has":[18],"been":[19],"major":[21],"challenge":[22,28],"field.":[25],"With":[26],"this":[27],"in":[29,39,145],"mind,":[30],"we":[31,90,127,168,182],"investigate":[32],"constructions":[33],"come":[35],"from":[36],"high-dimensional":[37],"expanders,":[38],"particular":[40],"Ramanujan":[41,125,172,180],"complexes.":[42],"These":[43],"naturally":[44],"give":[45],"rise":[46],"to":[47,111,209],"very":[48],"unbalanced":[49],"error":[51],"correcting":[52],"have":[55],"large":[57],"X-distance":[58],"but":[59],"much":[61],"smaller":[62],"Z-distance.":[63],"However,":[64],"together":[65],"classical":[68],"expander":[69],"code":[71,104,117,149,187],"and":[72,82,106,158],"tensoring":[74],"method":[75],"generalises":[77],"construction":[79,86],"Hastings":[81],"also":[83],"Tillich-Zemor":[85],"codes,":[89],"obtain":[91,183],"whose":[95,107],"exceeds":[98],"dimension":[108],"comes":[109],"close":[110],"length.":[118],"When":[119,167],"ingredient":[121],"is":[122],"3-dimensional":[124,179],"complex,":[126,173,181],"show":[128],"its":[130],"2-systole":[131],"behaves":[132],"like":[133],"log":[138,195],"complex":[141,208],"size,":[142],"which":[143],"results":[144],"an":[146],"overall":[147],"n":[153,191],"1/2":[156,194,198],"logn,":[157],"sets":[159],"new":[161],"record":[162],"for":[163,223],"codes.":[166,226],"use":[169],"2-dimensional":[171],"or":[174],"2-skeleton":[176],"n.":[199],"We":[200],"then":[201],"exploit":[202],"expansion":[204],"properties":[205],"devise":[210],"first":[212],"polynomial":[213],"time":[214],"algorithm":[215],"decodes":[217],"above":[218],"barrier":[222]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W3126181091","counts_by_year":[{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":14},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2}],"updated_date":"2025-04-16T10:14:50.268717","created_date":"2021-02-15"}