Quantum Fourier sampling simplified

DOI10.1145/301250.301336zbMath1345.68140OpenAlexW1995766457MaRDI QIDQ2819563

Sean Hallgren, Lisa Hales

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 computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (3)

Representation-theoretical properties of the approximate quantum Fourier transform ⋮ Quantum model of computations: Underlying principles and achievements ⋮ Simplified proof of the Fourier sampling theorem

This page was built for publication: Quantum Fourier sampling simplified