Extreme Quantum Advantage for Rare-Event Sampling
Quantum Physics
2018-02-21 v1 Statistical Mechanics
Computational Complexity
Information Theory
math.IT
Abstract
We introduce a quantum algorithm for efficient biased sampling of the rare events generated by classical memoryful stochastic processes. We show that this quantum algorithm gives an extreme advantage over known classical biased sampling algorithms in terms of the memory resources required. The quantum memory advantage ranges from polynomial to exponential and when sampling the rare equilibrium configurations of spin systems the quantum advantage diverges.
Cite
@article{arxiv.1707.09553,
title = {Extreme Quantum Advantage for Rare-Event Sampling},
author = {C. Aghamohammadi and S. P. Loomis and J. R. Mahoney and J. P. Crutchfield},
journal= {arXiv preprint arXiv:1707.09553},
year = {2018}
}
Comments
11 pages, 9 figures; http://csc.ucdavis.edu/~cmg/compmech/pubs/eqafbs.htm