Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Communications in computer and information science

Representing a Quantum Fourier Transform, Based on a Discrete Model of a Quantum-Mechanical System

S.V. Shalagin

Published Jan 1, 2021• 1 citation
Publisher
DOI
10.1007/978-981-16-1483-5_2

Related papers

Compexity bound for discrete modelling of quantum Fourier transform

S.V. Shalagin

A discrete model of a quantum mechanical system with N basis states defined using 2(N-1) parameters. It is shown that the estimate of the complexity of discrete modeling quantum Fourier transform based on the presented model has O(N) order of operations on the specified parameters.

Academician O.B. Lupanov International Scientific Seminar "Discrete Mathematics and Its Applications"•Jan 1, 2022•0 citations

The Quantum Fourier Transform

Marco O. Lanzagorta, Jeffrey K. Uhlmann

Synthesis lectures on quantum computing•Jan 1, 2008•2 citations

Quantum Inverse Fast Fourier Transform

Roy, Mayank, Devi Maheswaran

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.

arXiv:2409.07983•Sep 12, 2024•0 citations

Quantum Fourier Transform

François Chapeau‐Blondeau

Springer eBooks•Jan 1, 2026•0 citations

3-Qubit Circular Quantum Convolution Computation Using the Fourier Transform with Illustrative Examples

Artyom M. Grigoryan, Sos С. Agaian

In this work, we describe a method of calculation of the 1-D circular quantum convolution of signals represented by 3-qubit superpositions in the computational basis states. The examples of the ideal low pass and high pass filters are described and quantum schemes for the 3-qubit circular convolution are presented. In the proposed method, the 3-qubit Fourier transform is used and one addition qubit, to prepare the quantum superposition for the inverse quantum Fourier transform. It is considered that the discrete Fourier transform of one of the signals is known and calculated in advance and only the quantum Fourier transform of another signal is calculated. The frequency characteristics of many linear time-invariant systems and filters are well known. Therefore, the described method of convolution can be used for these systems in quantum computation.

Journal of quantum computing•Jan 1, 2024•4 citations

Quantum Fourier Transform

Sergei Kurgalin, Sergei Borzunov

Texts in computer science•Jan 1, 2021•0 citations
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.
In this work, we describe a method of calculation of the 1-D circular quantum convolution of signals represented by 3-qubit superpositions in the computational basis states. The examples of the ideal low pass and high pass filters are described and quantum schemes for the 3-qubit circular convolution are presented. In the proposed method, the 3-qubit Fourier transform is used and one addition qubit, to prepare the quantum superposition for the inverse quantum Fourier transform. It is considered that the discrete Fourier transform of one of the signals is known and calculated in advance and only the quantum Fourier transform of another signal is calculated. The frequency characteristics of many linear time-invariant systems and filters are well known. Therefore, the described method of convolution can be used for these systems in quantum computation.