research
A Dissipation Test Reached Its Optimal Time Bound
The tolerant algorithm matched a lower bound even when adaptive protocols were allowed.
Summary
The tolerant algorithm matched a lower bound even when adaptive protocols were allowed.
For a bounded time-independent Lindblad generator with local but unrestricted-overlap jump operators, the paper gives a memoryless forward-evolution test that distinguishes two dissipation thresholds. Its total evolution time matches the authors' lower bound up to constants and removes an earlier bounded-degree restriction.
Why it matters
The tolerant algorithm matched a lower bound even when adaptive protocols were allowed.
Limits and context
No additional limitation was separately recorded.
Key claims
The tolerant algorithm matched a lower bound even when adaptive protocols were allowed.
Evidence: source-2026-09-30-018
Sources
- arXiv preprint 2609.38160arXiv · primary research
Corrections
No corrections have been recorded for this story.