{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T19:21:10Z","timestamp":1694632870834},"reference-count":20,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2008,6,12]],"date-time":"2008-06-12T00:00:00Z","timestamp":1213228800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AIEDAM"],"published-print":{"date-parts":[[2008,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have been developed so far. Designing such algorithms is complicated by the rather nonintuitive character of quantum physics. In this paper we present a genetic programming system that uses some new techniques to develop and improve quantum algorithms. We have used this system to develop two formerly unknown quantum algorithms. We also address a potential deficiency of the quantum decision tree model used to prove lower bounds on the query complexity of the parity problem.<\/jats:p>","DOI":"10.1017\/s089006040800019x","type":"journal-article","created":{"date-parts":[[2008,6,12]],"date-time":"2008-06-12T13:19:47Z","timestamp":1213276787000},"page":"285-297","source":"Crossref","is-referenced-by-count":7,"title":["Evolving blackbox quantum algorithms using genetic programming"],"prefix":"10.1017","volume":"22","author":[{"given":"Ralf","family":"Stadelhofer","sequence":"first","affiliation":[]},{"given":"Wolfgang","family":"Banzhaf","sequence":"additional","affiliation":[]},{"given":"Dieter","family":"Suter","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2008,6,12]]},"reference":[{"key":"S089006040800019X_ref20","first-page":"113","article-title":"Automated design of quantum circuits","author":"Williams","year":"1998","journal-title":"Proc. First NASA Int. Conf. Quantum Computing and Quantum Communications (QCQC)"},{"key":"S089006040800019X_ref16","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365701"},{"key":"S089006040800019X_ref15","first-page":"124","article-title":"Algorithms for quantum computation: discrete logarithm and factoring","author":"Shor","year":"1994","journal-title":"IEEE Symp. Foundations of Computer Science"},{"key":"S089006040800019X_ref14","doi-asserted-by":"publisher","DOI":"10.1145\/367701.367709"},{"key":"S089006040800019X_ref12","article-title":"Evolving quantum circuits and programs through genetic programming","author":"Massey","year":"2004","journal-title":"Proc. Genetic and Evolutionary Computation Conf."},{"key":"S089006040800019X_ref11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.61.010301"},{"key":"S089006040800019X_ref8","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.81.5442"},{"key":"S089006040800019X_ref7","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.1992.0167"},{"key":"S089006040800019X_ref6","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.58.R1633"},{"key":"S089006040800019X_ref1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502097"},{"key":"S089006040800019X_ref13","volume-title":"Quantum Computation and Quantum Information","author":"Nielsen","year":"2000"},{"key":"S089006040800019X_ref17","volume-title":"Automatic Quantum Computer Programming: A Genetic Programming Approach","author":"Spector","year":"2004"},{"key":"S089006040800019X_ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2003.1299571"},{"key":"S089006040800019X_ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISTCS.1997.595153"},{"key":"S089006040800019X_ref19","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.71.032345"},{"key":"S089006040800019X_ref2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796300933"},{"key":"S089006040800019X_ref10","first-page":"390","article-title":"Evolving Hogg's quantum algorithm using linear-tree GP","author":"Leier","year":"2003","journal-title":"Proc. Genetic and Evolutionary Computation Conf."},{"key":"S089006040800019X_ref3","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796300921"},{"key":"S089006040800019X_ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00144-X"},{"key":"S089006040800019X_ref18","doi-asserted-by":"crossref","first-page":"135","DOI":"10.7551\/mitpress\/1110.001.0001","volume-title":"Advances in Genetic Programming","volume":"3","author":"Spector","year":"1999"}],"container-title":["Artificial Intelligence for Engineering Design, Analysis and Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S089006040800019X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,12]],"date-time":"2021-09-12T02:46:29Z","timestamp":1631414789000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S089006040800019X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,12]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["S089006040800019X"],"URL":"https:\/\/doi.org\/10.1017\/s089006040800019x","relation":{},"ISSN":["0890-0604","1469-1760"],"issn-type":[{"value":"0890-0604","type":"print"},{"value":"1469-1760","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,6,12]]}}}