Related papers: Minimal thermodynamic cost of computing with circu…
The MapReduce framework has firmly established itself as one of the most widely used parallel computing platforms for processing big data on tera- and peta-byte scale. Approaching it from a theoretical standpoint has proved to be…
We establish a rigorous connection between fundamental resource theories at the quantum scale. Correlations and entanglement constitute indispensable resources for numerous quantum information tasks. However, their establishment comes at…
Monotone Boolean functions, and the monotone Boolean circuits that compute them, have been intensively studied in complexity theory. In this paper we study the structure of Boolean functions in terms of the minimum number of negations in…
Biomolecular systems like molecular motors or pumps, transcription and translation machinery, and other enzymatic reactions can be described as Markov processes on a suitable network. We show quite generally that in a steady state the…
Approximate circuits trading the power consumption for the quality of results play a key role in the development of energy-aware systems. Designing complex approximate circuits is, however, a very difficult and computationally demanding…
In Boolean synthesis, we are given an LTL specification, and the goal is to construct a transducer that realizes it against an adversarial environment. Often, a specification contains both Boolean requirements that should be satisfied…
The token-based Brownian circuit harnesses the Brownian motion of particles for computation. The conservative join (CJoin) is a circuit element that synchronizes two Brownian particles, and its realization using repelling particles, such as…
A standard approach to optimizing long-run running costs of discrete systems is based on minimizing the mean-payoff, i.e., the long-run average amount of resources ("energy") consumed per transition. However, this approach inherently…
The erasure of information is fundamentally an irreversible logical operation, carrying profound consequences for the energetics of computation and information processing. We investigate the thermodynamic costs associated with erasing (and…
Quantum complexity measures the difficulty of realizing a quantum process, such as preparing a state or implementing a unitary. We present an approach to quantifying the thermodynamic resources required to implement a process if the…
Random instances of feedforward Boolean circuits are studied both analytically and numerically. Evaluating these circuits is known to be a P-complete problem and thus, in the worst case, believed to be impossible to perform, even given a…
The importance of low power consumption is widely acknowledged due to the increasing use of portable devices, which require minimizing the consumption of energy. The energy in a computational system depends heavily on the software being…
The fundamental problem considered in this paper is "What is the \textit{energy} consumed for the implementation of a \emph{compressive sensing} decoding algorithm on a circuit?". Using the "information-friction" framework, we examine the…
We present a constructive method to create quantum circuits that implement oracles $|x\rangle|y\rangle|0\rangle^k \mapsto |x\rangle|y \oplus f(x)\rangle|0\rangle^k$ for $n$-variable Boolean functions $f$ with low $T$-count. In our method…
We introduce a framework designed to analyze the thermodynamics of an abstractly defined logical computer like a deterministic finite automaton (DFA) or a Turing machine, without specifying any extraneous parameters (like rate matrices,…
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…
When planning transportation whose operation requires non-consumable resources, the peak demand for allocated resources is often of higher interest than the duration of resource usage. For instance, it is more cost-effective to deliver…
One of the primary motivations of the research in the field of computation is to optimize the cost of computation. The major ingredient that a computer needs is the energy to run a process, i.e., the thermodynamic cost. The analysis of the…
Recent understanding of the thermodynamics of small-scale systems have enabled the characterization of the thermodynamic requirements of implementing quantum processes for fixed input states. Here, we extend these results to construct…
Quantifying the complexity of quantum states that possess intrinsic structure, such as symmetry or encoding, in a fair manner constitutes a core challenge in the benchmarking of quantum technologies. This paper introduces the…