2020
DOI: 10.1103/physrevresearch.2.023039
|View full text |Cite
|
Sign up to set email alerts
|

Thermodynamically-efficient local computation and the inefficiency of quantum memory compression

Abstract: Modularity dissipation identifies how locally-implemented computation entails costs beyond those required by Landauer's bound on thermodynamic 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 thermodynamically-generating stochastic processes it confirms a conjecture that classical generators are efficient if and only if they satisfy retrodiction, which places minimal memory re… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

4
17
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(21 citation statements)
references
References 52 publications
4
17
0
Order By: Relevance
“…We introduce a systematic approach to constructing quantum implementations of non-deterministic HMMs, showing that memory and thermodynamical advantages arise for almost any HMM. Our findings strengthen, extend, and supersede analogous prior results [33,35,39], which were limited in scope by considering an incomplete suite of possible quantum implementations.…”
Section: Introductionsupporting
confidence: 85%
See 4 more Smart Citations
“…We introduce a systematic approach to constructing quantum implementations of non-deterministic HMMs, showing that memory and thermodynamical advantages arise for almost any HMM. Our findings strengthen, extend, and supersede analogous prior results [33,35,39], which were limited in scope by considering an incomplete suite of possible quantum implementations.…”
Section: Introductionsupporting
confidence: 85%
“…Theorem 3 declares that this result holds for quantum implementations in general. Our proof mirrors many aspects of that for the deterministic case [39], with appropriate generalisation. Before proceeding with our proof, we introduce a definition and result involved in the proof of the deterministic case.…”
Section: Discussionmentioning
confidence: 58%
See 3 more Smart Citations