{"paper":{"title":"Erasure without work in an asymmetric, double-well potential","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"John Bechhoefer, Mom\\v{c}ilo Gavrilov","submitted_at":"2016-07-08T17:18:56Z","abstract_excerpt":"According to Landauer's principle, erasing a memory requires an average work of at least $kT\\ln2$ per bit. Recent experiments have confirmed this prediction for a one-bit memory represented by a symmetric double-well potential. Here, we present an experimental study of erasure for a memory encoded in an asymmetric double-well potential. Using a feedback trap, we find that the average work to erase can be less than $kT\\ln2$. Surprisingly, erasure protocols that differ subtly give measurably different values for the asymptotic work, a result we explain by showing that one protocol is symmetric w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02458","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}