{"title":"量子反快速傅里叶变换","authors":"Mayank Roy, Devi Maheswaran","doi":"arxiv-2409.07983","DOIUrl":null,"url":null,"abstract":"In this paper, an algorithm for Quantum Inverse Fast Fourier Transform\n(QIFFT) is developed to work for quantum data. Analogous to a classical\ndiscrete signal, a quantum signal can be represented in Dirac notation,\napplication of QIFFT is a tensor transformation from frequency domain to time\ndomain. If the tensors are merely complex entries, then we get the classical\nscenario. We have included the complete formulation of QIFFT algorithm from the\nclassical model and have included butterfly diagram. QIFFT outperforms regular\ninversion of Quantum Fourier Transform (QFT) in terms of computational\ncomplexity, quantum parallelism and improved versatility.","PeriodicalId":501034,"journal":{"name":"arXiv - EE - Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Quantum Inverse Fast Fourier Transform\",\"authors\":\"Mayank Roy, Devi Maheswaran\",\"doi\":\"arxiv-2409.07983\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, an algorithm for Quantum Inverse Fast Fourier Transform\\n(QIFFT) is developed to work for quantum data. Analogous to a classical\\ndiscrete signal, a quantum signal can be represented in Dirac notation,\\napplication of QIFFT is a tensor transformation from frequency domain to time\\ndomain. If the tensors are merely complex entries, then we get the classical\\nscenario. We have included the complete formulation of QIFFT algorithm from the\\nclassical model and have included butterfly diagram. QIFFT outperforms regular\\ninversion of Quantum Fourier Transform (QFT) in terms of computational\\ncomplexity, quantum parallelism and improved versatility.\",\"PeriodicalId\":501034,\"journal\":{\"name\":\"arXiv - EE - Signal Processing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - EE - Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.07983\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - EE - Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.07983","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper, an algorithm for Quantum Inverse Fast Fourier Transform
(QIFFT) is developed to work for quantum data. Analogous to a classical
discrete signal, a quantum signal can be represented in Dirac notation,
application of QIFFT is a tensor transformation from frequency domain to time
domain. If the tensors are merely complex entries, then we get the classical
scenario. We have included the complete formulation of QIFFT algorithm from the
classical model and have included butterfly diagram. QIFFT outperforms regular
inversion of Quantum Fourier Transform (QFT) in terms of computational
complexity, quantum parallelism and improved versatility.