{"id":"https://openalex.org/W4389156544","doi":"https://doi.org/10.4230/lipics.icalp.2025.9","title":"On the Quantum Time Complexity of Divide and Conquer","display_name":"On the Quantum Time Complexity of Divide and Conquer","publication_year":2023,"publication_date":"2023-11-28","ids":{"openalex":"https://openalex.org/W4389156544","doi":"https://doi.org/10.4230/lipics.icalp.2025.9"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2311.16401","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2311.16401","pdf_url":"https://arxiv.org/pdf/2311.16401","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,"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":"","raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2311.16401","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002447654","display_name":"Jonathan Allcock","orcid":"https://orcid.org/0000-0003-3545-0565"},"institutions":[{"id":"https://openalex.org/I2250653659","display_name":"Tencent (China)","ror":"https://ror.org/00hhjss72","country_code":"CN","type":"company","lineage":["https://openalex.org/I2250653659"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Allcock, Jonathan","raw_affiliation_strings":["Tencent Quantum Laboratory, Hong Kong, China"],"raw_orcid":"https://orcid.org/0000-0003-3545-0565","affiliations":[{"raw_affiliation_string":"Tencent Quantum Laboratory, Hong Kong, China","institution_ids":["https://openalex.org/I2250653659"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042724336","display_name":"Jinge Bao","orcid":null},"institutions":[{"id":"https://openalex.org/I115455960","display_name":"Centre for Quantum Technologies","ror":"https://ror.org/01mgdzc49","country_code":"SG","type":"facility","lineage":["https://openalex.org/I115455960"]},{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]},{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB","SG"],"is_corresponding":false,"raw_author_name":"Bao, Jinge","raw_affiliation_strings":["School of Informatics, University of Edinburgh, UK","Centre for Quantum Technologies, National University of Singapore, Singapore"],"raw_orcid":"https://orcid.org/0000-0002-1159-0232","affiliations":[{"raw_affiliation_string":"School of Informatics, University of Edinburgh, UK","institution_ids":["https://openalex.org/I98677209"]},{"raw_affiliation_string":"Centre for Quantum Technologies, National University of Singapore, Singapore","institution_ids":["https://openalex.org/I115455960","https://openalex.org/I165932596"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033491812","display_name":"Aleksandrs Belovs","orcid":null},"institutions":[{"id":"https://openalex.org/I91123046","display_name":"University of Latvia","ror":"https://ror.org/05g3mes96","country_code":"LV","type":"education","lineage":["https://openalex.org/I91123046"]}],"countries":["LV"],"is_corresponding":false,"raw_author_name":"Belovs, Aleksandrs","raw_affiliation_strings":["Center for Quantum Computing Science, Faculty of Science and Technology, University of Latvia, Riga, Latvia"],"raw_orcid":"https://orcid.org/0009-0004-1625-108X","affiliations":[{"raw_affiliation_string":"Center for Quantum Computing Science, Faculty of Science and Technology, University of Latvia, Riga, Latvia","institution_ids":["https://openalex.org/I91123046"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083542323","display_name":"Troy Lee","orcid":"https://orcid.org/0000-0001-6912-2338"},"institutions":[{"id":"https://openalex.org/I114017466","display_name":"University of Technology Sydney","ror":"https://ror.org/03f0f6041","country_code":"AU","type":"education","lineage":["https://openalex.org/I114017466"]},{"id":"https://openalex.org/I4210096034","display_name":"Centre for Quantum Computation and Communication Technology","ror":"https://ror.org/00rnbty21","country_code":"AU","type":"facility","lineage":["https://openalex.org/I1337719021","https://openalex.org/I165143802","https://openalex.org/I2801453606","https://openalex.org/I4210096034","https://openalex.org/I4210132349"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Lee, Troy","raw_affiliation_strings":["Centre for Quantum Software and Information, University of Technology Sydney, Ultimo, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centre for Quantum Software and Information, University of Technology Sydney, Ultimo, Australia","institution_ids":["https://openalex.org/I114017466","https://openalex.org/I4210096034"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046562790","display_name":"Mikl\u00f3s S\u00e1ntha","orcid":null},"institutions":[{"id":"https://openalex.org/I115455960","display_name":"Centre for Quantum Technologies","ror":"https://ror.org/01mgdzc49","country_code":"SG","type":"facility","lineage":["https://openalex.org/I115455960"]},{"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/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]},{"id":"https://openalex.org/I4210117673","display_name":"Institut de Recherche en Informatique Fondamentale","ror":"https://ror.org/02krdtz55","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I204730241","https://openalex.org/I4210089394","https://openalex.org/I4210117673","https://openalex.org/I4210139971"]}],"countries":["FR","SG"],"is_corresponding":false,"raw_author_name":"Santha, Miklos","raw_affiliation_strings":["Centre for Quantum Technologies, National University of Singapore, Singapore","CNRS, IRIF, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centre for Quantum Technologies, National University of Singapore, Singapore","institution_ids":["https://openalex.org/I115455960","https://openalex.org/I165932596"]},{"raw_affiliation_string":"CNRS, IRIF, Paris, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210117673"]}]}],"institutions":[],"countries_distinct_count":6,"institutions_distinct_count":9,"corresponding_author_ids":[],"corresponding_institution_ids":[],"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.9869999885559082,"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.9869999885559082,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9431999921798706,"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/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.7871906757354736},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6574065685272217},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.5922000408172607},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.584093451499939},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5520303249359131},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5267899632453918},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.5196624994277954},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4940031170845032},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4350687563419342},{"id":"https://openalex.org/keywords/substring","display_name":"Substring","score":0.42625582218170166},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3700413107872009},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36483392119407654},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36081844568252563},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3331696391105652},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.19247812032699585},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.17752301692962646},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.12357226014137268},{"id":"https://openalex.org/keywords/quantum-mechanics","display_name":"Quantum mechanics","score":0.09243807196617126},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.08367031812667847}],"concepts":[{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.7871906757354736},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6574065685272217},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.5922000408172607},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.584093451499939},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5520303249359131},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5267899632453918},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.5196624994277954},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4940031170845032},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4350687563419342},{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.42625582218170166},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3700413107872009},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36483392119407654},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36081844568252563},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3331696391105652},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.19247812032699585},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.17752301692962646},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.12357226014137268},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.09243807196617126},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.08367031812667847},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:arXiv.org:2311.16401","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2311.16401","pdf_url":"https://arxiv.org/pdf/2311.16401","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,"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":"","raw_type":"text"},{"id":"doi:10.48550/arxiv.2311.16401","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2311.16401","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,"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":null,"raw_source_name":null,"raw_type":"Preprint"},{"id":"doi:10.4230/lipics.icalp.2025.9","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2025.9","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2311.16401","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2311.16401","pdf_url":"https://arxiv.org/pdf/2311.16401","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,"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":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5428356290","display_name":null,"funder_award_id":"NRF2021-QEP2-02-P05","funder_id":"https://openalex.org/F4320320709","funder_display_name":"National Research Foundation Singapore"},{"id":"https://openalex.org/G5615427228","display_name":null,"funder_award_id":"2.3.1.1.i.0/1/22/I/CFLA/001","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320320671","display_name":"National Research Foundation","ror":"https://ror.org/05s0g1g46"},{"id":"https://openalex.org/F4320320709","display_name":"National Research Foundation Singapore","ror":"https://ror.org/03cpyc314"},{"id":"https://openalex.org/F4320330828","display_name":"QuantERA","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4205474360","https://openalex.org/W2969919693","https://openalex.org/W3122601395","https://openalex.org/W2908130256","https://openalex.org/W2125120904","https://openalex.org/W4390923554","https://openalex.org/W2035123411","https://openalex.org/W2112772040","https://openalex.org/W4389489786","https://openalex.org/W1540010783"],"abstract_inverted_index":{"In":[0,147],"this":[1],"work,":[2],"we":[3,149],"initiate":[4],"a":[5,24,102,109,135,204,238,273,326],"systematic":[6],"study":[7],"of":[8,12,82,112,137,213,218,276,314],"the":[9,91,141,157,174,211,214,219,226,286,310],"time":[10,87,132,142,172,266],"complexity":[11,133,312],"quantum":[13,49,86,92,117,239,288],"divide":[14,42,206],"and":[15,22,37,43,51,61,77,107,124,126,162,177,207,241],"conquer":[16,44,208],"(QD&C)":[17],"algorithms":[18,45,114,246,289],"for":[19,27,105,140,144,152,322],"classical":[20,41,205],"problems,":[21],"propose":[23],"general":[25,128],"framework":[26,104],"their":[28,255],"analysis.":[29],"We":[30,100],"establish":[31],"generic":[32,187],"conditions":[33,212],"under":[34],"which":[35,166,178,236,247,304],"search":[36],"minimization":[38,297],"problems":[39,57,73,84,277,298],"with":[40,203,243],"are":[46,167],"amenable":[47],"to":[48,55,97,169,200,233,251,254,272,307],"speedup,":[50,240],"apply":[52,196],"these":[53,83,261],"theorems":[54,189,262],"various":[56],"involving":[58],"strings,":[59],"integers,":[60],"geometric":[62],"objects.":[63],"These":[64],"include":[65],"Longest":[66],"Distinct":[67],"Substring,":[68],"Klee's":[69],"Coverage,":[70],"several":[71,191],"optimization":[72],"on":[74,130,265,281,309],"stock":[75],"transactions,":[76],"k-Increasing":[78,323],"Subsequence.":[79],"For":[80],"most":[81],"our":[85],"upper":[88],"bounds":[89,264],"match":[90],"query":[93,175,282,311],"lower":[94],"bounds,":[95],"up":[96,202],"polylogarithmic":[98],"factors.":[99],"give":[101,263],"structured":[103],"describing":[106],"classifying":[108],"wide":[110],"variety":[111],"QD&C":[113,131,188],"so":[115],"that":[116],"speedups":[118],"can":[119,229,248,269,295],"be":[120,249,270],"more":[121],"easily":[122],"identified":[123],"applied,":[125],"prove":[127],"statements":[129],"covering":[134],"range":[136,275],"cases,":[138],"accounting":[139],"required":[143],"all":[145],"operations.":[146],"particular,":[148],"explicitly":[150],"account":[151],"memory":[153],"access":[154],"operations":[155],"in":[156,173,184],"commonly":[158],"used":[159],"QRAM":[160],"(read-only)":[161],"QRAG":[163],"(read-write)":[164],"models,":[165],"assumed":[168],"take":[170],"unit":[171],"model,":[176],"require":[179,290],"careful":[180],"analysis":[181],"when":[182],"involved":[183],"recursion.":[185],"Our":[186],"have":[190],"nice":[192],"features.":[193],"1)":[194],"To":[195],"them,":[197],"it":[198,231],"suffices":[199],"come":[201],"algorithm":[209,220],"satisfying":[210],"theorem.":[215,227],"The":[216],"quantization":[217],"is":[221],"then":[222],"completely":[223],"handled":[224],"by":[225,325],"This":[228],"make":[230],"easier":[232],"find":[234],"applications":[235],"admit":[237],"contrast":[242],"dynamic":[244],"programming":[245],"difficult":[250],"quantize":[252],"due":[253],"highly":[256],"sequential":[257],"nature.":[258],"2)":[259],"As":[260],"complexity,":[267,283],"they":[268],"applied":[271],"greater":[274],"than":[278],"those":[279],"based":[280],"e.g.,":[284],"where":[285],"best-known":[287],"super-linear":[291],"time.":[292],"3)":[293],"It":[294],"handle":[296],"as":[299,301],"well":[300],"boolean":[302],"functions,":[303],"allows":[305],"us":[306],"improve":[308],"result":[313],"Childs":[315],"et":[316,319],"al.":[317],"[Childs":[318],"al.,":[320],"2025]":[321],"Subsequence":[324],"logarithmic":[327],"factor.":[328]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2023-11-30T00:00:00"}