Efficiently Cooling Quantum Systems with Finite Resources: Insights from Thermodynamic Geometry

• URL: http://arxiv.org/abs/2404.06649v2
• Date: Thu, 20 Feb 2025 09:21:32 GMT
• Title: Efficiently Cooling Quantum Systems with Finite Resources: Insights from Thermodynamic Geometry
• Authors: Philip Taranto, Patryk Lipka-Bartosik, Nayeli A. Rodríguez-Briones, Martí Perarnau-Llobet, Nicolai Friis, Marcus Huber, Pharnam Bakhshinezhad,
• Abstract summary: Landauer's limit on heat dissipation during information erasure is critical as devices shrink. We address the challenge of cooling quantum systems with finite resources.
• Score: 0.0
• License:
• Abstract: Landauer's limit on heat dissipation during information erasure is critical as devices shrink, requiring optimal pure-state preparation to minimise errors. However, Nernst's third law states this demands infinite resources in energy, time, or control complexity. We address the challenge of cooling quantum systems with finite resources. Using Markovian collision models, we explore resource trade-offs and present efficient cooling protocols (that are optimal for qubits) for coherent and incoherent control. Leveraging thermodynamic length, we derive bounds on heat dissipation for swap-based strategies and discuss the limitations of preparing pure states efficiently.

Related papers

• Dynamical freezing in the thermodynamic limit: the strongly driven ensemble [37.31317754926534]
  A periodically driven (Floquet) system in the absence of any conservation law heats to a featureless infinite temperature' state. Here, we find--for a clean and interacting generic spin chain--that this can be prevented by the emergence of it approximate but stable conservation-laws not present in the undriven system. We show numerically, it in the thermodynamic limit,' that when required by these emergent conservation-laws, the entanglement-entropy density of an infinite subsystem remains zero.
  arXiv  Detail & Related papers  (2024-10-14T19:57:43Z)
• Formalizing, Normalizing, and Splitting the Energy Network Re-Dispatch for Quantum Annealing [37.81697222352684]
  Adiabatic quantum computation (AQC) is a well-established method to approximate the ground state of a quantum system. In this work, we investigate issues in the context of energy network re-dispatch problems. Our results are compared to baselines from an open-source energy network simulation.
  arXiv  Detail & Related papers  (2024-09-15T20:29:40Z)
• One-Shot Min-Entropy Calculation And Its Application To Quantum Cryptography [21.823963925581868]
  We develop a one-shot lower bound calculation technique for the min-entropy of a classical-quantum state. It gives an alternative tight finite-data analysis for the well-known BB84 quantum key distribution protocol. It provides a security proof for a novel source-independent continuous-variable quantum random number generation protocol.
  arXiv  Detail & Related papers  (2024-06-21T15:11:26Z)
• A Shortcut to Finite-time Memory Erasure [1.7818230914983046]
  We propose a shortcut strategy that incorporates an auxiliary control to guide the system towards an equilibrium state. We derive an optimal shortcut protocol for erasure processes that minimizes the energy cost.
  arXiv  Detail & Related papers  (2023-07-03T12:32:25Z)
• Quantum Thermal State Preparation [39.91303506884272]
  We introduce simple continuous-time quantum Gibbs samplers for simulating quantum master equations. We construct the first provably accurate and efficient algorithm for preparing certain purified Gibbs states. Our algorithms' costs have a provable dependence on temperature, accuracy, and the mixing time.
  arXiv  Detail & Related papers  (2023-03-31T17:29:56Z)
• Model-free optimization of power/efficiency tradeoffs in quantum thermal machines using reinforcement learning [0.0]
  A quantum thermal machine is an open quantum system that enables the conversion between heat and work at the micro or nano-scale. We introduce a general model-free framework based on Reinforcement Learning to identify out-of-equilibrium thermodynamic cycles.
  arXiv  Detail & Related papers  (2022-04-10T22:44:28Z)
• Gauge Quantum Thermodynamics of Time-local non-Markovian Evolutions [77.34726150561087]
  We deal with a generic time-local non-Markovian master equation. We define current and power to be process-dependent as in classical thermodynamics. Applying the theory to quantum thermal engines, we show that gauge transformations can change the machine efficiency.
  arXiv  Detail & Related papers  (2022-04-06T17:59:15Z)
• Fast Thermalization from the Eigenstate Thermalization Hypothesis [69.68937033275746]
  Eigenstate Thermalization Hypothesis (ETH) has played a major role in understanding thermodynamic phenomena in closed quantum systems. This paper establishes a rigorous link between ETH and fast thermalization to the global Gibbs state. Our results explain finite-time thermalization in chaotic open quantum systems.
  arXiv  Detail & Related papers  (2021-12-14T18:48:31Z)
• Finite-Time Quantum Landauer Principle and Quantum Coherence [0.0]
  We show that the dissipated heat is lower-bounded by the conventional Landauer cost. We derive a lower bound for heat dissipation in terms of quantum coherence.
  arXiv  Detail & Related papers  (2021-06-10T13:44:31Z)
• Landauer vs. Nernst: What is the True Cost of Cooling a Quantum System? [0.0]
  Third law of thermodynamics states that infinite resources are required to cool a system to absolute zero temperature. We identify the resources that enable the creation of pure quantum states. We show that perfect cooling is possible with Landauer energy cost given infinite time or control complexity.
  arXiv  Detail & Related papers  (2021-06-09T15:49:43Z)
• Exponential improvement for quantum cooling through finite-memory effects [0.0]
  We study the effects of memory on quantum cooling. For qubits, our bound coincides with that of heat-bath algorithmic cooling. We describe the adaptive step-wise optimal protocol that outperforms all standard procedures.
  arXiv  Detail & Related papers  (2020-04-01T10:29:10Z)

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.