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

arXiv:1511.04818 · Quantum Information Processing

Quantum Fourier transform in computational basis

S. S. Zhou, T. Loke, Josh Izaac, J. B. Wang

Published Feb 10, 2017• 69 citations
arXivHTMLPDF
DOI
10.1007/s11128-017-1515-0

Related papers

The universality of the quantum Fourier transform in forming the basis of quantum computing algorithms

Charles M. Bowden, Goong Chen, Zijian Diao +1 more

arXiv:quant-ph/0007122•Journal of Mathematical Analysis and Applications•Oct 1, 2002•10 citations

Quantum Fourier Transform and Its Applications

Weng-Long Chang, Athanasios V. Vasilakos

Studies in big data•Dec 21, 2020•2 citations

Quantum Chebyshev Transform: Mapping, Embedding, Learning and Sampling Distributions

Chelsea A. Williams, Annie E. Paine, Hsin‐Yu Wu +2 more

We develop a paradigm for building quantum models in the orthonormal space of Chebyshev polynomials. We show how to encode data into quantum states with amplitudes being Chebyshev polynomials with degree growing exponentially in the system size. Similar to the quantum Fourier transform which maps computational basis space into the phase (Fourier) basis, we describe the quantum circuit for the mapping between computational and Chebyshev spaces. We propose an embedding circuit for generating the orthonormal Chebyshev basis of exponential capacity, represented by a continuously-parameterized shallow isometry. This enables automatic quantum model differentiation, and opens a route to solving stochastic differential equations. We apply the developed paradigm to generative modeling from physically- and financially-motivated distributions, and use the quantum Chebyshev transform for efficient sampling of these distributions in extended computational basis.

arXiv:2306.17026•Jun 29, 2023•1 citation

Quantum Fourier Transform

Sergei Kurgalin, Sergei Borzunov

Texts in computer science•Jan 1, 2021•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

Osama M. Raisuddin, Suvranu De

Springer eBooks•Nov 14, 2025•0 citations
We develop a paradigm for building quantum models in the orthonormal space of Chebyshev polynomials. We show how to encode data into quantum states with amplitudes being Chebyshev polynomials with degree growing exponentially in the system size. Similar to the quantum Fourier transform which maps computational basis space into the phase (Fourier) basis, we describe the quantum circuit for the mapping between computational and Chebyshev spaces. We propose an embedding circuit for generating the orthonormal Chebyshev basis of exponential capacity, represented by a continuously-parameterized shallow isometry. This enables automatic quantum model differentiation, and opens a route to solving stochastic differential equations. We apply the developed paradigm to generative modeling from physically- and financially-motivated distributions, and use the quantum Chebyshev transform for efficient sampling of these distributions in extended computational basis.
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.