{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:20:04Z","timestamp":1760170804033},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,4,20]],"date-time":"2013-04-20T00:00:00Z","timestamp":1366416000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1007\/s00453-013-9784-1","type":"journal-article","created":{"date-parts":[[2013,4,19]],"date-time":"2013-04-19T15:57:46Z","timestamp":1366387066000},"page":"152-189","source":"Crossref","is-referenced-by-count":2,"title":["Evolutionary Algorithms for Quantum Computers"],"prefix":"10.1007","volume":"68","author":[{"given":"Daniel","family":"Johannsen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piyush P.","family":"Kurur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"Lengler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,4,20]]},"reference":[{"issue":"4","key":"9784_CR1","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1137\/S0097539704447237","volume":"35","author":"S. Aaronson","year":"2006","unstructured":"Aaronson, S.: Lower bounds for local search by quantum arguments. SIAM J. Comput. 35(4), 804\u2013824 (2006)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9784_CR2","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1006\/jcss.2002.1826","volume":"64","author":"A. Ambainis","year":"2002","unstructured":"Ambainis, A.: Quantum lower bounds by quantum arguments. J. Comput. Syst. Sci. 64(4), 750\u2013767 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"9784_CR3","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-540-77566-9_1","volume-title":"SOFSEM \u201908: Proceedings of the 34th Conference on Current Trends in Theory and Practice of Computer Science","author":"A. Ambainis","year":"2008","unstructured":"Ambainis, A.: Quantum random walks\u2014new method for designing quantum algorithms. In: SOFSEM \u201908: Proceedings of the 34th Conference on Current Trends in Theory and Practice of Computer Science. LNCS, vol. 4910, pp. 1\u20134. Springer, Berlin (2008)"},{"key":"9784_CR4","series-title":"Series on Theoretical Computer Science","volume-title":"Theory of Randomized Search Heuristics","year":"2011","unstructured":"Auger, A., Doerr, B. (eds.): Theory of Randomized Search Heuristics. Series on Theoretical Computer Science, vol. 1. World Scientific, Singapore (2011)"},{"issue":"4","key":"9784_CR5","doi-asserted-by":"crossref","first-page":"778","DOI":"10.1145\/502090.502097","volume":"48","author":"R. Beals","year":"2001","unstructured":"Beals, R., Buhrman, H., Cleve, R., Mosca, M., de Wolf, R.: Quantum lower bounds by polynomials. J. ACM 48(4), 778\u2013797 (2001)","journal-title":"J. ACM"},{"issue":"5","key":"9784_CR6","doi-asserted-by":"crossref","first-page":"1510","DOI":"10.1137\/S0097539796300933","volume":"26","author":"C.H. Bennett","year":"1997","unstructured":"Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computing. SIAM J. Comput. 26(5), 1510\u20131523 (1997)","journal-title":"SIAM J. Comput."},{"key":"9784_CR7","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/978-3-540-24618-3_11","volume-title":"SOFSEM \u201904: Proceedings of the 30th Conference on Current Trends in Theory and Practice of Computer Science","author":"A. Berzina","year":"2004","unstructured":"Berzina, A., Dubrovsky, A., Freivalds, R., Lace, L., Scegulnaja, O.: Quantum query complexity for some graph problems. In: SOFSEM \u201904: Proceedings of the 30th Conference on Current Trends in Theory and Practice of Computer Science. LNCS, vol. 2932, pp. 140\u2013150. Springer, Berlin (2004)"},{"issue":"1","key":"9784_CR8","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0304-3975(02)00137-8","volume":"287","author":"H.-G. Beyer","year":"2002","unstructured":"Beyer, H.-G., Schwefel, H.-P., Wegener, I.: How to analyse evolutionary algorithms. Theor. Comput. Sci. 287(1), 101\u2013130 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"4\u20135","key":"9784_CR9","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P","volume":"46","author":"M. Boyer","year":"1998","unstructured":"Boyer, M., Brassard, G., H\u00f8yer, P., Tapp, A.: Tight bounds on quantum searching. Fortschr. Phys. 46(4\u20135), 493\u2013505 (1998)","journal-title":"Fortschr. Phys."},{"key":"9784_CR10","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1007\/BFb0055105","volume-title":"ICALP \u201998: Proceedings of the 25th International Colloquium on Automata, Languages and Programming","author":"G. Brassard","year":"1998","unstructured":"Brassard, G., H\u00f8yer, P., Tapp, A.: Quantum counting. In: ICALP \u201998: Proceedings of the 25th International Colloquium on Automata, Languages and Programming. LNCS, vol. 1443, pp. 820\u2013831. Springer, Berlin (1998)"},{"issue":"1\u20132","key":"9784_CR11","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0304-3975(01)00182-7","volume":"276","author":"S. Droste","year":"2002","unstructured":"Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithm. Theor. Comput. Sci. 276(1\u20132), 51\u201381 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"9784_CR12","unstructured":"D\u00fcrr, C., H\u00f8yer, P.: A quantum algorithm for finding the minimum (1996). arXiv:quant-ph\/9607014v2"},{"issue":"6","key":"9784_CR13","doi-asserted-by":"crossref","first-page":"1310","DOI":"10.1137\/050644719","volume":"35","author":"C. D\u00fcrr","year":"2006","unstructured":"D\u00fcrr, C., Heiligman, M., H\u00f8yer, P., Mhalla, M.: Quantum query complexity of some graph problems. SIAM J. Comput. 35(6), 1310\u20131328 (2006)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9784_CR14","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1162\/evco.1999.7.2.173","volume":"7","author":"J. Garnier","year":"1999","unstructured":"Garnier, J., Kallel, L., Schoenauer, M.: Rigorous hitting times for binary mutations. Evol. Comput. 7(2), 173\u2013203 (1999)","journal-title":"Evol. Comput."},{"key":"9784_CR15","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1145\/237814.237866","volume-title":"STOC \u201996: Proceedings of the 28th Annual ACM Symposium on Theory of Computing","author":"L.K. Grover","year":"1996","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: STOC \u201996: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pp. 212\u2013219. ACM, New York (1996)"},{"issue":"6","key":"9784_CR16","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1109\/TEVC.2002.804320","volume":"6","author":"K.-H. Han","year":"2002","unstructured":"Han, K.-H., Kim, J.-H.: Quantum-inspired evolutionary algorithm for a class of combinatorial optimization. IEEE Trans. Evol. Comput. 6(6), 580\u2013593 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"9784_CR17","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1023\/B:NACO.0000023417.31393.c7","volume":"3","author":"J. He","year":"2004","unstructured":"He, J., Yao, X.: A study of drift analysis for estimating computation time of evolutionary algorithms. Nat. Comput. 3(1), 21\u201335 (2004)","journal-title":"Nat. Comput."},{"key":"9784_CR18","doi-asserted-by":"crossref","first-page":"1433","DOI":"10.1145\/1830483.1830746","volume-title":"GECCO \u201910: Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference","author":"D. Johannsen","year":"2010","unstructured":"Johannsen, D., Kurur, P.P., Lengler, J.: Can quantum search accelerate evolutionary algorithms? In: GECCO \u201910: Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, pp. 1433\u20131440. ACM, New York (2010)"},{"issue":"3","key":"9784_CR19","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.jcss.2004.04.007","volume":"69","author":"I. Kerenidis","year":"2004","unstructured":"Kerenidis, I., de Wolf, R.: Exponential lower bound for 2-query locally decodable codes via a quantum argument. J. Comput. Syst. Sci. 69(3), 395\u2013420 (2004)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"9784_CR20","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1137\/090745854","volume":"40","author":"F. Magniez","year":"2011","unstructured":"Magniez, F., Nayak, A., Roland, J., Santha, M.: Search via quantum walk. SIAM J. Comput. 40(1), 142\u2013164 (2011)","journal-title":"SIAM J. Comput."},{"issue":"1\u20132","key":"9784_CR21","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s00453-011-9521-6","volume":"63","author":"F. Magniez","year":"2012","unstructured":"Magniez, F., Nayak, A., Richter, P.C., Santha, M.: On the hitting times of quantum versus random walks. Algorithmica 63(1\u20132), 91\u2013116 (2012)","journal-title":"Algorithmica"},{"key":"9784_CR22","volume-title":"Quantum Computation and Quantum Information","author":"M.A. Nielsen","year":"2000","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"key":"9784_CR23","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/978-3-540-79228-4_3","volume-title":"TAMC \u201908: Proceedings of the 5th Annual Conference on Theory and Applications of Models of Computation","author":"M. Santha","year":"2008","unstructured":"Santha, M.: Quantum walk based search algorithms. In: TAMC \u201908: Proceedings of the 5th Annual Conference on Theory and Applications of Models of Computation. LNCS, vol. 4978, pp. 31\u201346. Springer, Berlin (2008)"},{"key":"9784_CR24","first-page":"2239","volume-title":"CEC \u201999: Proceedings of the 1999 IEEE Congress on Evolutionary Computation","author":"L. Spector","year":"1999","unstructured":"Spector, L., Barnum, H., Bernstein, H.J., Swamy, N.: Finding a better-than-classical quantum AND\/OR algorithm using genetic programming. In: CEC \u201999: Proceedings of the 1999 IEEE Congress on Evolutionary Computation, vol. 3, pp. 2239\u20132246. IEEE, New York (1999)"},{"key":"9784_CR25","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/FOCS.2004.53","volume-title":"FOCS \u201904: Proceedings of the 45th Annual IEEE Syposium on Foundations of Computer Science","author":"M. Szegedy","year":"2004","unstructured":"Szegedy, M.: Quantum speed-up of Markov chain based algorithms. In: FOCS \u201904: Proceedings of the 45th Annual IEEE Syposium on Foundations of Computer Science, pp. 32\u201341. IEEE, New York (2004)"},{"issue":"4","key":"9784_CR26","first-page":"2746","volume":"60","author":"C. Zalka","year":"1999","unstructured":"Zalka, C.: Grover\u2019s quantum searching algorithm is optimal. Phys. Rev. Lett. 60(4), 2746\u20132751 (1999)","journal-title":"Phys. Rev. Lett."},{"key":"9784_CR27","unstructured":"Zhang, S.: New quantum algorithms and quantum lower bounds. PhD thesis (2006)"},{"key":"9784_CR28","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/1132516.1132605","volume-title":"STOC \u201906: Proceedings of the 38th Annual ACM Symposium on Theory of Computing","author":"S. Zhang","year":"2006","unstructured":"Zhang, S.: New upper and lower bounds for randomized and quantum local search. In: STOC \u201906: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pp. 634\u2013643. ACM, New York (2006)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9784-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-013-9784-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9784-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T21:19:21Z","timestamp":1562966361000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-013-9784-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,20]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["9784"],"URL":"https:\/\/doi.org\/10.1007\/s00453-013-9784-1","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,20]]}}}