An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups

DOI10.1007/978-3-540-78773-0_65MaRDI QIDQ5458577zbMATH OpenOpenAlexFDO

Authors Gábor Ivanyos, Luc Sanselme, Miklos Santha

Publication date 15 April 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-78773-0_65

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Quantum computation (81P68)

Recommendations

• An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups
• An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups
• EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM
• Solutions to the hidden subgroup problem on some metacyclic groups
• Quantum solution to the hidden subgroup problem for poly-near-Hamiltonian groups

Cited in

(7)

• Quantum computation vs. firewalls
• An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups
• Classical and quantum algorithms for testing equivalence of group extensions
• An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups
• Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
• Zero sum subsequences and hidden subgroups
• The status of polycyclic group-based cryptography: a survey and open problems

This page was built for publication: An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups

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