{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T10:36:29Z","timestamp":1730284589784,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,12]]},"DOI":"10.1109\/nabic.2010.5716272","type":"proceedings-article","created":{"date-parts":[[2011,2,18]],"date-time":"2011-02-18T14:03:54Z","timestamp":1298037834000},"page":"586-590","source":"Crossref","is-referenced-by-count":0,"title":["Discrete adiabatic quantum computation with quadric variation"],"prefix":"10.1109","author":[{"given":"M","family":"El-fiky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S","family":"Ono","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S","family":"Nakayama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1126\/science.264.5163.1297"},{"key":"ref12","article-title":"How Powerful is Adiabatic Quantum Computation","volume":"1","author":"van","year":"2002","journal-title":"quant-ph10206003"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/36\/11\/313"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.90.067903"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.57.2403"},{"journal-title":"Quantum Computation by Adiabatic Evolution","year":"0","author":"farhi","key":"ref3"},{"journal-title":"Quantum Adiabatic Evolution Algorithms with Different Paths quant-ph\/0208135","year":"2002","author":"farhi","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.65.042308"},{"key":"ref8","article-title":"Simulations of the adiabatic quantum optimization for the set partition problem","author":"smelyanskiy","year":"2002","journal-title":"Los Alamos preprint quant-ph\/0112143"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1126\/science.1057726"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"ref9","article-title":"Adiabatic Quantum Computing for Random Satisfiability Problems","author":"hogg","year":"2004","journal-title":"quant-ph10206059"}],"event":{"name":"2010 Second World Congress on Nature and Biologically Inspired Computing (NaBIC 2010)","start":{"date-parts":[[2010,12,15]]},"location":"Fukuoka","end":{"date-parts":[[2010,12,17]]}},"container-title":["2010 Second World Congress on Nature and Biologically Inspired Computing (NaBIC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5710537\/5716265\/05716272.pdf?arnumber=5716272","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T05:42:08Z","timestamp":1490074928000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5716272\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/nabic.2010.5716272","relation":{},"subject":[],"published":{"date-parts":[[2010,12]]}}}