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

We consider the minimal thermodynamic cost of an individual computation, where a single input x is mapped to 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 that 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 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 minimal cost of mapping x to y that must be paid using some combination of heat, noise, and protocol complexity, implying a trade-off between these three resources. Our result is a kind of "algorithmic fluctuation theorem" with implications for the relationship between the second law and the Physical Church-Turing thesis.