|
|
Decoherence in optimized quantum random-walk search algorithm |
Zhang Yu-Chao (张宇超)a b, Bao Wan-Su (鲍皖苏)a b, Wang Xiang (汪翔)a b, Fu Xiang-Qun (付向群)a b |
a Zhengzhou Information Science and Technology Institute, Zhengzhou 450004, China; b Synergetic Innovation Center of Quantum Information and Quantum Physics, University of Science and Technology of China, Hefei 230026, China |
|
|
Abstract This paper investigates the effects of decoherence generated by broken-link-type noise in the hypercube on an optimized quantum random-walk search algorithm. When the hypercube occurs with random broken links, the optimized quantum random-walk search algorithm with decoherence is depicted through defining the shift operator which includes the possibility of broken links. For a given database size, we obtain the maximum success rate of the algorithm and the required number of iterations through numerical simulations and analysis when the algorithm is in the presence of decoherence. Then the computational complexity of the algorithm with decoherence is obtained. The results show that the ultimate effect of broken-link-type decoherence on the optimized quantum random-walk search algorithm is negative.
|
Received: 06 January 2015
Revised: 11 March 2015
Accepted manuscript online:
|
PACS:
|
03.67.Lx
|
(Quantum computation architectures and implementations)
|
|
03.67.Ac
|
(Quantum algorithms, protocols, and simulations)
|
|
Fund: Project supported by the National Basic Research Program of China (Grant No. 2013CB338002). |
Corresponding Authors:
Bao Wan-Su
E-mail: 2010thzz@sina.com
|
Cite this article:
Zhang Yu-Chao (张宇超), Bao Wan-Su (鲍皖苏), Wang Xiang (汪翔), Fu Xiang-Qun (付向群) Decoherence in optimized quantum random-walk search algorithm 2015 Chin. Phys. B 24 080307
|
[1] |
Grover L 1996 Proceedings of the 28th Annual ACM Symposium on Theory of Computing (New York: ACM Press) p. 212
|
[2] |
Shor P W 1997 SIAM J. Comput. 26 1484
|
[3] |
Schoning T 1999 Foundations of Computer Science, the 40th Annual Symposium on IEEE, pp. 410–414
|
[4] |
Motwani R and Raghavan P 1996 Randomized Algorithms (Cambridge: Cambridge University Press)
|
[5] |
Kempe J 2005 Probability Theory and Related Fields 133 215
|
[6] |
Krovi H and Brun T A 2006 Phys. Rev. A 73 032341
|
[7] |
Nayak A and Vishwanath A 2000 arXiv: 0010117v1 [quant-ph]
|
[8] |
Xue P and Zhang Y S 2013 Chin. Phys. B 22 070302
|
[9] |
Qin H and Xue P 2014 Chin. Phys. B 23 010301
|
[10] |
Zhang R, Xu Y Q and Xue P 2015 Chin. Phys. B 24 010303
|
[11] |
Shenvi N, Kempe J and Whaley K B 2003 Phys. Rev. A 67 052307
|
[12] |
Potocek V, Gábris A, Kiss T and Jex I 2009 Phys. Rev. A 79 012325
|
[13] |
Li Y 2006 "Investigations on Quantum Random-Walk Search Algorithm", MS Thesis (Shanghai: East China Normal University) p. 34 (in Chinese)
|
[14] |
Zhang Y C, Bao W S, Wang X and Fu X Q 2015 Chin. Phys. B 24 060304
|
[15] |
Childs A M, Cleve R, Deotto E, Farhi E, Gutmann S and Spielman D A 2003 Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pp. 59–68
|
[16] |
Ambainis A 2007 SIAM J. Comput. 37 210
|
[17] |
Krovi H, Magniez F, Ozols M and Roland J 2010 Automata Languages and Programming (Berlin/Heidelberg: Springer) pp. 540–551
|
[18] |
Childs A and Goldstone J 2004 Phys. Rev. A 70 022314
|
[19] |
Tulsi A 2008 Phys. Rev. A 78 012310
|
[20] |
Long G L, Li Y S, Zhang W L and Tu C C 2000 Phys. Rev. A 61 042305
|
[21] |
Shenvi N, Brown K R and Whaley K B 2003 Phys. Rev. A 68 052313
|
[22] |
Li Y, Ma L and Zhou J 2006 J. Phys. A: Math. Gen. 39 9309
|
[23] |
Abal G, Donangelo R, Marquezino F L, Oliveira A C and Portugal R 2009 arXiv: 0912.1523v1 [quant-ph]
|
[24] |
Kendon V and Tregenna B 2003 Phys. Rev. A 67 042315
|
[25] |
Romanelli A, Siri R, Abal G, Auyuanet A and Donangelo R 2005 Physica A: Statistical Mechanics and Its Applications 347 137
|
[26] |
Oliveira A C, Portugal R and Donangelo R 2006 Phys. Rev. A 74 012312
|
[27] |
Alagic G and Russell A 2005 Phys. Rev. A 72 062304
|
[28] |
Marquezino F L, Portugal R, Abal G and Donangelo R 2008 Phys. Rev. A 77 042312
|
No Suggested Reading articles found! |
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
Altmetric
|
blogs
Facebook pages
Wikipedia page
Google+ users
|
Online attention
Altmetric calculates a score based on the online attention an article receives. Each coloured thread in the circle represents a different type of online attention. The number in the centre is the Altmetric score. Social media and mainstream news media are the main sources that calculate the score. Reference managers such as Mendeley are also tracked but do not contribute to the score. Older articles often score higher because they have had more time to get noticed. To account for this, Altmetric has included the context data for other articles of a similar age.
View more on Altmetrics
|
|
|