2020/09/30 by Ji Guan, Qisheng Wang, Mingsheng Ying · 1 voice
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum-Dot Cellular Automata #quant-ph
paper · pdf · doi:10.26421/qic21.5-6-4
published as Quantum Information and Computation, 21(5-6): 395-408, 2021
openalex created_date 2020/09/14 · openalex publication_date 2021/03/22 · arxiv created 2021/03/27 · arxiv updated 2022/09/13 · openalex updated_date 2026/07/28
We present a novel application of the HHL (Harrow-Hassidim-Lloyd) algorithm -- a quantum algorithm solving systems of linear equations -- in solving an open problem about quantum random walks, namely computing hitting (or absorption) probabilities of a general (not only Hadamard) one-dimensional quantum random walks with two absorbing boundaries. This is achieved by a simple observation that the problem of computing hitting probabilities of quantum random walks can be reduced to inverting a matrix. Then a quantum algorithm with the HHL algorithm as a subroutine is developed for solving the problem, which is faster than the known classical algorithms by numerical experiments.