Detectability lemma enables Gibbs sampling without Lindbladian simulation, yielding O(M) cost reduction for M-term local Lindbladians and quadratic speedup in spectral gap for frustration-free and commuting cases.
A randomized method for simulating Lindblad equations and thermal state preparation
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
fields
quant-ph 3roles
method 1polarities
use method 1representative citing papers
Quantum trajectory algorithm achieves additive O(T + log(1/ε)) query complexity for simulating dissipative Lindbladians.
Introduces local-circuit approximations to quasilocal dissipative processes for efficient, provably convergent quantum Gibbs sampling at high temperatures.
citing papers explorer
-
Quantum Gibbs sampling through the detectability lemma
Detectability lemma enables Gibbs sampling without Lindbladian simulation, yielding O(M) cost reduction for M-term local Lindbladians and quadratic speedup in spectral gap for frustration-free and commuting cases.
-
Quantum algorithms based on quantum trajectories
Quantum trajectory algorithm achieves additive O(T + log(1/ε)) query complexity for simulating dissipative Lindbladians.
-
Efficient Quantum Gibbs Sampling with Local Circuits
Introduces local-circuit approximations to quasilocal dissipative processes for efficient, provably convergent quantum Gibbs sampling at high temperatures.