Quantum Fourier transform in computational basis
From MaRDI portal
Abstract: The conventional Quantum Fourier Transform, with exponential speedup compared to the classical Fast Fourier Transform, has played an important role in quantum computation as a vital part of many quantum algorithms (most prominently, the Shor's factoring algorithm). However, situations arise where it is not sufficient to encode the Fourier coefficients within the quantum amplitudes, for example in the implementation of control operations that depend on Fourier coefficients. In this paper, we detail a new quantum algorithm to encode the Fourier coefficients in the computational basis, with success probability and desired precision . Its time complexity % depends polynomially on , where is the problem size, and linearly on and . We also discuss an application of potential practical importance, namely the simulation of circulant Hamiltonians.
Recommendations
Cites work
- scientific article; zbMATH DE number 2103524 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- A logarithmic-depth quantum carry-lookahead adder
- A quantum multiply-accumulator
- Limitations on the simulation of non-sparse Hamiltonians
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Algorithms for Some Hidden Shift Problems
- Quantum arithmetic with the quantum Fourier transform
- Quantum computation and quantum information. 10th anniversary edition
- Quantum random access memory
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Roundoff Error Analysis of the Fast Fourier Transform
- Worst and average case roundoff error analysis for FFT
Cited in
(29)- Quantum mean centering for block-encoding-based quantum algorithm
- Simple scheme for realizing the general conditional phase shift gate and a simulation of quantum Fourier transform in circuit QED
- Quantum algorithm for unsupervised anomaly detection
- Quantum windowed Fourier transform and its application to quantum signal processing
- Storing the Quantum Fourier Operator in the QuIDD Data Structure
- Quantum discriminative canonical correlation analysis
- Quantum Fourier analysis
- scientific article; zbMATH DE number 5320404 (Why is no real title available?)
- Quantum algorithms for typical hard problems: a perspective of cryptanalysis
- Quantum dimensionality reduction by linear discriminant analysis
- Quantum QR decomposition in the computational basis
- Quantum algorithms for anomaly detection using amplitude estimation
- Visualization of the quantum Fourier transform using a quantum computer simulator
- EXACT QUANTUM FOURIER TRANSFORMS AND DISCRETE LOGARITHM ALGORITHMS
- STABILITY OF THE QUANTUM FOURIER TRANSFORMATION ON THE ISING QUANTUM COMPUTER
- scientific article; zbMATH DE number 5669860 (Why is no real title available?)
- Quantum arithmetic with the quantum Fourier transform
- Quantum kernel logistic regression based Newton method
- EFFICIENT IMPLEMENTATIONS OF THE QUANTUM FOURIER TRANSFORM: AN EXPERIMENTAL PERSPECTIVE
- Integer numeric multiplication using quantum Fourier transform
- Design of quantum Fourier transforms and quantum algorithms by using circulant Hamiltonians
- Quantum circuit for the fast Fourier transform
- Quantum fast Fourier transform using multilevel atoms
- Implementing quantum Fourier transform using three qubits
- Quantum generalized least squares method in system identification
- Coping with decoherence: parallelizing the quantum Fourier transform
- Quantum-based feature selection for multiclassification problem in complex systems with edge computing
- A quantum convolution and neighborhood pixel extraction scheme based on NEQR
- Structural stability of the quantum Fourier transform
This page was built for publication: Quantum Fourier transform in computational basis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2412616)
