Trade-off between Cooling-Step Count and Geometric Implementation Cost in Non-Markovian Algorithmic Cooling

• URL: http://arxiv.org/abs/2608.30660v1
• Date: Mon, 31 Aug 2026 12:01:59 GMT
• Title: Trade-off between Cooling-Step Count and Geometric Implementation Cost in Non-Markovian Algorithmic Cooling
• Abstract summary: We investigate how reservoir memory affects the trade-off between cooling performance quantified by the cooling-step count and geometric implementation cost.<n>We identify a trade-off: suppressing reservoir memory reduces the cooling-step count but generally increases the geometric protocol cost.
• Score: 0.3867363075280543
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum cooling is important for reliable quantum computation but involves a trade-off between cooling performance and implementation resources. Although reservoir memory can improve particular aspects of cooling performance, the associated resource cost, particularly for circuit implementation, remains insufficiently understood. Here, we investigate how reservoir memory affects the trade-off between cooling performance quantified by the cooling-step count and geometric implementation cost in single-qubit heat-bath algorithmic cooling. Using a pseudomode mapping, we represent the non-Markovian damped Jaynes--Cummings dynamics by a repeated collision circuit and evaluate its geometric implementation cost. Using matrix-based simulations and an implementation on the ibm_kawasaki Heron r2 processor, we identify a trade-off: suppressing reservoir memory reduces the cooling-step count but generally increases the geometric protocol cost. Our work provides a resource-based perspective on reservoir engineering for algorithmic cooling.

Related papers

• Bridging Inference-Time Scaling and Episodic Memory with Action-Centric Graphs [48.754678397305355]
  We propose a novel framework, textitGAMER(Graph-based Action-centric Memory with Episodic Reasoning), that bridges the gap between inference scaling and episodic memory.<n>Our approach models historical reasoning as a dynamic textitAction-Centric Graph.<n> Experiments on multiple benchmarks demonstrate that textitGAMER achieves superior performance by textbf20.81%/6.17% for success/progress rate compared to vanilla baselines.
  arXiv  Detail & Related papers  (2026-07-29T19:31:50Z)
• MemRec: Collaborative Memory-Augmented Agentic Recommender System [57.548438733740504]
  We propose MemRec, a framework that architecturally decouples reasoning from memory management.<n>MemRec introduces a dedicated LM_Mem to manage a dynamic collaborative memory graph.<n>It achieves state-of-the-art performance on four benchmarks.
  arXiv  Detail & Related papers  (2026-01-13T18:51:16Z)
• XQuant: Breaking the Memory Wall for LLM Inference with KV Cache Rematerialization [58.92253769255316]
  LLM inference is challenging due to substantial memory footprint and bandwidth requirements.<n>XQuant exploits the rapidly increasing compute capabilities of hardware platforms to eliminate the memory bottleneck.<n>XQuant-CL exploits the cross-layer similarity in the X embeddings for extreme compression.
  arXiv  Detail & Related papers  (2025-08-14T06:52:38Z)
• Cooling a Qubit using n Others [0.0]
  We show that a set of inequalities related to the energetic structure of the $n$ qubit machine determines the optimal cooling protocol.<n>We also show that cooling protocols can be represented as perfect matchings on bipartite graphs.
  arXiv  Detail & Related papers  (2025-06-11T18:00:00Z)
• Practical Application of the Quantum Carleman Lattice Boltzmann Method in Industrial CFD Simulations [44.99833362998488]
  This work presents a practical numerical assessment of a hybrid quantum-classical approach to CFD based on the Lattice Boltzmann Method (LBM)<n>We evaluate this method on three benchmark cases featuring different boundary conditions, periodic, bounceback, and moving wall.<n>Our results confirm the validity of the approach, achieving median error fidelities on the order of $10-3$ and success probabilities sufficient for practical quantum state sampling.
  arXiv  Detail & Related papers  (2025-04-17T15:41:48Z)
• CalibQuant: 1-Bit KV Cache Quantization for Multimodal LLMs [45.77132019859689]
  CalibQuant is a visual quantization strategy that drastically reduces both memory and computational overhead.<n>We achieve a 10x throughput increase on InternVL models.
  arXiv  Detail & Related papers  (2025-02-15T05:08:01Z)
• Forget Forgetting: Continual Learning in a World of Abundant Memory [55.64184779530581]
  Continual learning has traditionally focused on minimizing exemplar memory.<n>This paper challenges this paradigm by investigating a more realistic regime.<n>We find that the core challenge shifts from stability to plasticity, as models become biased toward prior tasks and struggle to learn new ones.
  arXiv  Detail & Related papers  (2025-02-11T05:40:52Z)
• The application of annealing in quantum cooling protocols [0.0]
  We describe the cooling process based on perturbation theory, validated the advantages of bath under time-modulated Zeeman field.<n>We show that the cooling protocol's resistance to noise depends on the type of quantum noise.
  arXiv  Detail & Related papers  (2025-01-09T14:24:07Z)
• Improving Quantum Machine Learning via Heat-Bath Algorithmic Cooling [0.46040036610482665]
  This work introduces an approach rooted in quantum thermodynamics to enhance sampling efficiency in quantum machine learning (QML)<n>We develop a quantum refrigerator protocol that enhances sample efficiency during training and prediction without the need for Grover iterations or quantum phase estimation.
  arXiv  Detail & Related papers  (2025-01-05T23:34:05Z)
• QuL: Programming Library for Computational Cooling of Qubits [0.0]
  A key hurdle to the success of quantum computers is the ability to initialize qubits into a pure state. Computational cooling of qubits, whereby a subset of the qubits is cooled at the expense of heating the other qubits, offers a route to effectively cool qubits. We present QuL, a programming library which can be used to generate, analyze, and test quantum circuits for various computational cooling protocols.
  arXiv  Detail & Related papers  (2024-10-17T09:32:02Z)
• Deep Equilibrium Optical Flow Estimation [80.80992684796566]
  Recent state-of-the-art (SOTA) optical flow models use finite-step recurrent update operations to emulate traditional algorithms. These RNNs impose large computation and memory overheads, and are not directly trained to model such stable estimation. We propose deep equilibrium (DEQ) flow estimators, an approach that directly solves for the flow as the infinite-level fixed point of an implicit layer.
  arXiv  Detail & Related papers  (2022-04-18T17:53:44Z)
• 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.