Efficient quantum algorithms for the hidden subgroup problem over semi-direct product groups

zbMATH Open1152.81739arXivquant-ph/0412033MaRDI QIDQ3522641FDOQ3522641

François Le Gall, Yoshifumi Inui

Publication date: 3 September 2008

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

Recommendations

• Hidden subgroup quantum algorithms for a class of semi-direct product groups
• Quantum algorithms for the hidden subgroup problem on some semi-direct product groups by reduction to abelian cases
• Solutions to the hidden subgroup problem on some metacyclic groups
• Quantum solution to the hidden subgroup problem for poly-near-Hamiltonian groups
• EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Quantum computation (81P68)

Cited In (9)

• Quantum property testing of group solvability
• Quantum algorithm design: techniques and applications
• On the quantum complexity of the continuous hidden subgroup problem
• Algorithmic problems in Engel groups and cryptographic applications
• Title not available (Why is that?)
• Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
• The quantum query complexity of the abelian hidden subgroup problem
• Quantum algorithms for the hidden subgroup problem on some semi-direct product groups by reduction to abelian cases
• Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields

This page was built for publication: Efficient quantum algorithms for the hidden subgroup problem over semi-direct product groups

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