Shor's Factoring Algorithm

Shor's Factoring Algorithm is a quantum algorithm that fundamentally enables the efficient factorization of large integers by leveraging the quantum Fourier transform to find the period of a modular exponential function, thereby providing an exponential speedup over classical factoring methods.

153

Publications

15.1K

Citations

301

Authors

152

Institutions

Publications per year

2017–2026

29

Authors

301

  1. IL
    Igor L. Markov

    University of Michigan, United States

    6 publications · 280 citations

    6

    h-index

  2. LC
    Lloyd C. L. Hollenberg

    The University of Melbourne, Australia

    6 publications · 349 citations

    6

    h-index

  3. AG
    Austin G. Fowler

    Centre for Quantum Computation and Communication Technology, Australia

    5 publications · 305 citations

    5

    h-index

  4. NK
    Noboru Kunihiro

    The University of Tokyo, Japan

    4 publications · 143 citations

    4

    h-index

  5. MS
    Mehdi Saeedi

    Amirkabir University of Technology, Iran

    4 publications · 213 citations

    4

    h-index

1–5 of 301

Venues

  1. Physical Review A

    PRA · 18 publications · 1.7K citations

    14

    h-index

  2. arXiv (Cornell University)

    Repository · 16 publications · 743 citations

    12

    h-index

  3. Quantum Information and Computation

    QIC · 15 publications · 756 citations

    12

    h-index

  4. ArXiv.org

    Repository · 12 publications · 425 citations

    11

    h-index

  5. Physical Review Letters

    PRL · 8 publications · 1.6K citations

    8

    h-index

1–5