Skip to main content
Cornell University
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arxiv logo > cond-mat > arXiv:2103.15803v1

Help | Advanced Search

arXiv logo
Cornell University Logo

quick links

  • Login
  • Help Pages
  • About

Condensed Matter > Statistical Mechanics

arXiv:2103.15803v1 (cond-mat)
[Submitted on 26 Mar 2021 (this version), latest version 24 Aug 2022 (v4)]

Title:Partially Observable Szilard Engines

Authors:Susanne Still, Dorian Daimer
View a PDF of the paper titled Partially Observable Szilard Engines, by Susanne Still and Dorian Daimer
View PDF
Abstract:Leo Szilard pointed out that "Maxwell's demon" can be replaced by machinery, thereby laying the foundation for understanding the physical nature of information. Almost a hundred years later, Szilard's information engine still serves as a canonical example, despite significant growth of the field in the last decade. The role the demon plays can be reduced to mapping observable data to a meta-stable memory which is then utilized to extract work. While Szilard showed that the map can be implemented mechanistically, the map was chosen a priori. The choice of how to construct a meaningful memory constitutes the demon's intelligence. Recently, it was shown that this can be automated as well. To that end, generalized, partially observable information engines were introduced. They provide the basis for understanding the physical nature of information processing. Here, we propose a simple model that nonetheless displays physical richness. A minor change to Silard's engine - inserting the divider at an angle - results in a family of partially observable Szilard engines. Their analysis illustrates how the demon's intelligence can be automated. At fixed angle, there is an optimal memory for each value of $T'/T$, enabling maximal engine efficiency. Those memories are probabilistic. They are computed by an algorithm derived from minimizing dissipation. We compare their quality to that of naive, deterministic coarse graining of the observable, and connect the method of finding optimal data representations to the computation of a rate-distortion function.
Subjects: Statistical Mechanics (cond-mat.stat-mech)
Cite as: arXiv:2103.15803 [cond-mat.stat-mech]
  (or arXiv:2103.15803v1 [cond-mat.stat-mech] for this version)
  https://doi.org/10.48550/arXiv.2103.15803
arXiv-issued DOI via DataCite

Submission history

From: Susanne Still [view email]
[v1] Fri, 26 Mar 2021 07:39:16 UTC (4,102 KB)
[v2] Sat, 10 Apr 2021 00:18:07 UTC (3,154 KB)
[v3] Mon, 6 Sep 2021 23:25:14 UTC (2,000 KB)
[v4] Wed, 24 Aug 2022 01:14:14 UTC (1,459 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled Partially Observable Szilard Engines, by Susanne Still and Dorian Daimer
  • View PDF
  • Other Formats
license icon view license
Current browse context:
cond-mat.stat-mech
< prev   |   next >
new | recent | 2021-03
Change to browse by:
cond-mat

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack