Related papers: Minimal thermodynamic cost of computing with circu…
Despite significant progress in quantum computing in recent years, executing quantum circuits for practical problems remains challenging due to error-prone quantum hardware. Hence, quantum error correction becomes essential but induces…
Many synthesis approaches for reversible and quantum logic have been proposed so far. However, most of them generate circuits with respect to simple metrics, i.e. gate count or quantum cost. On the other hand, to physically realize…
We implement a recently proposed event-triggered networked MPC approach on industrial hardware to analyze its practical relevance. There exist several alternatives for such an implementation that differ with respect to the distribution of…
From thermodynamics point of view, in this era of aiming at energy conservation and sustainability, we need to develop more accurate ways to design thermal power, cooling and heat pump cycles. It has been the general practice in…
Understanding the computational power of noisy intermediate-scale quantum (NISQ) devices is of both fundamental and practical importance to quantum information science. Here, we address the question of whether error-uncorrected noisy…
Thermodynamic uncertainty relations unveil useful connections between fluctuations in thermal systems and entropy production. This work extends these ideas to the disparate field of \textit{zero temperature} quantum mesoscopic physics where…
We investigate computing models that are presented as families of finite computing devices with a uniformity condition on the entire family. Examples of such models include Boolean circuits, membrane systems, DNA computers, chemical…
The theory of thermal macroeconomics (TM) analyses economic phenomena within the mathematical framework of classical thermodynamics, using a set of axioms that apply to the purely macroscopic aspects of an economy [CM]. The theory shows…
In the area of query complexity of Boolean functions, the most widely studied cost measure of an algorithm is the worst-case number of queries made by it on an input. Motivated by the most natural cost measure studied in online algorithms,…
We give an $\widetilde{O}({m^{3/2 - 1/762} \log (U+W))}$ time algorithm for minimum cost flow with capacities bounded by $U$ and costs bounded by $W$. For sparse graphs with general capacities, this is the first algorithm to improve over…
There is increasing interest in the development of gate-based quantum circuits for the training of machine learning models. Yet, little is understood concerning the parameters of circuit design, and the effects of noise and other…
The minimum number of NOT gates in a Boolean circuit computing a Boolean function is called the inversion complexity of the function. In 1957, A. A. Markov determined the inversion complexity of every Boolean function and proved that…
In this paper an analysis of the Stirling cycle in thermoeconomic terms is developed using the entropy generation. In the thermoeconomic optimization of an irreversible Stirling heat pump cycle the F function has been introduced to evaluate…
The minimum amount of thermodynamic work required in order to implement a quantum computation or a quantum state transformation can be quantified using frameworks based on the resource theory of thermodynamics, deeply rooted in the works of…
Following up on the recently published circuit theory for thermodynamic devices, we consider networks of Thermo-Electric Converters (TECs) in stationary non-equilibrium. Assuming constant thermoelectric properties, the integration over a…
In the Minimum Clique Routing Problem on Cycles \textsc{MCRPC} we are given a cycle together with a set of demands (weighted origin-destination pairs) and the goal is to route all the pairs minimizing the maximum weighted clique of the…
Due to its non-crystalline nature, the glassy state has remained one the most exciting scientific challenges. To study such materials, Molecular Dynamics (MD) simulations have been extensively used because they provide a direct view into…
The matching problem is a notorious combinatorial optimization problem that has attracted for many years the attention of the statistical physics community. Here we analyze the Euclidean version of the problem, i.e. the optimal matching…
Given a set of discrete probability distributions, the minimum entropy coupling is the minimum entropy joint distribution that has the input distributions as its marginals. This has immediate relevance to tasks such as entropic causal…
The problem of constructing hazard-free Boolean circuits (those avoiding electronic glitches) dates back to the 1940s and is an important problem in circuit design and even in cybersecurity. We show that a DeMorgan circuit is hazard-free if…