Searcharxiv⌕ Search

arXiv subjects

Ferdinand Peper

Publications and source records attributed to Ferdinand Peper.

12 recordsLinked to original sources
arXiv2025

Energy-Efficient Pseudo-Ratchet for Brownian Computers through One-Dimensional Quantum Brownian Motion

Brownian computers utilize thermal fluctuations as a resource for computation and hold promise for achieving ultra-low-energy computations. However, the lack of a statistical direction in Brownian motion necessitates the incorporation of ratchets that facilitate the speeding up and completion of computations in Brownian computers. To make the ratchet mechanism work effectively, an external field is required to overcome thermal fluctuations, which has the drawback of increasing energy consumption. As a remedy for this drawback, we introduce a new approach based on one-dimensional (1D) quantum Brownian motion, which exhibits intrinsic unidirectional transport even in the absence of external forces or asymmetric potential gradients, thereby functioning as an effective pseudo-ratchet. Specifically, we exploit that quantum resonance effects in 1D systems divide the momentum space of particles into subspaces. These subspaces have no momentum inversion symmetry, resulting in the natural emergence of unidirectional flow. We analyze this pseudo-ratchet mechanism without energy dissipation from an entropic perspective and show that it remains consistent with the second law of thermodynamics.

cond-mat.stat-mech↗
arXiv2023

Thermodynamic cost of Brownian computers in the stochastic thermodynamics of resetting

We analyze the thermodynamic cost of a logically reversible Brownian Turing machine operating in the first-passage time protocol based on the stochastic thermodynamics of resetting. In this framework, the thermodynamic cost of computation is the reset entropy production, which is interpreted as the information reduction by a resetter external to the computer. At the level of a single trajectory, the reset entropy production is associated with unidirectional transitions and is a function of the time-dependent distribution probability. We analyze an approximation that replaces the distribution probability with the empirical sojourn time, which can be obtained at the single-trajectory level. The approximation is suitable for the numerical analysis by the Gillespie algorithm and provides a reasonable average value for the reset entropy.

cond-mat.stat-mech↗
arXiv2022

Computation time and thermodynamic uncertainty relation of Brownian circuits

