{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,13]],"date-time":"2026-10-13T05:19:06Z","timestamp":1791868746706,"version":"4.3.4"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,7,7]],"date-time":"2010-07-07T00:00:00Z","timestamp":1278460800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,7,7]]},"DOI":"10.1145\/1830483.1830746","type":"proceedings-article","created":{"date-parts":[[2010,7,11]],"date-time":"2010-07-11T22:03:17Z","timestamp":1278885797000},"page":"1433-1440","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Can quantum search accelerate evolutionary algorithms?"],"prefix":"10.1145","author":[{"given":"Daniel","family":"Johannsen","sequence":"first","affiliation":[{"name":"Max Planck Institute for Informatics, Saarbr\u00fccken, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Piyush P.","family":"Kurur","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Kanpur, Kanpur UP, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Johannes","family":"Lengler","sequence":"additional","affiliation":[{"name":"Saarland University, Saarbr\u00fccken, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,7,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704447237"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2002.1826"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502097"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796300933"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24618-3_11"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00137-8"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/646252.686013"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27836-8_42"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/050644719"},{"key":"e_1_3_2_1_12_1","volume-title":"A quantum algorithm for nding the minimum. CoRR, quant-ph\/9607014","author":"D\u00fcrr C.","year":"1996","unstructured":"C. D\u00fcrr and P. H\u00f8yer . A quantum algorithm for nding the minimum. CoRR, quant-ph\/9607014 , 1996 . C. D\u00fcrr and P. H\u00f8yer. A quantum algorithm for nding the minimum. CoRR, quant-ph\/9607014, 1996."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2002.804320"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496780"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250874"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1076315"},{"key":"e_1_3_2_1_18_1","volume-title":"Quantum Computation and Quantum Information","author":"Nielsen M. A.","year":"2000","unstructured":"M. A. Nielsen and I. L. Chuang . Quantum Computation and Quantum Information . Cambridge University Press , Cambridge, United Kingdom, 2000 . M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, Cambridge, United Kingdom, 2000."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1791834.1791839"},{"key":"e_1_3_2_1_20_1","first-page":"2239","volume-title":"Evolutionary Computation","volume":"3","author":"Spector L.","year":"1999","unstructured":"L. Spector , H. Barnum , H. Bernstein , and N. Swamy . Finding a better-than-classical quantum and\/or algorithm using genetic programming . In Evolutionary Computation , volume 3 , pages 2239 -- 2246 , 1999 . L. Spector, H. Barnum, H. Bernstein, and N. Swamy. Finding a better-than-classical quantum and\/or algorithm using genetic programming. In Evolutionary Computation, volume 3, pages 2239--2246, 1999."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.53"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.60.2746"}],"event":{"name":"GECCO '10: Genetic and Evolutionary Computation Conference","location":"Portland Oregon USA","acronym":"GECCO '10","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the 12th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1830483.1830746","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1830483.1830746","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:46Z","timestamp":1750246786000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1830483.1830746"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,7]]},"references-count":22,"alternative-id":["10.1145\/1830483.1830746","10.1145\/1830483"],"URL":"https:\/\/doi.org\/10.1145\/1830483.1830746","relation":{},"subject":[],"published":{"date-parts":[[2010,7,7]]},"assertion":[{"value":"2010-07-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}