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

DOI10.1007/978-3-540-78773-0_65zbMATH Open1136.68626OpenAlexW2098703812MaRDI QIDQ5458577FDOQ5458577

Miklos Santha, Luc Sanselme, Gábor Ivanyos

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)

Cited In (3)

• Quantum computation vs. firewalls
• Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
• The status of polycyclic group-based cryptography: a survey and open problems

   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 👍 👎
• Title not available (Why is that?) 👍 👎

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)