Please use this identifier to cite or link to this item:
Title: Searching a database under decoherence
Authors: Chen, J. 
Kaszlikowski, D. 
Kwek, L.C. 
Oh, C.H. 
Issue Date: 13-Jan-2003
Citation: Chen, J., Kaszlikowski, D., Kwek, L.C., Oh, C.H. (2003-01-13). Searching a database under decoherence. Physics Letters, Section A: General, Atomic and Solid State Physics 306 (5-6) : 296-305. ScholarBank@NUS Repository.
Abstract: We report 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. © 2002 Elsevier Science B.V. All rights reserved.
Source Title: Physics Letters, Section A: General, Atomic and Solid State Physics
ISSN: 03759601
DOI: 10.1016/S0375-9601(02)01637-7
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Jul 6, 2020


checked on Jul 6, 2020

Page view(s)

checked on Jun 27, 2020

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.