.png){kind=icon}
.png){kind=icon}
Return
Efficient quantum thermal simulation
.png){kind=icon}
OA
AI
DOI：10.1038/s41586-025-09583-x.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Quantum computers promise to tackle quantum simulation problems that are classically intractable1. Although a lot of quantum algorithms2–4 have been developed for simulating quantum dynamics, a general-purpose method for simulating low-temperature quantum phenomena remains unknown. In classical settings, the analogous task of sampling from thermal distributions has been largely addressed by Markov Chain Monte Carlo (MCMC) methods5,6. Here we propose an efficient quantum algorithm for thermal simulation that—akin to MCMC methods—exhibits detailed balance, respects locality and serves as a toy model for thermalization in open quantum systems. The enduring impact of MCMC methods suggests that our new construction may play an equally important part in quantum computing and applications in the physical sciences and beyond. An efficient quantum thermal simulation algorithm that exhibits detailed balance, respects locality, and serves as a self-contained model for thermalization in open quantum systems.
Keywords:
Quantum thermal simulation
Detailed balance
Locality
Open quantum systems
Markov Chain Monte Carlo
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
48.5
Papers:
1.8W
Citations:
96.5W
Organization
View more organizations