{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T20:47:50Z","timestamp":1757450870545,"version":"3.37.3"},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,10,21]],"date-time":"2020-10-21T00:00:00Z","timestamp":1603238400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,10,21]],"date-time":"2020-10-21T00:00:00Z","timestamp":1603238400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,10,21]],"date-time":"2020-10-21T00:00:00Z","timestamp":1603238400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003708","name":"Korea Institute of Science and Technology Information","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003708","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,10,21]]},"DOI":"10.1109\/ictc49870.2020.9289455","type":"proceedings-article","created":{"date-parts":[[2020,12,21]],"date-time":"2020-12-21T22:58:16Z","timestamp":1608591496000},"page":"214-219","source":"Crossref","is-referenced-by-count":4,"title":["Quantum Minimum Searching Algorithm and Circuit Implementation"],"prefix":"10.1109","author":[{"given":"Yujin","family":"Kang","sequence":"first","affiliation":[]},{"given":"Jun","family":"Heo","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","article-title":"Tight bounds on quantum searching","author":"boyer","year":"1996","journal-title":"PhysComp96"},{"year":"1996","author":"d\u00fcrr","article-title":"A quantum algorithm for finding the minimum","key":"ref3"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1103\/PhysRevLett.100.160501"},{"key":"ref6","doi-asserted-by":"crossref","DOI":"10.26421\/QIC17.7-8-7","article-title":"Factoring using 2n+2 qubits with toffoli based modular multiplication","author":"haner","year":"2017"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1145\/237814.237866"},{"year":"2019","author":"chen","article-title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuit","key":"ref8"},{"key":"ref7","article-title":"Quantum Approaches to Logic Circuit Synthesis and Testing","author":"hayes","year":"2006","journal-title":"AFRL-IF-RS-TR-2006-216"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1017\/CBO9780511976667"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1142\/S021974990800361X","article-title":"A New Quantum Algorithm for Solving the Minimum Searching Problem","volume":"6","author":"antonio","year":"2008","journal-title":"International Journal of Quantum Information"},{"year":"2014","author":"wittek","article-title":"Quantum Machine Learning","key":"ref1"}],"event":{"name":"2020 International Conference on Information and Communication Technology Convergence (ICTC)","start":{"date-parts":[[2020,10,21]]},"location":"Jeju Island, Korea (South)","end":{"date-parts":[[2020,10,23]]}},"container-title":["2020 International Conference on Information and Communication Technology Convergence (ICTC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9289075\/9289076\/09289455.pdf?arnumber=9289455","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T00:24:47Z","timestamp":1656375887000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9289455\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,21]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/ictc49870.2020.9289455","relation":{},"subject":[],"published":{"date-parts":[[2020,10,21]]}}}