Quantum algorithms for solvable groups


In this paper we give a polynomial-time quantum algorithm for computing orders of solvable groups. Several other problems, such as testing membership in solvable groups, testing equality of subgroups in a given solvable group, and testing normality of a subgroup in a given solvable group, reduce to computing orders of solvable groups and therefore admit… (More)
DOI: 10.1145/380752.380759


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics