{"id":"https://openalex.org/W7221783370","doi":"https://doi.org/10.48550/arxiv.2610.15601","title":"A Quantum Analogue of the Covering Lemma: Limits of Exact Anonymous Computation","display_name":"A Quantum Analogue of the Covering Lemma: Limits of Exact Anonymous Computation","publication_year":2026,"publication_date":"2026-10-11","ids":{"openalex":"https://openalex.org/W7221783370","doi":"https://doi.org/10.48550/arxiv.2610.15601"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2610.15601","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.15601","pdf_url":"https://arxiv.org/pdf/2610.15601","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/2610.15601","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079738107","display_name":"Giuseppe Di Molfetta","orcid":"https://orcid.org/0000-0002-1261-7476","observed_orcids":["https://orcid.org/0000-0002-1261-7476"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Di Molfetta, Giuseppe","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5158746208","display_name":"Petra Camilli","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Camilli, Petra","raw_affiliation_strings":["Universit\u00e9 Paris-Saclay , CNRS , ENS Paris-Saclay , 91190 Gif-sur-Yvette , France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Paris-Saclay , CNRS , ENS Paris-Saclay , 91190 Gif-sur-Yvette , France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I277688954"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"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.5259000062942505,"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.5259000062942505,"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/T10020","display_name":"Quantum Information and Cryptography","score":0.44359999895095825,"subfield":{"id":"https://openalex.org/subfields/3107","display_name":"Atomic and Molecular Physics, and Optics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"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.00430000014603138,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/covering-lemma","display_name":"covering lemma","score":0.7680000066757202},{"id":"https://openalex.org/keywords/anonymity-networks","display_name":"anonymity networks","score":0.7440000176429749},{"id":"https://openalex.org/keywords/quantum-communication","display_name":"quantum communication","score":0.4959999918937683},{"id":"https://openalex.org/keywords/exact-counting","display_name":"exact counting","score":0.5799999833106995},{"id":"https://openalex.org/keywords/quantum-interference","display_name":"quantum interference","score":0.656000018119812},{"id":"https://openalex.org/keywords/graph-covers","display_name":"graph covering","score":0.6179999709129333},{"id":"https://openalex.org/keywords/tensor-networks","display_name":"tensor networks","score":0.7260000109672546},{"id":"https://openalex.org/keywords/leader-election","display_name":"leader election","score":0.9480000138282776},{"id":"https://openalex.org/keywords/cyclic-covers","display_name":"cyclic coverings","score":0.5519999861717224},{"id":"https://openalex.org/keywords/impossibility-results","display_name":"impossibility results","score":0.6499999761581421},{"id":"https://openalex.org/keywords/synchronous-protocols","display_name":"synchronous protocols","score":0.4359999895095825}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5030999779701233},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48669999837875366},{"id":"https://openalex.org/C2776261394","wikidata":"https://www.wikidata.org/wiki/Q315562","display_name":"Impossibility","level":2,"score":0.45559999346733093},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4462999999523163},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.43459999561309814},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4309999942779541},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.421999990940094},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4203000068664551},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.41280001401901245},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4041000008583069},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.38830000162124634},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.38449999690055847},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.3619000017642975},{"id":"https://openalex.org/C53480672","wikidata":"https://www.wikidata.org/wiki/Q1424189","display_name":"Leader election","level":2,"score":0.3427000045776367},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.3310999870300293},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.32580000162124634},{"id":"https://openalex.org/C15706264","wikidata":"https://www.wikidata.org/wiki/Q230883","display_name":"Quantum state","level":3,"score":0.3212999999523163},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.32010000944137573},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.3197000026702881},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.310699999332428},{"id":"https://openalex.org/C97399411","wikidata":"https://www.wikidata.org/wiki/Q825367","display_name":"Coin flipping","level":2,"score":0.30160000920295715},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.2980000078678131},{"id":"https://openalex.org/C138622882","wikidata":"https://www.wikidata.org/wiki/Q7269079","display_name":"Quantum nonlocality","level":4,"score":0.29660001397132874},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.2955000102519989},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.2851000130176544},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2728999853134155},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.26989999413490295},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.2694000005722046},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.26420000195503235},{"id":"https://openalex.org/C98184364","wikidata":"https://www.wikidata.org/wiki/Q1780131","display_name":"Argument (complex analysis)","level":2,"score":0.2619999945163727},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.25200000405311584}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2610.15601","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.15601","pdf_url":"https://arxiv.org/pdf/2610.15601","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.2610.15601","doi":"https://doi.org/10.48550/arxiv.2610.15601","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2610.15601","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:2610.15601","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.15601","pdf_url":"https://arxiv.org/pdf/2610.15601","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":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7221783370.pdf","grobid_xml":"https://content.openalex.org/works/W7221783370.grobid-xml"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W1487051037","https://openalex.org/W2074426935","https://openalex.org/W2604947823","https://openalex.org/W2729837604","https://openalex.org/W2949757588","https://openalex.org/W2964209857","https://openalex.org/W2974438223","https://openalex.org/W4384811849","https://openalex.org/W4394912367","https://openalex.org/W7168249140"],"related_works":["https://openalex.org/W6929322534","https://openalex.org/W3215876140","https://openalex.org/W2188759904","https://openalex.org/W4281730571","https://openalex.org/W2900114844","https://openalex.org/W1487051037","https://openalex.org/W7117297225","https://openalex.org/W3044930166","https://openalex.org/W2574265732","https://openalex.org/W3033526846"],"abstract_inverted_index":{"Can":[0],"quantum":[1,72],"communication":[2],"determine":[3],"the":[4,21,34,60,75,118,122,131,134,187,199],"size":[5,12,193],"of":[6,62,74,124,189,251],"an":[7,24],"anonymous":[8,196],"network":[9,32,50,157,252],"when":[10],"no":[11,235],"bound":[13,194,238],"is":[14,70,239],"known?":[15],"Classical":[16],"impossibility":[17,61],"proofs":[18],"rely":[19],"on":[20,29,48,54,164,195,221],"covering":[22,76,89,136,202],"lemma:":[23],"execution":[25,245],"can":[26,51,168],"be":[27],"reproduced":[28],"a":[30,44,49,55,71,87,97,102,125,153,162,190],"larger":[31],"with":[33,141,150,174,213,218,231],"same":[35],"local":[36,80,92,166,228],"structure.":[37],"Quantum":[38,241],"interference":[39,242],"invalidates":[40],"this":[41,178],"argument":[42],"-":[43],"measurement":[45,93],"record":[46],"possible":[47,95,100],"become":[52],"impossible":[53],"cover.":[56],"We":[57,129],"show":[58],"that":[59,78],"exact":[63,210],"counting":[64,184],"nevertheless":[65],"survives.":[66],"Our":[67],"main":[68],"result":[69],"analogue":[73],"lemma":[77],"preserves":[79],"possibilities":[81],"rather":[82],"than":[83],"complete":[84],"executions.":[85],"Within":[86],"cyclic":[88,201],"family,":[90],"every":[91,106],"outcome":[94],"at":[96,101],"node":[98,104],"remains":[99],"corresponding":[103],"in":[105,215],"sufficiently":[107,142],"large":[108],"network.":[109],"This":[110],"holds":[111],"even":[112,186],"after":[113],"information":[114],"has":[115],"travelled":[116],"around":[117],"smaller":[119],"network,":[120],"beyond":[121],"reach":[123],"simple":[126],"locality":[127],"argument.":[128],"extend":[130],"principle":[132,180],"to":[133],"universal":[135],"tree":[137],"and":[138,185,198,227],"finite":[139,192,216],"covers":[140],"long":[143],"cycles.":[144],"The":[145],"proof":[146],"combines":[147],"tensor-network":[148],"methods":[149],"graph":[151],"coverings:":[152],"common":[154],"representation":[155],"across":[156],"sizes":[158],"turns":[159],"normalization":[160],"into":[161],"constraint":[163],"which":[165],"outcomes":[167],"occur.":[169],"For":[170],"uniform":[171],"synchronous":[172],"protocols":[173],"independently":[175],"prepared":[176],"nodes,":[177],"support-lifting":[179],"rules":[181,208],"out":[182,209],"zero-error":[183],"production":[188],"guaranteed":[191],"rings":[197],"other":[200],"families":[203],"considered":[204],"here.":[205],"It":[206],"also":[207],"leader":[211],"election":[212],"termination":[214],"time":[217,232],"probability":[219],"one":[220],"these":[222],"families.":[223],"Measurements,":[224],"classical":[225],"control,":[226],"memory":[229],"growing":[230],"are":[233],"allowed;":[234],"predetermined":[236],"running-time":[237],"assumed.":[240],"thus":[243],"defeats":[244],"lifting":[246],"without":[247],"enabling":[248],"infallible":[249],"certification":[250],"size.":[253]},"counts_by_year":[],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2026-10-15T00:00:00"}