{"id":"https://openalex.org/W7128046251","doi":"https://doi.org/10.48550/arxiv.2602.05801","title":"The Quantum Message Complexity of Distributed Wake-Up with Advice","display_name":"The Quantum Message Complexity of Distributed Wake-Up with Advice","publication_year":2026,"publication_date":"2026-02-05","ids":{"openalex":"https://openalex.org/W7128046251","doi":"https://doi.org/10.48550/arxiv.2602.05801"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.05801","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5125166475","display_name":"Peter Robinson","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robinson, Peter","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5102936309","display_name":"Ming Ming Tan","orcid":"https://orcid.org/0000-0002-5279-5314"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tan, Ming Ming","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"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.603600025177002,"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.603600025177002,"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.18320000171661377,"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/T10020","display_name":"Quantum Information and Cryptography","score":0.06610000133514404,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6115999817848206},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.5480999946594238},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.5227000117301941},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5005000233650208},{"id":"https://openalex.org/keywords/adversary","display_name":"Adversary","score":0.4878999888896942},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4787999987602234},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.44830000400543213},{"id":"https://openalex.org/keywords/trojan-horse","display_name":"Trojan horse","score":0.4117000102996826},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.40619999170303345}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6115999817848206},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5860999822616577},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.5480999946594238},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5450000166893005},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.5227000117301941},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5005000233650208},{"id":"https://openalex.org/C41065033","wikidata":"https://www.wikidata.org/wiki/Q2825412","display_name":"Adversary","level":2,"score":0.4878999888896942},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4787999987602234},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.44830000400543213},{"id":"https://openalex.org/C2777337426","wikidata":"https://www.wikidata.org/wiki/Q14639","display_name":"Trojan horse","level":2,"score":0.4117000102996826},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.40619999170303345},{"id":"https://openalex.org/C92043244","wikidata":"https://www.wikidata.org/wiki/Q7269023","display_name":"Quantum complexity theory","level":4,"score":0.40560001134872437},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.36160001158714294},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.35339999198913574},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3425000011920929},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3379000127315521},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.33730000257492065},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.33390000462532043},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.3330000042915344},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.3312999904155731},{"id":"https://openalex.org/C2779955035","wikidata":"https://www.wikidata.org/wiki/Q4686785","display_name":"Advice (programming)","level":2,"score":0.3303999900817871},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.3199999928474426},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.31450000405311584},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.29750001430511475},{"id":"https://openalex.org/C7606001","wikidata":"https://www.wikidata.org/wiki/Q4686702","display_name":"Adversary model","level":3,"score":0.29319998621940613},{"id":"https://openalex.org/C96563100","wikidata":"https://www.wikidata.org/wiki/Q8037118","display_name":"Worst-case complexity","level":3,"score":0.2768000066280365},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.27160000801086426},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.2563000023365021},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.25619998574256897},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.25369998812675476},{"id":"https://openalex.org/C94284585","wikidata":"https://www.wikidata.org/wiki/Q228184","display_name":"Random oracle","level":4,"score":0.25369998812675476},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.25099998712539673}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.05801","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.05801","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.05801","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"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.05801","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,50],"consider":[1],"the":[2,16,21,40,52,59,65,115,122,141,155,160,189,198,211],"distributed":[3,83,145],"wake-up":[4,63,167],"problem":[5,158],"with":[6,12,98,109],"advice,":[7,178],"where":[8,191],"nodes":[9,48,97,196],"are":[10],"equipped":[11],"initial":[13],"knowledge":[14],"about":[15],"network":[17],"at":[18],"large.":[19],"After":[20],"adversary":[22,193],"awakens":[23],"a":[24,31,82,99,137,150,169],"subset":[25],"of":[26,90,102,173,182,203],"nodes,":[27],"an":[28,192],"oracle":[29],"computes":[30],"bit":[32],"string":[33],"(``the":[34],"advice'')":[35],"for":[36,62,121,144,154,217],"each":[37],"node,":[38,93],"and":[39,55,73,209,225],"goal":[41],"is":[42],"to":[43],"wake":[44],"up":[45,95],"all":[46,96],"sleeping":[47],"efficiently.":[49],"present":[51],"first":[53],"upper":[54],"lower":[56,138,151,213],"bounds":[57],"on":[58,140],"message":[60,100,142,171],"complexity":[61,101,143,162,172],"in":[64,127,159],"quantum":[66,146,170],"routing":[67],"model,":[68,163],"introduced":[69],"by":[70],"Dufoulon,":[71],"Magniez,":[72],"Pandurangan":[74],"(PODC":[75],"2025).":[76],"In":[77,188],"more":[78],"detail,":[79],"we":[80,135,164,186],"give":[81,136],"advising":[84],"scheme":[85],"that,":[86],"given":[87],"$\u03b1$":[88],"bits":[89],"advice":[91],"per":[92],"wakes":[94],"$O(":[103],"\\sqrt{\\frac{n^3}{2^{\\max\\{\\lfloor":[104],"(\u03b1-1)/2":[105],"\\rfloor},0\\}}}\\cdot\\log":[106],"n":[107],")$":[108,118,176],"high":[110],"probability.":[111],"Our":[112],"result":[113,153],"breaks":[114],"$\u03a9(":[116,174],"\\frac{n^2}{2^\u03b1}":[117],"barrier":[119],"known":[120],"classical":[123],"port":[124],"numbering":[125],"model":[126],"sufficiently":[128],"dense":[129],"graphs.":[130],"To":[131],"complement":[132],"our":[133],"algorithm,":[134,199],"bound":[139,152,214],"algorithms:":[147],"By":[148],"leveraging":[149],"single-bit":[156],"descriptor":[157],"query":[161],"show":[165],"that":[166],"has":[168],"n^{3/2}":[175],"without":[177],"which":[179,195],"holds":[180,216],"independently":[181],"how":[183],"much":[184],"time":[185],"allow.":[187],"setting":[190],"decides":[194],"start":[197],"most":[200],"graph":[201],"problems":[202,220],"interest":[204],"implicitly":[205],"require":[206],"solving":[207],"wake-up,":[208],"thus":[210],"same":[212],"also":[215],"other":[218],"fundamental":[219],"such":[221],"as":[222],"single-source":[223],"broadcast":[224],"spanning":[226],"tree":[227],"construction.":[228]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-02-07T00:00:00"}