{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T16:36:43Z","timestamp":1781887003002,"version":"3.54.5"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3103207","type":"journal-article","created":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T16:25:56Z","timestamp":1628526356000},"page":"111114-111124","source":"Crossref","is-referenced-by-count":12,"title":["Quantum Speedup for Index Modulation"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8978-4849","authenticated-orcid":false,"given":"Naoki","family":"Ishikawa","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/PIMRC.2008.4699782"},{"key":"ref38","first-page":"5","article-title":"Ising formulations of many NP problems","volume":"2","author":"lucas","year":"2014","journal-title":"Frontiers in Physiology"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2013.2259536"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/LWC.2021.3077311"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1587\/transcom.2020NVI0002"},{"key":"ref37","article-title":"Foundational patterns for efficient quantum computing","author":"gilliam","year":"2019","journal-title":"arXiv 1907 11513"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2018.2882385"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849710"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2017.1600125"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2961312"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2279771"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/WCL.2012.102711.110037"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.phycom.2013.08.004"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BF01886518"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365700"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"ref16","article-title":"Noise threshold of quantum supremacy","author":"fujii","year":"2016","journal-title":"arXiv 1610 03632"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.8.021054"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.100.012305"},{"key":"ref19","article-title":"A quantum algorithm for finding the minimum","author":"durr","year":"1999","journal-title":"arXiv 9607014"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.58.5355"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2018.2815642"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/0304-4149(89)90040-9"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1965.3680"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2608350"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1126\/science.aah4243"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/26.764929"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2928033"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2018.2876821"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2016.2568040"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2942915"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2007.912136"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1023\/A:1023061218864"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.22331\/q-2021-04-08-428"},{"key":"ref21","article-title":"Optimizing quantum search using a generalized version of Grover&#x2019;s algorithm","author":"gilliam","year":"2020","journal-title":"arXiv 2005 06468"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2500880"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms5213"},{"key":"ref41","article-title":"Qiskit: An open-source framework for quantum computing","author":"aleksandrowicz","year":"2019","journal-title":"Zenodo"},{"key":"ref23","article-title":"Grover adaptive search for constrained polynomial binary optimization","author":"gilliam","year":"2019","journal-title":"arXiv 1912 04088"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TQE.2021.3049230"},{"key":"ref25","article-title":"A quantum approximate optimization algorithm","author":"farhi","year":"2014","journal-title":"arXiv 1411 4028"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09509009.pdf?arnumber=9509009","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T14:57:24Z","timestamp":1639753044000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9509009\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3103207","relation":{"has-preprint":[{"id-type":"doi","id":"10.36227\/techrxiv.14561586.v2","asserted-by":"object"},{"id-type":"doi","id":"10.36227\/techrxiv.14561586.v1","asserted-by":"object"}]},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}