pith. sign in

arxiv: quant-ph/0701150 · v3 · submitted 2007-01-21 · 🪐 quant-ph

Scattering quantum random-walk search with errors

classification 🪐 quant-ph
keywords searchefficiencylossalgorithmdirectionserrorsphaseuniform
0
0 comments X
read the original abstract

We analyze the realization of a quantum-walk search algorithm in a passive, linear optical network. The specific model enables us to consider the effect of realistic sources of noise and losses on the search efficiency. Photon loss uniform in all directions is shown to lead to the rescaling of search time. Deviation from directional uniformity leads to the enhancement of the search efficiency compared to uniform loss with the same average. In certain cases even increasing loss in some of the directions can improve search efficiency. We show that while we approach the classical limit of the general search algorithm by introducing random phase fluctuations, its utility for searching is lost. Using numerical methods, we found that for static phase errors the averaged search efficiency displays a damped oscillatory behaviour that asymptotically tends to a non-zero value.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.