Quantum mechanical algorithms for the nonabelian hidden subgroup problem

DOI10.1145/380752.380769zbMath1323.68286OpenAlexW2097358487MaRDI QIDQ5175954

Leonard J. Schulman, Umesh V. Vazirani, Michelangelo Grigni, Monica Vazirani

Publication date: 27 February 2015

Published in: Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Subgroup theorems; subgroup growth (20E07) Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (7)

On Solving Systems of Diagonal Polynomial Equations Over Finite Fields ⋮ The quantum query complexity of the hidden subgroup problem is polynomial ⋮ Quantum mechanics on finite groups ⋮ Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling ⋮ An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups ⋮ Solving systems of diagonal polynomial equations over finite fields ⋮ Discrete quantum walks hit exponentially faster

Cites Work

• A constant-factor approximation algorithm for the k -median problem (extended abstract)

This page was built for publication: Quantum mechanical algorithms for the nonabelian hidden subgroup problem