We analyze a token-based Brownian circuit in which Brownian particles, coined `tokens,' move randomly by exploiting thermal fluctuations, searching for a path in multi-token state space corresponding to the solution of a given problem. The circuit can evaluate a Boolean function with a unique solution. However, its computation time varies with each run. We numerically calculate the probability distributions of Brownian adders' computation time, given by the first-passage time, and analyze the thermodynamic uncertainty relation and the thermodynamic cost based on stochastic thermodynamics. The computation can be completed in finite time without environment entropy production, i.e., without wasting heat to the environment. The thermodynamics cost is paid through error-free output detection and the resets of computation cycles. The signal-to-noise ratio quantifies the computation time's predictability, and it is well estimated by the mixed bound, which is approximated by the square root of the number of token detections. The thermodynamic cost tends to play a minor role in token-based Brownian circuits in computation cycles. This contrasts with the logically reversible Brownian Turing machine, in which the entropy production increases logarithmically with the size of the state space, and thus worsens the mixed bound.

cond-mat.stat-mech↗
arXiv2018

Reservoir computing with dipole-coupled nanomagnets

The feasibility of reservoir computing based on dipole-coupled nanomagnets is demonstrated using micro-magnetic simulations. The reservoir consists of an 2x10 array of nanomagnets. The static-magnetization directions of the nanomagnets are used as reservoir states. To update these states, we change the magnetization of one nanomagnet according to a single-bit-sequential signal. We also change the uniaxial anisotropy of the other nanomagnets using a voltage-induced magnetic-anisotropy change to enhance information flow, storage, and linear/nonlinear calculations. Binary tasks with AND, OR, and XOR operations were performed to evaluate the performance of the magnetic-array reservoir. The reservoir-computing output matrix was found to be trainable to perform AND, OR, and XOR operations with an input delay of up to three bits.

cs.ET↗
arXiv2016

Response to "Comment on 'Zero and negative energy dissipation at information-theoretic erasure'"

We prove that statistical information theoretic quantities, such as information entropy, cannot generally be interrelated with the lower limit of energy dissipation during information erasure. We also point out that, in deterministic and error-free computers, the information entropy of memories does not change during erasure because its value is always zero. On the other hand, for information-theoretic erasure - i.e., "thermalization" / randomization of the memory - the originally zero information entropy (with deterministic data in the memory) changes after erasure to its maximum value, 1 bit / memory bit, while the energy dissipation is still positive, even at parameters for which the thermodynamic entropy within the memory cell does not change. Information entropy does not convert to thermodynamic entropy and to the related energy dissipation; they are quantities of different physical nature. Possible specific observations (if any) indicating convertibility are at most fortuitous and due to the disregard of additional processes that are present.

cs.ET↗
arXiv2015

Zero and negative energy dissipation at information-theoretic erasure

We introduce information-theoretic erasure based on Shannon's binary channel formula. It is pointed out that this type of erasure is a natural energy-dissipation-free way in which information is lost in double-potential-well memories, and it may be the reason why the brain can forget things effortlessly. We also demonstrate a new non-volatile, charge-based memory scheme wherein the erasure can be associated with even negative energy dissipation; this implies that the memory's environment is cooled during information erasure and contradicts Landauer's principle of erasure dissipation. On the other hand, writing new information into the memory always requires positive energy dissipation in our schemes. Finally, we show a simple system where even a classical erasure process yields negative energy dissipation of arbitrarily large energy.

cs.ET↗
arXiv2011

Information Networks Secured by the Laws of Physics

In this paper, we survey the state of the art of the secure key exchange method that is secured by the laws of classical statistical physics, and involves the Kirchhoff's law and the generalized Johnson noise equation, too. We discuss the major characteristics and advantages of these schemes especially in comparison with quantum encryption, and analyze some of the technical challenges of its implementation, too. Finally, we outline some ideas about how to use already existing and currently used wire lines, such as power lines, phone lines, internet lines to implement unconditionally secure information networks.

cs.CR↗
arXiv2011

Massively parallel computing on an organic molecular layer

Current computers operate at enormous speeds of ~10^13 bits/s, but their principle of sequential logic operation has remained unchanged since the 1950s. Though our brain is much slower on a per-neuron base (~10^3 firings/s), it is capable of remarkable decision-making based on the collective operations of millions of neurons at a time in ever-evolving neural circuitry. Here we use molecular switches to build an assembly where each molecule communicates-like neurons-with many neighbors simultaneously. The assembly's ability to reconfigure itself spontaneously for a new problem allows us to realize conventional computing constructs like logic gates and Voronoi decompositions, as well as to reproduce two natural phenomena: heat diffusion and the mutation of normal cells to cancer cells. This is a shift from the current static computing paradigm of serial bit-processing to a regime in which a large number of bits are processed in parallel in dynamically changing hardware.

cs.ET↗
arXiv2010

Instantaneous, non-squeezed, noise-based logic

Noise-based logic, by utilizing its multidimensional logic hyperspace, has significant potential for low-power parallel operations in beyond-Moore-chips. However universal gates for Boolean logic thus far had to rely on either time averaging to distinguish signals from each other or, alternatively, on squeezed logic signals, where the logic-high was represented by a random process and the logic-low was a zero signal. A major setback is that squeezed logic variables are unable to work in the hyperspace, because the logic-low zero value sets the hyperspace product vector to zero. This paper proposes Boolean universal logic gates that alleviate such shortcomings. They are able to work with non-squeezed logic values where both the high and low values are encoded into nonzero, bipolar, independent random telegraph waves. Non-squeezed universal Boolean logic gates for spike-based brain logic are also shown. The advantages vs. disadvantages of the two logic types are compared.

cs.OH↗
arXiv2010

Noise-based deterministic logic and computing: a brief survey

A short survey is provided about our recent explorations of the young topic of noise-based logic. After outlining the motivation behind noise-based computation schemes, we present a short summary of our ongoing efforts in the introduction, development and design of several noise-based deterministic multivalued logic schemes and elements. In particular, we describe classical, instantaneous, continuum, spike and random-telegraph-signal based schemes with applications such as circuits that emulate the brain's functioning and string verification via a slow communication channel.

physics.data-an↗
arXiv2010

Instantaneous noise-based logic

We show two universal, Boolean, deterministic logic schemes based on binary noise timefunctions that can be realized without time-averaging units. The first scheme is based on a new bipolar random telegraph wave scheme and the second one makes use of the recent noise-based logic which is conjectured to be the brain's method of logic operations [Physics Letters A 373 (2009) 2338-2342]. Error propagation and error removal issues are also addressed.

cs.OH↗