Decoherence in Search Algorithms

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

14 pages, presented at 36th Seminar on Software and Hardware (SEMISH), XXIX Brazilian Computer Society Congress, Bento Concalv

Scientific paper

Recently several quantum search algorithms based on quantum walks were proposed. Those algorithms differ from Grover's algorithm in many aspects. The goal is to find a marked vertex in a graph faster than classical algorithms. Since the implementation of those new algorithms in quantum computers or in other quantum devices is error-prone, it is important to analyze their robustness under decoherence. In this work we analyze the impact of decoherence on quantum search algorithms implemented on two-dimensional grids and on hypercubes.

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

Decoherence in Search Algorithms 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 Decoherence in Search Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decoherence in Search Algorithms will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-386125

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