Searching a database under decoherence
From MaRDI portal
Publication:1854573
DOI10.1016/S0375-9601(02)01637-7zbMATH Open1006.81007arXivquant-ph/0102033OpenAlexW2006145363MaRDI QIDQ1854573FDOQ1854573
Authors: Dagomir Kaszlikowski, C. H. Oh, Jing-Ling Chen, L. C. Kwek
Publication date: 14 January 2003
Published in: Physics Letters. A (Search for Journal in Brave)
Abstract: We report on the effects of a simple decoherence model on the quantum search algorithm. Despite its simplicity, the decoherence model is an instructive model that can genuinely imitate realistic noisy environment in many situations. As one would expect, as the size of the database gets larger, the effects of decoherence on the efficiency of the quantum search algorithm cannot be ignored. Moreover, with decoherence, it may not be useful to iterate beyond the first maxima in the probability distribution of the search entry. Surprisingly, we also find that the number of iterations for maximum probability of the search entry reduces with decoherence.
Full work available at URL: https://arxiv.org/abs/quant-ph/0102033
Recommendations
Cites Work
Cited In (5)
- Analyzing the reliability of quantum amplitude amplification techniques in the presence of noise
- Noise effects in the quantum search algorithm from the viewpoint of computational complexity
- Characterizing error propagation in quantum circuits: the isotropic index
- Quantum database search with certainty by a single query
- Decoherence in Grover search algorithm
This page was built for publication: Searching a database under decoherence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854573)