The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts

DOI10.1137/S0097539705447177zbMath1140.81334arXivquant-ph/0503095OpenAlexW1979308021MaRDI QIDQ3507527

Daniel N. Rockmore, Leonard J. Schulman, Alexander Russell, Moore, Cristopher

Publication date: 19 June 2008

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0503095

zbMATH Keywords

Fourier analysisgroup representationsquantum computationhidden subgroup problem

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Quantum computation (81P68) Numerical methods for discrete and fast Fourier transforms (65T50) Applications of group representations to physics and other areas of science (20C35)

Related Items (5)

Sample complexity of hidden subgroup problem ⋮ The independence of reduced subgroup-state ⋮ Quantum pattern matching fast on average ⋮ Quantum algorithms for algebraic problems ⋮ Deterministic algorithms for the hidden subgroup problem

This page was built for publication: The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts