Quantum Fourier sampling simplified

DOI10.1145/301250.301336MaRDI QIDQ2819563zbMATH OpenOpenAlexFDO

Authors Lisa Hales, Sean Hallgren

Publication date 29 September 2016

Published in Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/301250.301336

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Recommendations

• Quantum algorithms and the Fourier transform
• scientific article; zbMATH DE number 2086431
• scientific article; zbMATH DE number 1559521
• Simplified proof of the Fourier sampling theorem

Cited in

(8)

• Quantum model of computations: Underlying principles and achievements
• Simplified proof of the Fourier sampling theorem
• The amplified quantum Fourier transform: solving the local period problem
• De-quantisation of the quantum Fourier transform
• Approximation of a quantum algorithm for order finding
• Quantum algorithms and the Fourier transform
• scientific article; zbMATH DE number 2086431 (Why is no real title available?)
• Representation-theoretical properties of the approximate quantum Fourier transform

This page was built for publication: Quantum Fourier sampling simplified

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2819563)