Quantum Hitting Time on the Complete Graph

Understand

Quantum walks play an important role in the area of quantum algorithms.

• Many interesting problems can be reduced to searching marked states in a quantum Markov chain.
• In this context, the notion of quantum hitting time is very important, because it quantifies the running time of the algorithms.
• Markov chain-based algorithms are probabilistic, therefore the calculation of the success probability is also required in the analysis of the computational complexity.