Decoherence in Search Algorithms
Quantum Physics
2012-05-18 v1 Computational Complexity
Data Structures and Algorithms
Abstract
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.
Cite
@article{arxiv.0912.1523,
title = {Decoherence in Search Algorithms},
author = {G. Abal and R. Donangelo and F. L. Marquezino and A. C. Oliveira and R. Portugal},
journal= {arXiv preprint arXiv:0912.1523},
year = {2012}
}
Comments
14 pages, presented at 36th Seminar on Software and Hardware (SEMISH), XXIX Brazilian Computer Society Congress, Bento Concalves, Brazil