{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T08:45:44Z","timestamp":1782204344581,"version":"3.54.5"},"reference-count":12,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput. Sci. Eng."],"published-print":{"date-parts":[[2020,11,1]]},"DOI":"10.1109\/mcse.2020.3023979","type":"journal-article","created":{"date-parts":[[2020,9,15]],"date-time":"2020-09-15T20:42:47Z","timestamp":1600202567000},"page":"103-110","source":"Crossref","is-referenced-by-count":20,"title":["A Comparison of Quantum and Traditional Fourier Transform Computations"],"prefix":"10.1109","volume":"22","author":[{"given":"D. R.","family":"Musk","sequence":"first","affiliation":[{"name":"Pioneer Academics"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"crossref","first-page":"1034","DOI":"10.1103\/PhysRevA.54.1034","article-title":"Efficient networks for quantum factoring","volume":"54","author":"beckman","year":"1996","journal-title":"Phys Rev"},{"key":"ref3","first-page":"124","article-title":"Algorithms for quantum computation: Discrete logarithms and factoring","author":"shor","year":"0","journal-title":"Proc 35th Annu Symp Found Comput Sci"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cpc.2008.03.007"},{"key":"ref6","article-title":"The computational complexity of the fast Fourier transform","author":"lohne","year":"2017"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.80.4329"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/j.ins.2014.08.022","article-title":"Fast Fourier transform using matrix decomposition","volume":"291","author":"zhou","year":"1992","journal-title":"Inf Sci"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.22541\/au.159795474.47457948"},{"key":"ref8","first-page":"39","article-title":"Quantum Fourier transform circuit simulator","author":"tellez","year":"0","journal-title":"Proc"},{"key":"ref7","article-title":"Cooley–Tukey FFT algorithms","author":"bekele","year":"2006"},{"key":"ref2","first-page":"1473","article-title":"A tale of two sieves","volume":"43","author":"pomerance","year":"1996","journal-title":"Notices Amer Math Soc"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"1000","DOI":"10.1109\/TCAD.2005.855930","article-title":"Synthesis of quantum logic circuits","volume":"25","author":"shende","year":"2006","journal-title":"IEEE Trans Comput -Aided Des"},{"key":"ref1","author":"born","year":"1954","journal-title":"The Interpretation of Quantum Mechanics"}],"container-title":["Computing in Science & Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5992\/9222575\/09198106.pdf?arnumber=9198106","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T20:30:56Z","timestamp":1652992256000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9198106\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,1]]},"references-count":12,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/mcse.2020.3023979","relation":{},"ISSN":["1521-9615","1558-366X"],"issn-type":[{"value":"1521-9615","type":"print"},{"value":"1558-366X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,1]]}}}