Quantum mechanical algorithms for the nonabelian hidden subgroup problem

DOI10.1145/380752.380769MaRDI QIDQ5175954zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

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

Cited in

(12)

• Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling
• Discrete quantum walks hit exponentially faster
• The quantum query complexity of the hidden subgroup problem is polynomial
• The quantum query complexity of the abelian hidden subgroup problem
• An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups
• scientific article; zbMATH DE number 5320411 (Why is no real title available?)
• Quantum mechanics on finite groups
• Quantum Algorithms for Abelian Difference Sets and Applications to Dihedral Hidden Subgroups
• On solving systems of diagonal polynomial equations over finite fields
• scientific article; zbMATH DE number 1406124 (Why is no real title available?)
• scientific article; zbMATH DE number 1304334 (Why is no real title available?)
• Solving systems of diagonal polynomial equations over finite fields

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

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