Polynomial-time preparation of low-temperature Gibbs states for two-dimensional toric code

We propose a polynomial-time algorithm for preparing the Gibbs state of the two-dimensional toric code Hamiltonian at any temperature, starting from any initial state, significantly improving upon prior estimates that suggested exponential scaling with inverse temperature. We prove that fast mixing at low temperature for the two-dimensional toric code can be achieved by augmenting local jump operators with simple global jump operators, which enable efficient transitions between logical sectors. To establish tight lower bounds on the spectral gap, we introduce a new reduction method that eventually maps the problem to estimating the spectral gap of a perturbed graph Laplacian on a stair graph. Our proof also shows that the Lindblad dynamics with a digitally implemented low-temperature local Davies generator is able to efficiently drive the quantum state toward the ground state manifold.

Authors

Institutions

Publication Details

Journal
Journal of Mathematical Physics
Published
2026-05-01
DOI
https://doi.org/10.1063/5.0302877
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Polynomial-time preparation of low-temperature Gibbs states for two-dimensional toric code

Ruizhe Zhang, Zhiyan Ding, Bowen Li, Lin Lin et al.
Journal of Mathematical Physics
Quantum Computing Algorithms and Architecture
article

Polynomial-time preparation of low-temperature Gibbs states for two-dimensional toric code

Ruizhe Zhang, Zhiyan Ding, Bowen Li, Lin Lin, Zeph Landau
article en

Abstract

We propose a polynomial-time algorithm for preparing the Gibbs state of the two-dimensional toric code Hamiltonian at any temperature, starting from any initial state, significantly improving upon prior estimates that suggested exponential scaling with inverse temperature. We prove that fast mixing at low temperature for the two-dimensional toric code can be achieved by augmenting local jump operators with simple global jump operators, which enable efficient transitions between logical sectors. To establish tight lower bounds on the spectral gap, we introduce a new reduction method that eventually maps the problem to estimating the spectral gap of a perturbed graph Laplacian on a stair graph. Our proof also shows that the Lindblad dynamics with a digitally implemented low-temperature local Davies generator is able to efficiently drive the quantum state toward the ground state manifold.

Journal of Mathematical PhysicsVol. 67(5)
Lawrence Berkeley National Laboratory (US), City University of Hong Kong (HK), Purdue University West Lafayette (US), University of Michigan (US), University of California, Berkeley (US)
Openalex Percentile: Top 2%
Quantum Computing Algorithms and Architecture
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.