Quantum algorithms for cooling: A simple case study

Preparation of low-energy quantum many-body states has a wide range of applications in quantum information processing and condensed-matter physics. Quantum cooling algorithms offer a promising alternative to other methods based, for instance, on variational and adiabatic principles, or on dissipative state preparation. In this work, we investigate a set of cooling algorithms in a simple, solvable fermionic model that allows us to identify the mechanisms that underlie the cooling process and, also, those that prevent it. We derive analytical expressions for the cooling dynamics, steady states, and cooling rates in the weak-coupling limit. We find that multifrequency and randomized cycle strategies can significantly enhance the performance of the quantum algorithm and circumvent some of the obstacles. We also analyze the effects of noise and evaluate the conditions under which cooling remains feasible. Furthermore, we present optimized cooling protocols that can significantly enhance cooling performance in the presence of noise. Additionally, we compare cooling and dissipative state preparation and show that, in the model analyzed here, cooling generally achieves lower energies and is more resilient to noise.

Authors

Institutions

Publication Details

Journal
Physical Review Research
Published
2025-07-24
DOI
https://doi.org/10.1103/4hx7-xnhw
Citations
4
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
9.92
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Quantum algorithms for cooling: A simple case study

Barbara Kraus, Sirui Lu, J. I. Cirac, Karl J. Friston
4 citations
Physical Review Research
Quantum Computing Algorithms and Architecture
9.92
article

Quantum algorithms for cooling: A simple case study

Barbara Kraus, Sirui Lu, J. I. Cirac, Karl J. Friston
article en
4 citations

Abstract

Preparation of low-energy quantum many-body states has a wide range of applications in quantum information processing and condensed-matter physics. Quantum cooling algorithms offer a promising alternative to other methods based, for instance, on variational and adiabatic principles, or on dissipative state preparation. In this work, we investigate a set of cooling algorithms in a simple, solvable fermionic model that allows us to identify the mechanisms that underlie the cooling process and, also, those that prevent it. We derive analytical expressions for the cooling dynamics, steady states, and cooling rates in the weak-coupling limit. We find that multifrequency and randomized cycle strategies can significantly enhance the performance of the quantum algorithm and circumvent some of the obstacles. We also analyze the effects of noise and evaluate the conditions under which cooling remains feasible. Furthermore, we present optimized cooling protocols that can significantly enhance cooling performance in the presence of noise. Additionally, we compare cooling and dissipative state preparation and show that, in the model analyzed here, cooling generally achieves lower energies and is more resilient to noise.

Physical Review ResearchVol. 7(3)
Max Planck Institute of Quantum Optics (DE), Munich Center for Quantum Science and Technology (DE), Technical University of Munich (DE)
Affordable and clean energy
Openalex Percentile: Top 2%
Quantum Computing Algorithms and Architecture
9.92
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Quantum algorithms for cooling: A simple case study — Barbara Kraus, Sirui Lu, et al. · Physical Review Research (2025) | TGRS Research Map | TGRS