← Back to papers
A quantum algorithm for computing the Carmichael function
J. C. García-Escartín·November 3, 2021
PhysicsMathematics
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
Abstract
Quantum computers can solve many number theory problems efficiently. Using the efficient quantum algorithm for order finding as an oracle, this paper presents an algorithm that computes the Carmichael function for any integer N with a probability as close to 1 as desired. The algorithm requires O((log n)n) quantum operations, or O(log log n(log n)n) operations using fast multiplication. Verification, quantum optimizations and applications to RSA and primality tests are also discussed.