本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2020-04-14
摘要
Modularity dissipation identifies how locally implemented computation entails costs beyond those required by Landauer's bound on 熱力學 computing. We establish a general theorem for efficient local computation, giving the necessary and sufficient conditions for a local operation to have zero modularity cost. Applied to 熱力學ally-generating 隨機 processes it confirms a conjecture that classical generators are efficient if and only if they satisfy retrodiction, which places minimum-memory requirements on the generator. This extends immediately to 量子 computation: Any 量子 simulator that employs 量子 memory compression cannot be 熱力學ally efficient.
※ 此為已發表論文，全文需透過期刊付費取得