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
Your analytics export says more than you think (if you read it honestly)
0dev.to OpenSource
Tencent LoopForge: Turn Coding Agents Into Repeatable Software Delivery
0dev.to OpenSource
Your agent does not need more tools. It needs a checkpoint.
0dev.to OpenSource
NVIDIA SkillEvaluator 1.0.1: Test Agent Skills Before Shipping Them
0dev.to OpenSource
I routed Claude Code tasks to cheaper models. Here's what 15 requests saved. published: true tags: claudecode, ai, opensource, productivity
0dev.to OpenSource
Who Owns the Code AI Wrote?
0dev.to Programming