{"id":"https://openalex.org/W7214722336","doi":"https://doi.org/10.48550/arxiv.2609.33956","title":"Hardness of Approximating Quantum Code Distance Beyond $\\sqrt{N}$","display_name":"Hardness of Approximating Quantum Code Distance Beyond $\\sqrt{N}$","publication_year":2026,"publication_date":"2026-09-27","ids":{"openalex":"https://openalex.org/W7214722336","doi":"https://doi.org/10.48550/arxiv.2609.33956"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2609.33956","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.33956","pdf_url":"https://arxiv.org/pdf/2609.33956","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2609.33956","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078314463","display_name":"Upendra Kapshikar","orcid":"https://orcid.org/0009-0004-4747-2600","observed_orcids":["https://orcid.org/0009-0004-4747-2600"]},"institutions":[{"id":"https://openalex.org/I153718931","display_name":"University of Ottawa","ror":"https://ror.org/03c4mmv16","country_code":"CA","type":"education","lineage":["https://openalex.org/I153718931"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Kapshikar, Upendra","raw_affiliation_strings":["University of Ottawa"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Ottawa","institution_ids":["https://openalex.org/I153718931"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5078314463"],"corresponding_institution_ids":["https://openalex.org/I153718931"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9750999808311462,"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.9750999808311462,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.012799999676644802,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.00559999980032444,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/stabilizer-codes","display_name":"stabilizer codes","score":0.9789999723434448},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"hardness of approximation","score":0.7670000195503235},{"id":"https://openalex.org/keywords/fine-grained-complexity","display_name":"fine-grained complexity","score":0.8820000290870667},{"id":"https://openalex.org/keywords/randomized-algorithms","display_name":"randomized algorithms","score":0.6639999747276306},{"id":"https://openalex.org/keywords/seth","display_name":"Seth","score":0.6389999985694885},{"id":"https://openalex.org/keywords/quantum-error-correcting-codes","display_name":"quantum error-correcting codes","score":0.6169999837875366},{"id":"https://openalex.org/keywords/block-length","display_name":"block length","score":0.40799999237060547}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7340999841690063},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5626999735832214},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.5291000008583069},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5128999948501587},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47940000891685486},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.4691999852657318},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.44859999418258667},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.4478999972343445},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4406000077724457},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4269999861717224},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.40529999136924744},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4043999910354614},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3937000036239624},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.38850000500679016},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.3709000051021576},{"id":"https://openalex.org/C2639959","wikidata":"https://www.wikidata.org/wiki/Q1344778","display_name":"Distance measures","level":2,"score":0.34689998626708984},{"id":"https://openalex.org/C203087015","wikidata":"https://www.wikidata.org/wiki/Q378201","display_name":"Qubit","level":3,"score":0.3431999981403351},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3375999927520752},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.28209999203681946},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.2754000127315521},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2745000123977661},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.27300000190734863},{"id":"https://openalex.org/C41431624","wikidata":"https://www.wikidata.org/wiki/Q1053357","display_name":"Block size","level":3,"score":0.26899999380111694}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2609.33956","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.33956","pdf_url":"https://arxiv.org/pdf/2609.33956","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"doi:10.48550/arxiv.2609.33956","doi":"https://doi.org/10.48550/arxiv.2609.33956","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2609.33956","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2609.33956","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.33956","pdf_url":"https://arxiv.org/pdf/2609.33956","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7214722336.pdf","grobid_xml":"https://content.openalex.org/works/W7214722336.grobid-xml"},"referenced_works_count":1,"referenced_works":["https://openalex.org/W1522547328"],"related_works":["https://openalex.org/W4415330780","https://openalex.org/W4380905717","https://openalex.org/W7097829117","https://openalex.org/W7214044973","https://openalex.org/W4414094484","https://openalex.org/W4414789097","https://openalex.org/W7098558399","https://openalex.org/W4220854529","https://openalex.org/W4396818974","https://openalex.org/W4391766915"],"abstract_inverted_index":{"We":[0,61,77],"study":[1,73],"the":[2,7,15,31,38,57,71,75,84,101,114,132],"computational":[3],"complexity":[4],"of":[5,10,40,45,74,116,146],"approximating":[6],"minimum":[8,16],"distance":[9,17,85,115,133],"a":[11,67,92,117,136],"stabilizer":[12],"code.":[13],"Classically,":[14],"problem":[18],"is":[19],"NP-hard":[20],"to":[21,24,86,134],"approximate":[22],"even":[23],"within":[25,87,135],"an":[26,52,88],"additive":[27,53,89,138],"gap":[28,55,64,150],"linear":[29,137],"in":[30,56,66],"block":[32,58,143],"length.":[33],"For":[34],"quantum":[35],"codes,":[36],"however,":[37],"reductions":[39],"Kapshikar":[41],"and":[42,44,48,126,149],"Kundu":[43],"Grigorescu,":[46],"Jha":[47],"Samperton":[49],"reach":[50],"only":[51],"$O(\\sqrt{N})$":[54],"length":[59],"$N$.":[60],"close":[62],"this":[63],"and,":[65],"separate":[68],"direction,":[69],"initiate":[70],"fine-grained":[72,102],"problem.":[76],"show":[78],"that":[79],"no":[80,109,127],"randomized":[81,110,128],"algorithm":[82,112,130],"approximates":[83,131],"$\u03b1N$,":[90],"for":[91,104],"constant":[93],"$\u03b1>":[94],"0$,":[95,108],"unless":[96,123,154],"$\\mathsf{NP}":[97],"\\subseteq":[98],"\\mathsf{coRP}$.":[99],"In":[100],"setting,":[103],"every":[105],"$\\varepsilon":[106],">":[107],"$2^{(1-\\varepsilon)\u03ba}\\,\\mathrm{poly}(N)$-time":[111],"computes":[113],"code":[118],"with":[119],"$\u03ba$":[120],"logical":[121,147],"qubits":[122],"SETH":[124],"falls;":[125],"$2^{o(N)}$-time":[129],"gap,":[139],"on":[140],"instances":[141],"where":[142],"length,":[144],"number":[145],"qubits,":[148],"are":[151],"simultaneously":[152],"linear,":[153],"non-uniform":[155],"Gap-ETH":[156],"falls.":[157]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2026-09-30T00:00:00"}