Attractor-Keyed Memory
Natalia G. Berloff

TL;DR
This paper introduces a method to use high-dimensional, repeatable device signatures for combined selection and memory access via linear decoding, reducing latency and energy in routing architectures, with validation on simulations and a proposed experimental protocol.
Contribution
It presents a linear decoding approach for device signatures that merges selection and memory access, with theoretical error bounds and validation on simulated data.
Findings
Decoding fidelity depends on dictionary conditioning.
Routing reliability is influenced by the margin-to-noise ratio.
Simulations validate the predicted error scalings.
Abstract
Physical selectors (lasers choosing a mode, Ising machines settling on a ground state, condensates occupying a spin state) produce high-dimensional signatures at the moment of decision: full field amplitudes, multimode interference patterns, or scattering responses. These signatures are richer than the winner's index, yet they are routinely discarded. We show that when the signatures are repeatable across trials (stereotyped) and linearly independent across routes, a single linear decoder compiled from calibration data maps them to arbitrary payloads, merging selection and memory access into one event and eliminating the fetch that dominates latency and energy in sparse routing architectures. The construction requires one SVD of measured device responses, which certifies capability and bounds worst-case error for any downstream payload before the task is chosen. Runtime error separates…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Reservoir Computing · Quantum Computing Algorithms and Architecture · Magnetic properties of thin films
