Backend
Quantum Gibbs sampling through the detectability lemma
arXiv cs.NA0 views
arXiv:2604.07214v2 Announce Type: replace-cross Abstract: Gibbs state preparation is an important subroutine in quantum computing. In this work we use the detectability lemma to improve Gibbs state preparation. Specifically, we design new Gibbs state preparation methods that do not rely on simulating Lindbladian evolution, thus avoiding the overhead from it. For local Lindbladians consisting of $M$ terms, this approach reduces the cost by a factor of $O(M)$. We also combine the detectability lemma operator and quantum singular value transformation to implement ground state projection operators of frustration-free Hamiltonians, resulting in a quadratic speedup in the spectral gap dependence. Applying this method to Lindbladians for the Gibbs state of local commuting Hamiltonians, we achieve quadratically better dependence on the Lindbladian spectral gap.
Source:https://arxiv.org/abs/2604.07214PreviousMemorization capacity of deep ReLU neural networks characterized by width and depthNextOn the sharp linear convergence rate of the circumcentered--reflection method on subspaces
Related posts
Where Is the Cost of Third-Party API Routers in Agentic Software Development?
0arXiv cs.SE
RyBench: Runtime Verification Benchmarking Framework over Publish/Subscribe Networks
0arXiv cs.SE
When the World Is the Test Suite: Agentic Intelligence for the Physical World
0arXiv cs.SE
Direct Numerical Simulation of Thermoacoustically Unstable Flames Via Non-Drifting Acoustic Delay Characteristic Boundary Conditions
0arXiv cs.NA
On the sharp linear convergence rate of the circumcentered--reflection method on subspaces
0arXiv cs.NA
RustMC: Automated Verification of Real-World Concurrent Rust
0arXiv cs.CR