Faster quantum mixing for slowly evolving sequences of Markov chains
Markov chain methods are remarkably successful in computational physics, machine learning, and combinatorial optimization. The cost of such methods often reduces to the mixing time, i.e., the time required to reach the steady state of the Markov chain, which scales as $δ^{-1}$, the inverse of the sp...
محفوظ في:
| المؤلفون الرئيسيون: | , , |
|---|---|
| التنسيق: | Artigo |
| اللغة: | Inglês |
| منشور في: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2018-11-01
|
| سلاسل: | Quantum |
| الوصول للمادة أونلاين: | https://quantum-journal.org/papers/q-2018-11-09-105/pdf/ |
| الوسوم: |
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|