Simple scheme for extracting work with a single bath

• URL: http://arxiv.org/abs/1806.11384v2
• Date: Mon, 11 Sep 2023 14:32:11 GMT
• Title: Simple scheme for extracting work with a single bath
• Authors: Nicol\`o Piccione, Benedetto Militello, Anna Napoli, Bruno Bellomo
• Abstract summary: The protocol is based on a recent work definition involving only a single bath. We quantify both the extracted work and the ideal efficiency of the process also giving maximum bounds for them. Our proposal makes use of simple operations not needing fine control.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose a simple protocol exploiting the thermalization of a $\textit{storage}$ bipartite system $S$ to extract work from a $\textit{resource}$ system $R$. The protocol is based on a recent work definition involving only a single bath. A general description of the protocol is provided without specifying the characteristics of $S$. We quantify both the extracted work and the ideal efficiency of the process also giving maximum bounds for them. Then, we apply the protocol to two cases: two interacting qubits and the Rabi model. In both cases, for very strong couplings, an extraction of work comparable with the bare energies of the subsystems of $S$ is obtained and its peak is reached for finite values of the bath temperature, $T$. We finally show, in the Rabi model at $T=0$, how to transfer the work stored in $S$ to an external device, permitting thus a cyclic implementation of the whole work-extraction protocol. Our proposal makes use of simple operations not needing fine control.

Related papers

• One-Shot Non-Catalytic Distributed Purity Distillation [7.1221402714048505]
  It is important to develop protocols that extract a fixed pure state from a known mixed state. In this work, we study the problem of extracting a fixed pure state $|0rangleA' |0rangleB'$ from a known pure state. In addition, we derive upper bounds for the rate of distillation in the one shot setting, which nearly match our achievable bounds.
  arXiv  Detail & Related papers  (2024-03-25T06:48:50Z)
• Extraction of Work via a Thermalization Protocol [0.0]
  We show that it is possible to exploit a thermalization process to extract work from a resource system $R$ to a bipartite system $S$. We find the theoretical bounds of the protocol in the general case and show that when applied to the Rabi model it gives rise to a satisfactory extraction of work and efficiency.
  arXiv  Detail & Related papers  (2023-09-08T08:01:40Z)
• Collective advantages in finite-time thermodynamics [0.0]
  We show that $W_rm disspropto Nx$ can be dramatically reduced by considering collective protocols in which interactions are suitably created along the protocol. As an application of these results, we focus on the erasure of information in finite time and prove a faster convergence to Landauer's bound.
  arXiv  Detail & Related papers  (2023-06-28T20:10:02Z)
• Trade-offs between Entanglement and Communication [5.88864611435337]
  We show that quantum simultaneous protocols with $tildeTheta(k5 log3 n)$ qubits of entanglement can exponentially outperform two-way randomized protocols with $O(k)$ qubits of entanglement. Prior to our work, only a relational separation was known.
  arXiv  Detail & Related papers  (2023-06-02T01:49:39Z)
• Cooperative Multi-Agent Reinforcement Learning: Asynchronous Communication and Linear Function Approximation [77.09836892653176]
  We study multi-agent reinforcement learning in the setting of episodic Markov decision processes. We propose a provably efficient algorithm based on value that enable asynchronous communication. We show that a minimal $Omega(dM)$ communication complexity is required to improve the performance through collaboration.
  arXiv  Detail & Related papers  (2023-05-10T20:29:29Z)
• Controlled remote implementation of operations via graph states [7.238541917115604]
  We propose protocols for controlled remote implementation of operations with convincing control power. Sharing a $(2N+1)$-partite graph state, $2N$ participants collaborate to prepare the stator and realize the operation. We show that the control power of our protocol is reliable by positive operator valued measurement.
  arXiv  Detail & Related papers  (2022-10-26T12:50:14Z)
• Reward-Mixing MDPs with a Few Latent Contexts are Learnable [75.17357040707347]
  We consider episodic reinforcement learning in reward-mixing Markov decision processes (RMMDPs) Our goal is to learn a near-optimal policy that nearly maximizes the $H$ time-step cumulative rewards in such a model.
  arXiv  Detail & Related papers  (2022-10-05T22:52:00Z)
• Reward-Free Model-Based Reinforcement Learning with Linear Function Approximation [92.99933928528797]
  We study the model-based reward-free reinforcement learning with linear function approximation for episodic Markov decision processes (MDPs) In the planning phase, the agent is given a specific reward function and uses samples collected from the exploration phase to learn a good policy. We show that to obtain an $epsilon$-optimal policy for arbitrary reward function, UCRL-RFE needs to sample at most $tilde O(H4d(H + d)epsilon-2)$ episodes.
  arXiv  Detail & Related papers  (2021-10-12T23:03:58Z)
• The Power of Subsampling in Submodular Maximization [51.629656762796564]
  We show that this approach leads to optimal/state-of-the-art results despite being much simpler than existing methods. We empirically demonstrate the effectiveness of our algorithms on video summarization, location summarization, and movie recommendation tasks.
  arXiv  Detail & Related papers  (2021-04-06T20:25:57Z)
• Nearly Minimax Optimal Reward-free Reinforcement Learning [88.75843804630772]
  We study the reward-free reinforcement learning framework, which is particularly suitable for batch reinforcement learning and scenarios where one needs policies for multiple reward functions. We give a new efficient algorithm, textbfStaged textbfSampling + textbfTruncated textbfPlanning (algoname), which interacts with the environment at most $Oleft( fracS2Aepsilon2textpolylogleft(fracSAHepsilon2
  arXiv  Detail & Related papers  (2020-10-12T17:51:19Z)
• On Distributed Differential Privacy and Counting Distinct Elements [52.701425652208734]
  We study the setup where each of $n$ users holds an element from a discrete set. The goal is to count the number of distinct elements across all users.
  arXiv  Detail & Related papers  (2020-09-21T04:13:34Z)

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

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.