Quantum algorithms and the Fourier transform
From MaRDI portal
Abstract: The quantum algorithms of Deutsch, Simon and Shor are described in a way which highlights their dependence on the Fourier transform. The general construction of the Fourier transform on an Abelian group is outlined and this provides a unified way of understanding the efficacy of these algorithms. Finally we describe an efficient quantum factoring algorithm based on a general formalism of Kitaev and contrast its structure to the ingredients of Shor's algorithm.
Recommendations
Cited in
(52)- Poly-locality in quantum computing
- Quantum arithmetic with the quantum Fourier transform
- Quantum image compression-encryption scheme based on quantum discrete cosine transform
- The amplified quantum Fourier transform: solving the local period problem
- Query complexity of generalized Simon's problem
- Reordering decision diagrams for quantum computing is harder than you might think
- Deterministic algorithms for the hidden subgroup problem
- De-quantisation of the quantum Fourier transform
- Vibration analysis of cyclic symmetrical systems by quantum algorithms
- The quantum query complexity of the abelian hidden subgroup problem
- Is Grover's algorithm a quantum hidden subgroup algorithm?
- Visualization of the quantum Fourier transform using a quantum computer simulator
- Approximation of a quantum algorithm for order finding
- Sample complexity of hidden subgroup problem
- Quantum algorithms for typical hard problems: a perspective of cryptanalysis
- Quantum circuit for the fast Fourier transform
- Quantum Fourier sampling simplified
- Control aspects of quantum computing using pure and mixed states
- An approach by representation of algebras for decoherence-free subspaces
- Information and computation: Classical and quantum aspects
- scientific article; zbMATH DE number 2132448 (Why is no real title available?)
- scientific article; zbMATH DE number 5669860 (Why is no real title available?)
- scientific article; zbMATH DE number 5320404 (Why is no real title available?)
- Gradient flows for optimization in quantum information and quantum dynamics: foundations and applications
- Basics for algorithms in quantum computing
- On the uselessness of quantum queries
- scientific article; zbMATH DE number 1985235 (Why is no real title available?)
- Factorization in finite quantum systems
- scientific article; zbMATH DE number 1559521 (Why is no real title available?)
- EXACT QUANTUM FOURIER TRANSFORMS AND DISCRETE LOGARITHM ALGORITHMS
- scientific article; zbMATH DE number 2086431 (Why is no real title available?)
- Quantum fast Fourier transform using multilevel atoms
- Design of quantum Fourier transforms and quantum algorithms by using circulant Hamiltonians
- scientific article; zbMATH DE number 1406111 (Why is no real title available?)
- scientific article; zbMATH DE number 7259165 (Why is no real title available?)
- Quantum image scrambling algorithm based on discrete Baker map
- Quantum cryptography: key distribution and beyond
- Discrete quantum Fourier transform using weak cross-Kerr nonlinearity and displacement operator and photon-number-resolving measurement under the decoherence effect
- Bases in diagrammatic quantum protocols
- The significance of theC-numerical range and the localC-numerical range in quantum control and quantum information
- A decomposition of quantum Fourier transformation
- Quasiclassical computation
- On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography
- EFFICIENT IMPLEMENTATIONS OF THE QUANTUM FOURIER TRANSFORM: AN EXPERIMENTAL PERSPECTIVE
- QUANTUM SOFTWARE REUSABILITY
- Quantum Fourier transform revisited.
- On quantum algorithms for noncommutative hidden subgroups
- Efficient implementation of LIMDDs for quantum circuit simulation
- A practical digital signature scheme based on the hidden logarithm problem
- Non-maximally entangled mixed states of \(X\) and non-\(X\) types as teleportation channels
- Digital signature scheme set in a hidden cyclic group
- Representation-theoretical properties of the approximate quantum Fourier transform
This page was built for publication: Quantum algorithms and the Fourier transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4223936)
