Generalized Zurek's bound on the cost of an individual classical or quantum computation

Abstract

We consider the minimal thermodynamic cost of an individual computation, where a single input x is transformed into a single output y. In prior work, Zurek proposed that this cost was given by K(x|y), the conditional Kolmogorov complexity of x given y (up to an additive constant which does not depend on x or y). However, this result was derived from an informal argument, applied only to deterministic computations, and had an arbitrary dependence on the choice of physical protocol (via the additive constant). Here we use stochastic thermodynamics to derive a generalized version of Zurek's bound from a rigorous Hamiltonian formulation. Our bound applies to all quantum and classical processes, whether noisy or deterministic, and it explicitly captures the dependence on the protocol. We show that K(x|y) is a fundamental cost of mapping x to y which must be paid using some combination of heat, noise, and protocol complexity, implying a tradeoff between these three resources. We also show that this bound is achievable. Our result is a kind of "algorithmic fluctuation theorem" which has implications for the relationship between the Second Law and the Physical Church-Turing thesis.

Exploring Simplicity Bias in 1D Dynamical Systems

“…Note that Shannon information and Kolmogorov complexity are related [21], but differ fundamentally in that Shannon information quantifies the information or complexity of a random source, while Kolmogorov complexity quantifies the information of individual sequences or objects. An increasing number of studies show that AIT and Kolmogorov complexity can be successfully applied in physics, including thermodynamics [22][23][24][25], quantum physics [26], and entropy estimation [27,28]. Further, they also have numerous potential applications in biology [8,29,30], other natural sciences [31], and engineering [16,32,33].…”