In this paper we extend our investigations on noise-assisted storage devices through the experimental study of a loop composed of a single Schmitt trigger and an element that introduces a finite delay. We show that such a system allows the storage of several bits and does so more efficiently for an intermediate range of noise intensities. Finally, we study the probability of erroneous information retrieval as a function of elapsed time and show a way for predicting device performance independently of the number of stored bits.
The increasing capacity of modern computers, driven by Moores Law, is accompanied by smaller noise margins and higher error rates. In this paper we propose a memory device, consisting of a ring of two identical overdamped bistable forward-coupled oscillators, which may serve as a building block in a larger scale solution to this problem. We show that such a system is capable of storing one bit and its performance improves with the addition of noise. The proposed device can be regarded as asynchronous, in the sense that stored information can be retrieved at any time and, after a certain synchronization time, the probability of erroneous retrieval does not depend on the interrogated oscillator. We characterize memory persistence time and show it to be maximized for the same noise range that both minimizes the probability of error and ensures synchronization. We also present experimental results for a hard-wired version of the proposed memory, consisting of a loop of two Schmitt triggers. We show that this device is capable of storing one bit and does so more efficiently in the presence of noise.
The interplay between nonlinear dynamic systems and noise has proved to be of great relevance in several application areas. In this presentation, we focus on the areas of information transmission and storage. We review some recent results on information transmission through nonlinear channels assisted by noise. We also present recent proposals of memory devices in which noise plays an essential role. Finally, we discuss new results on the influence of noise in memristors.
Natural and artificial networks, from the cerebral cortex to large-scale power grids, face the challenge of converting noisy inputs into robust signals. The input fluctuations often exhibit complex yet statistically reproducible correlations that reflect underlying internal or environmental processes such as synaptic noise or atmospheric turbulence. This raises the practically and biophysically relevant of question whether and how noise-filtering can be hard-wired directly into a networks architecture. By considering generic phase oscillator arrays under cost constraints, we explore here analytically and numerically the design, efficiency and topology of noise-canceling networks. Specifically, we find that when the input fluctuations become more correlated in space or time, optimal network architectures become sparser and more hierarchically organized, resembling the vasculature in plants or animals. More broadly, our results provide concrete guiding principles for designing more robust and efficient power grids and sensor networks.
I analyze a metrological strategy for improving the precision of frequency estimation via Ramsey interferometry with strings of atoms in the presence of correlated dephasing. This strategy does not employ entangled states, but rather a product state which evolves into a stationary state under the influence of correlated dephasing. It is shown that by using this state an improvement in precision compared to standard Ramsey interferometry can be gained. This improvement is not an improvement in scaling, i.e. the estimation precision has the same scaling with the number of atoms as the standard quantum limit, but an improvement proportional to the free evolution time in the Ramsey interferometer. Since a stationary state is used, this evolution time can be substantially larger than in standard Ramsey interferometry which is limited by the coherence time of the atoms.
Quantum autoencoder is an efficient variational quantum algorithm for quantum data compression. However, previous quantum autoencoders fail to compress and recover high-rank mixed states. In this work, we discuss the fundamental properties and limitations of the standard quantum autoencoder model in more depth, and provide an information-theoretic solution to its recovering fidelity. Based on this understanding, we present a noise-assisted quantum autoencoder algorithm to go beyond the limitations, our model can achieve high recovering fidelity for general input states. Appropriate noise channels are used to make the input mixedness and output mixedness consistent, the noise setup is determined by measurement results of the trash system. Compared with the original quantum autoencoder model, the measurement information is fully used in our algorithm. In addition to the circuit model, we design a (noise-assisted) adiabatic model of quantum autoencoder that can be implemented on quantum annealers. We verified the validity of our methods through compressing the thermal states of transverse field Ising model and Werner states. For pure state ensemble compression, we also introduce a projected quantum autoencoder algorithm.