Cumulative memory lower bounds for randomized and quantum computation

DOI10.4230/LIPICS.ICALP.2023.17MaRDI QIDQ6638009zbMATH OpenFDO

Authors Paul Beame, Niels Kornerup

Publication date 14 November 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2023.17

zbMATH Keywords

branching programscumulative memory complexityquantum lower boundstime-space tradeoffs

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cited in

(2)

• Explicit time and space efficient encoders exist only with random access
• Cumulative memory lower bounds for randomized and quantum computation

This page was built for publication: Cumulative memory lower bounds for randomized and quantum computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6638009)