Quantum Fourier transform in computational basis
From MaRDI portal
Publication:2412616
DOI10.1007/s11128-017-1515-0zbMath1373.81161arXiv1511.04818OpenAlexW3101872593MaRDI QIDQ2412616
Publication date: 23 October 2017
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.04818
Quantum computation (81P68) Numerical methods for discrete and fast Fourier transforms (65T50) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (11)
Implementing quantum Fourier transform using three qubits ⋮ Quantum algorithms for anomaly detection using amplitude estimation ⋮ Quantum-based feature selection for multiclassification problem in complex systems with edge computing ⋮ Quantum discriminative canonical correlation analysis ⋮ Quantum algorithms for typical hard problems: a perspective of cryptanalysis ⋮ Quantum QR decomposition in the computational basis ⋮ Quantum circuit for the fast Fourier transform ⋮ Quantum kernel logistic regression based Newton method ⋮ Quantum algorithm for unsupervised anomaly detection ⋮ Quantum dimensionality reduction by linear discriminant analysis ⋮ Quantum mean centering for block-encoding-based quantum algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum arithmetic with the quantum Fourier transform
- A quantum multiply-accumulator
- Quantum Computation and Quantum Information
- Quantum Random Access Memory
- Quantum Algorithms for Some Hidden Shift Problems
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Roundoff Error Analysis of the Fast Fourier Transform
- Worst and average case roundoff error analysis for FFT
This page was built for publication: Quantum Fourier transform in computational basis
