Related papers: Universal thermodynamic implementation of a process with a variable work cost

Universal thermodynamic implementation of a process with a variable work cost

URL: http://arxiv.org/abs/2601.20155v1
Date: Wed, 28 Jan 2026 01:26:34 GMT
Title: Universal thermodynamic implementation of a process with a variable work cost
Authors: Philippe Faist,
Abstract summary: We construct a thermodynamic implementation of $n$ i.i.d. copies of any time-covariant quantum channel.<n>We show that for any time-covariant i.i.d. input state, the state on the output system faithfully reproduces that of the desired process.
Score: 0.2417342411475111
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: 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 Landauer and Bennett. For instance, the work we need to invest in order to implement $n$ independent and identically distributed (i.i.d.) copies of a quantum channel is quantified by the thermodynamic capacity of the channel when we require the implementation's accuracy to be guaranteed in diamond norm over the $n$-system input. Recent work showed that work extraction can be implemented universally, meaning the same implementation works for a large class of input states, while achieving a variable work cost that is optimal for each individual i.i.d. input state. Here, we revisit some techniques leading to derivation of the thermodynamic capacity, and leverage them to construct a thermodynamic implementation of $n$ i.i.d. copies of any time-covariant quantum channel, up to some process decoherence that is necessary because the implementation reveals the amount of consumed work. The protocol uses so-called thermal operations and achieves the optimal per-input work cost for any i.i.d. input state; it relies on the conditional erasure protocol in our earlier work, adjusted to yield variable work. We discuss the effect of the work-cost decoherence. While it can significantly corrupt the correlations between the output state and any reference system, we show that for any time-covariant i.i.d. input state, the state on the output system faithfully reproduces that of the desired process to be implemented. As an immediate consequence of our results, we recover recent results for optimal work extraction from i.i.d. states up to the error scaling and implementation specifics, and propose an optimal preparation protocol for time-covariant i.i.d. states.

Related papers

Optimal Computation from Fluctuation Responses [0.0]
A key open question is how to design protocols that minimize thermodynamic cost while ensur- ing correct outcomes.<n>We develop a unified framework to identify optimal protocols using fluctuation response relations (FRR) and machine learning.<n>Results provide principled strategies for designing thermodynamically efficient protocols in physical information-processing systems.
arXiv Detail & Related papers (2025-10-04T18:49:00Z)
Entanglement theory with limited computational resources [0.29998889086656577]
We show that computational entanglement measures diverge significantly from information-theoretic counterparts.<n>While the von Neumann entropy captures information-theoretic rates for pure-state transformations, we show that under computational constraints, the min-entropy governs optimal entanglement distillation.<n>Our results establish a stark, maximal separation of $tildeOmega(n)$ vs. $o(1)$ between computational and information-theoretic entanglement measures.
arXiv Detail & Related papers (2025-02-17T19:43:59Z)
Automated Rewards via LLM-Generated Progress Functions [47.50772243693897]
Large Language Models (LLMs) have the potential to automate reward engineering by leveraging their broad domain knowledge across various tasks. This paper introduces an LLM-driven reward generation framework that is able to produce state-of-the-art policies on the challenging Bi-DexHands benchmark.
arXiv Detail & Related papers (2024-10-11T18:41:15Z)
Thermodynamically Optimal Protocols for Dual-Purpose Qubit Operations [0.0]
We develop protocols to transform two states in an energetically optimal manner. Our results uncover a fundamental incompatibility between the thermodynamic ideal of slow, quasistatic processes and the information-theoretic requirement to preserve distinguishablity between different possible output states.
arXiv Detail & Related papers (2023-06-15T12:36:12Z)
Optimizing thermalizations [0.0]
We present a rigorous approach, based on the concept of continuous thermomajorisation, to algorithmically characterise the full set of energy occupations of a quantum system. We illustrate this by finding optimal protocols in the context of cooling, work extraction and optimal sequences. The same tools also allow one to quantitatively assess the role played by memory effects in the performance of thermodynamic protocols.
arXiv Detail & Related papers (2022-02-25T11:05:39Z)
Dynamical learning of a photonics quantum-state engineering process [48.7576911714538]
Experimentally engineering high-dimensional quantum states is a crucial task for several quantum information protocols. We implement an automated adaptive optimization protocol to engineer photonic Orbital Angular Momentum (OAM) states. This approach represents a powerful tool for automated optimizations of noisy experimental tasks for quantum information protocols and technologies.
arXiv Detail & Related papers (2022-01-14T19:24:31Z)
An Experimental Design Perspective on Model-Based Reinforcement Learning [73.37942845983417]
In practical applications of RL, it is expensive to observe state transitions from the environment. We propose an acquisition function that quantifies how much information a state-action pair would provide about the optimal solution to a Markov decision process.
arXiv Detail & Related papers (2021-12-09T23:13:57Z)
Optimal control of quantum thermal machines using machine learning [0.0]
We show that differentiable programming (DP) can be employed to optimize finite-time thermodynamical processes in a quantum thermal machine. We formulate the STA driving protocol as a constrained optimization task and apply DP to find optimal driving profiles for an appropriate figure of merit. Our method and results demonstrate that ML is beneficial both for solving hard-constrained quantum control problems and for devising and assessing their theoretical groundwork.
arXiv Detail & Related papers (2021-08-27T18:00:49Z)
Gaussian conversion protocols for cubic phase state generation [104.23865519192793]
Universal quantum computing with continuous variables requires non-Gaussian resources. The cubic phase state is a non-Gaussian state whose experimental implementation has so far remained elusive. We introduce two protocols that allow for the conversion of a non-Gaussian state to a cubic phase state.
arXiv Detail & Related papers (2020-07-07T09:19:49Z)
Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
arXiv Detail & Related papers (2020-04-14T11:05:26Z)
Simulation of Thermal Relaxation in Spin Chemistry Systems on a Quantum Computer Using Inherent Qubit Decoherence [53.20999552522241]
We seek to take advantage of qubit decoherence as a resource in simulating the behavior of real world quantum systems. We present three methods for implementing the thermal relaxation. We find excellent agreement between our results, experimental data, and the theoretical prediction.
arXiv Detail & Related papers (2020-01-03T11:48:11Z)

This list is automatically generated from the titles and abstracts of the papers in this site.