Obtaining the quantum Fourier transform from the classical FFT with QR decomposition
From MaRDI portal
(Redirected from Publication:711225)
Abstract: We present the detailed process of converting the classical Fourier Transform algorithm into the quantum one by using QR decomposition. This provides an example of a technique for building quantum algorithms using classical ones. The Quantum Fourier Transform is one of the most important quantum subroutines known at present, used in most algorithms that have exponential speed up compared to the classical ones. We briefly review Fast Fourier Transform and then make explicit all the steps that led to the quantum formulation of the algorithm, generalizing Coppersmith's work.
Recommendations
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 236854 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Note on the Calculation of Fourier Series
- Some improvements in practical Fourier analysis and their application to X-ray scattering from liquids
Cited in
(6)- Paired quantum Fourier transform with \(\log_2N\) Hadamard gates
- scientific article; zbMATH DE number 5669860 (Why is no real title available?)
- A hybrid universal blind quantum computation
- Storing the Quantum Fourier Operator in the QuIDD Data Structure
- Quantum QR decomposition in the computational basis
- Quantum windowed Fourier transform and its application to quantum signal processing
This page was built for publication: Obtaining the quantum Fourier transform from the classical FFT with QR decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q711225)