Moore / Hallgren / Zn / Bacon / Schulman / Rockmore / G0 / Ta-Shma / Gi / Russell / Quantum Technologies / G/G / /
Country
Hungary / France / / /
Event
Force Majeure / /
Facility
Automation Research Institute / National University of Singapore / / /
IndustryTerm
factor / theoretical tools / commutative / non-abelian groups / direct product / nilpotent groups / abelian groups / solvable black box / polynomial time algorithm / extraspecial groups / tensor product / subspace stabilizer algorithm / symmetric / solvable groups / paradigmatic / computing / finite / nilpotent / normal words representing products / nontrivial solution / multiplicative / finite solvable / search problems / /
Organization
National University of Singapore / Singapore / Computer and Automation Research Institute / European Commission / French ANR / Hungarian Academy of Sciences / National Research Foundation / Singapore Ministry of Education / /
Person
Ai / Luc Sanselme‡ Miklos Santha / / /
Position
Prime Minister / /
Technology
following algorithm / quantum algorithm / polynomial time algorithm / subspace stabilizer algorithm / /
An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups ∗ G´abor Ivanyos† Luc Sanselme‡