On Quantum Algorithms for Efficient Solutions of General Classes of Structured Markov Processes
<|reference_start|>On Quantum Algorithms for Efficient Solutions of General Classes of Structured Markov Processes: We study the fundamental problem of efficiently computing the stationary distribution of general classes of structured Markov processes. In strong contrast with previous work, we consider this problem within the context of quantum computational environments from a mathematical perspective and devise the first quantum algorithms for computing the stationary distribution of structured Markov processes. We derive a mathematical analysis of the computational properties of our quantum algorithms together with related theoretical results, establishing that our quantum algorithms provide the potential for significant computational improvements over that of the best-known classical algorithms in various settings of both theoretical and practical importance. Although motivated by structured Markov processes, our quantum algorithms have the potential for being exploited to address a much larger class of numerical computation problems.<|reference_end|>
@article{kalantzis2024on,
    title={On Quantum Algorithms for Efficient Solutions of General Classes of
  Structured Markov Processes},
    author={Vasileios Kalantzis, Mark S. Squillante, Shashanka Ubaru},
    journal={arXiv preprint arXiv:2404.17959},
    year={2024},
    archivePrefix={arXiv},
    eprint={2404.17959},
    primaryClass={quant-ph cs.NA math.NA math.PR}
}