EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM

DOI10.1142/S0129054103001996zbMath1101.68582arXivquant-ph/0102014OpenAlexW1967900748MaRDI QIDQ5696935

Miklos Santha, Gábor Ivanyos, Frédéric Magniez

Publication date: 19 October 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

quantum computinghidden subgroup problemBlack-box groups

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Related Items (11)

Sample complexity of hidden subgroup problem ⋮ Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling ⋮ Quantum property testing of group solvability ⋮ An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups ⋮ Unnamed Item ⋮ Is Grover's algorithm a quantum hidden subgroup algorithm? ⋮ Permutation groups, minimal degrees and quantum computing. ⋮ Graph Isomorphism is in SPP ⋮ Complexity classes of equivalence problems revisited ⋮ Quantum algorithms for algebraic problems ⋮ Quantum Algorithms for a Set of Group Theoretic Problems

Cites Work

• On the minimal degrees of projective representations of the finite Chevalley groups
• Projective Representations of Minimum Degree of Group Extensions
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• On the Power of Quantum Computation

This page was built for publication: EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM