Shor's Algorithm

Shor's Algorithm is a quantum algorithm that fundamentally distinguishes itself from classical factorization methods by efficiently solving the integer factorization problem in polynomial time through the use of quantum superposition, entanglement, and the quantum Fourier transform.

167

Publications

16.3K

Citations

351

Authors

178

Institutions

Publications per year

2017–2026

38

Authors

351

  1. LC
    Lloyd C. L. Hollenberg

    The University of Melbourne, Australia

    6 publications · 349 citations

    6

    h-index

  2. AG
    Austin G. Fowler

    Centre for Quantum Computation and Communication Technology, Australia

    5 publications · 305 citations

    5

    h-index

  3. IL
    Isaac L. Chuang

    Massachusetts Institute of Technology, United States

    4 publications · 2.4K citations

    4

    h-index

  4. LJ
    Leonard J. Schulman

    California Institute of Technology, United States

    4 publications · 144 citations

    4

    h-index

  5. GB
    Gregory Breyta

    IBM Research - Almaden, United States

    3 publications · 1.9K citations

    3

    h-index

1–5 of 351

Venues

  1. Physical Review A

    PRA · 20 publications · 1.6K citations

    14

    h-index

  2. arXiv (Cornell University)

    Repository · 16 publications · 1.2K citations

    12

    h-index

  3. ArXiv.org

    Repository · 14 publications · 402 citations

    11

    h-index

  4. Physical Review Letters

    PRL · 11 publications · 2.2K citations

    11

    h-index

  5. Quantum Information and Computation

    QIC · 12 publications · 860 citations

    10

    h-index

1–5