Quantum Hitting Time on the Complete Graph

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

14 pages, 2 figures

Scientific paper

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. Using Szegedy's definition of quantum hitting time, which is a natural extension of the definition of the classical hitting time, we present analytical expressions for the hitting time and success probability of the quantum walk on the complete graph.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Quantum Hitting Time on the Complete Graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum Hitting Time on the Complete Graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Hitting Time on the Complete Graph will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-243216

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.