Representation-theoretical properties of the approximate quantum Fourier transform

DOI10.1007/s00200-008-0072-2zbMath1149.65103OpenAlexW2155594601MaRDI QIDQ937218

Thomas Beth, Martin Roetteler

Publication date: 20 August 2008

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-008-0072-2

zbMATH Keywords

discrete Fourier transformquantum computingapproximate quantum Fourier transformbasefield transform

Mathematics Subject Classification ID

Quantum computation (81P68) Numerical methods for discrete and fast Fourier transforms (65T50) Fourier and Fourier-Stieltjes transforms on locally compact and other abelian groups (43A25)

Related Items (1)

Scheme for implementing multitarget qubit controlled-NOT gate of photons and controlled-phase gate of electron spins via quantum dot-microcavity coupled system

Cites Work

• On the computational complexity of the general discrete Fourier transform
• Zur Algebraischen Diskreten Fourier-Transformation
• Generalization of the algebraic discrete Fourier transform with application to fast convolutions
• Slim normal bases and basefield transforms
• Quantum Fourier sampling simplified
• Quantum algorithms and the Fourier transform
• Quantum algorithms revisited
• Quantum computations: algorithms and error correction
• Quantum Complexity Theory
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Representation-theoretical properties of the approximate quantum Fourier transform