Computing the unit group and class group of a number field are two of the main tasks in computational algebraic number theory. Factoring integers reduces to solving Pell's equation, which is a special case of computing the unit group, but a reduction in the other direction is not known and appears more difficult. We give polynomial-time quantum algorithms for computing the unit group and class group when the number field has constant degree.
No takes yet. Share an insight, caveat, or question.
Sean Hallgren (2005) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: