Quantum Inverse Fast Fourier Transform

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Roy, Mayank, Maheswaran, Devi
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914947978493952
author Roy, Mayank
Maheswaran, Devi
author_facet Roy, Mayank
Maheswaran, Devi
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2409_07983
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Quantum Inverse Fast Fourier Transform
Roy, Mayank
Maheswaran, Devi
Quantum Physics
Signal Processing
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.
title Quantum Inverse Fast Fourier Transform
topic Quantum Physics
Signal Processing
url https://arxiv.org/abs/2409.07983