{"id":"https://openalex.org/W4409700960","doi":"https://doi.org/10.1145/3728715","title":"Cumulative Memory Lower Bounds for Randomized and Quantum Computation","display_name":"Cumulative Memory Lower Bounds for Randomized and Quantum Computation","publication_year":2025,"publication_date":"2025-04-23","ids":{"openalex":"https://openalex.org/W4409700960","doi":"https://doi.org/10.1145/3728715"},"language":"en","primary_location":{"id":"doi:10.1145/3728715","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3728715","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3728715","source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3728715","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042076941","display_name":"Paul Beame","orcid":"https://orcid.org/0000-0002-2666-3545"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]},{"id":"https://openalex.org/I58610484","display_name":"Seattle University","ror":"https://ror.org/02jqc0m91","country_code":"US","type":"education","lineage":["https://openalex.org/I58610484"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Paul Beame","raw_affiliation_strings":["Computer Science and Engineering, University of Washington, Seattle, United States"],"raw_orcid":"https://orcid.org/0000-0002-2666-3545","affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, University of Washington, Seattle, United States","institution_ids":["https://openalex.org/I201448701","https://openalex.org/I58610484"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066703672","display_name":"Niels Kornerup","orcid":"https://orcid.org/0000-0002-1519-726X"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Niels Kornerup","raw_affiliation_strings":["Computer Science, The University of Texas at Austin, Austin, United States"],"raw_orcid":"https://orcid.org/0000-0002-1519-726X","affiliations":[{"raw_affiliation_string":"Computer Science, The University of Texas at Austin, Austin, United States","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.02910788,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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.9998000264167786,"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.9998000264167786,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9979000091552734,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9968000054359436,"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/mathematics","display_name":"Mathematics","score":0.5527580380439758},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5277296304702759},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.4466366171836853},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3500780463218689},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.23814699053764343},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2208922803401947},{"id":"https://openalex.org/keywords/quantum-mechanics","display_name":"Quantum mechanics","score":0.19881048798561096}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5527580380439758},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5277296304702759},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.4466366171836853},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3500780463218689},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.23814699053764343},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2208922803401947},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.19881048798561096}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3728715","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3728715","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3728715","source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3728715","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3728715","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3728715","source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1719938300","display_name":"FET: Small: Quantum Time-Space Tradeoffs and Classical Lifting","funder_award_id":"2422205","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3962928998","display_name":"AF: Small:  Complexity of Representations for Inference","funder_award_id":"2006359","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4409700960.pdf","grobid_xml":"https://content.openalex.org/works/W4409700960.grobid-xml"},"referenced_works_count":38,"referenced_works":["https://openalex.org/W258748880","https://openalex.org/W1564514837","https://openalex.org/W1975124543","https://openalex.org/W1976463987","https://openalex.org/W1979641885","https://openalex.org/W1989110033","https://openalex.org/W1989204408","https://openalex.org/W1991155917","https://openalex.org/W1999204069","https://openalex.org/W2001736707","https://openalex.org/W2009807436","https://openalex.org/W2023146810","https://openalex.org/W2031934066","https://openalex.org/W2036427735","https://openalex.org/W2052404100","https://openalex.org/W2056431243","https://openalex.org/W2063729784","https://openalex.org/W2066947547","https://openalex.org/W2068911609","https://openalex.org/W2072573758","https://openalex.org/W2079401865","https://openalex.org/W2095012419","https://openalex.org/W2120788116","https://openalex.org/W2148211896","https://openalex.org/W2439469608","https://openalex.org/W2482045774","https://openalex.org/W2493941654","https://openalex.org/W2533275618","https://openalex.org/W2611161794","https://openalex.org/W2612601170","https://openalex.org/W2741749840","https://openalex.org/W2773116874","https://openalex.org/W2968763694","https://openalex.org/W3093793428","https://openalex.org/W3103450999","https://openalex.org/W4311219689","https://openalex.org/W4382334855","https://openalex.org/W4399521310"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2962838298","https://openalex.org/W2600246793"],"abstract_inverted_index":{"Cumulative":[0],"memory\u2014the":[1],"sum":[2],"of":[3,11,17,61,69,205],"space":[4,122],"used":[5,123],"per":[6],"step":[7],"over":[8],"the":[9,78,106,120,142,173],"duration":[10],"a":[12,14,32,270],"computation\u2014is":[13],"fine-grained":[15],"measure":[16,36],"time-space":[18,111,144,167],"complexity":[19,85,103],"that":[20,39,55,115,134,180,211,264],"was":[21],"introduced":[22],"to":[23,153],"analyze":[24],"cryptographic":[25],"applications":[26,204],"like":[27],"password":[28],"hashing.":[29],"It":[30],"is":[31],"more":[33],"accurate":[34],"cost":[35],"for":[37,86,99,109,159,198],"algorithms":[38],"have":[40,165],"infrequent":[41],"spikes":[42],"in":[43,49,74,181,269],"memory":[44,84,102,133,175,226,238,252,275],"usage":[45],"and":[46,59,91,161,194,260],"are":[47,72,137,149,195],"run":[48],"environments":[50],"such":[51,185],"as":[52,139,141],"cloud":[53],"computing":[54],"allow":[56],"dynamic":[57],"allocation":[58],"de-allocation":[60],"resources":[62],"during":[63,124],"execution,":[64],"or":[65],"when":[66],"many":[67,199,202],"instances":[68],"an":[70,125],"algorithm":[71,215,235],"interleaved":[73],"parallel.":[75],"We":[76],"prove":[77],"first":[79],"lower":[80,113,118,129,146,169,191],"bounds":[81,114,130,170],"on":[82,131],"cumulative":[83,101,132,174,225,237,251,274],"both":[87],"sequential":[88],"classical":[89,213,232],"computation":[90],"quantum":[92,247,262],"circuits.":[93],"Moreover,":[94],"we":[95,135,209],"develop":[96],"general":[97,182,207],"paradigms":[98,108],"bounding":[100],"inspired":[104],"by":[105],"standard":[107],"proving":[110],"tradeoff":[112,145,168],"can":[116],"only":[117],"bound":[119,192],"maximum":[121],"execution.":[126],"The":[127],"resulting":[128],"obtain":[136],"just":[138],"strong":[140],"best":[143],"bounds,":[147],"which":[148],"very":[150],"often":[151],"known":[152,190],"be":[154],"tight.":[155],"Although":[156],"previous":[157],"results":[158,178],"pebbling":[160],"random":[162,271],"oracle":[163],"models":[164,184],"yielded":[166],"larger":[171],"than":[172],"complexity,":[176],"our":[177,206],"show":[179,210],"computational":[183],"separations":[186],"cannot":[187],"follow":[188],"from":[189],"techniques":[193],"not":[196],"true":[197],"functions.":[200],"Among":[201],"possible":[203],"methods,":[208],"any":[212,231,246,261],"sorting":[214,248],"with":[216],"success":[217],"probability":[218],"at":[219],"least":[220],"1/poly(":[221],"n":[222,241,255,280],")":[223],"requires":[224,236,250,273],"\\(\\tilde{\\Omega":[227],"}(n^2)":[228],"\\)":[229],",":[230],"matrix":[233],"multiplication":[234],"\u03a9":[239,253,276],"(":[240,254,277],"6":[242],"/":[243,257,281],"T":[244,258,282],"),":[245,259],"circuit":[249,263],"3":[256,279],"finds":[265],"k":[266,278],"disjoint":[267],"collisions":[268],"function":[272],"2":[283],").":[284]},"counts_by_year":[],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}