Analysis of Absorbing Times of Quantum Walks

Authors:
  • TYTomohiro Yamasaki
    Tomohiro Yamasaki
  • HKHirotada Kobayashi
    Hirotada Kobayashi
  • HIHiroshi Imai
    Hiroshi Imai

Abstract
Quantum walks are expected to provide useful algorithmic tools for quantum computation. This paper introduces absorbing probability and time of quantum walks and gives both numerical simulation results and theoretical analyses on Hadamard walks on the line and symmetric walks on the hypercube from the viewpoint of absorbing probability and time. Our results may be suggestive in constructing efficient quantum algorithms for combinatorial problems such as SAT.