World's Best Scientists 2026 revealed!
Peter W. Shor

Peter W. Shor

Award Badge
Mathematics
USA
2026

D-Index & Metrics

Computer Science

D-Index
74
Citations
66324
World Ranking
1438
National Ranking
746

Mathematics

D-Index
74
Citations
55966
World Ranking
207
National Ranking
118

Research.com Recognitions

  • 2026 - Research.com Mathematics in United States Leader Award
  • 2025 - Research.com Mathematics in United States Leader Award
  • 2020 - Member of the National Academy of Engineering For pioneering contributions to quantum computation.
  • 2019 - BBVA Foundation Frontiers of Knowledge Award
  • 2019 - ACM Fellow For contributions to quantum computing, information theory, and randomized algorithms
  • 2018 - IEEE Eric E. Sumner Award “For contributions to quantum communication and information theory.”
  • 2011 - Fellow of the American Academy of Arts and Sciences
  • 2002 - Member of the National Academy of Sciences
  • 1999 - Fellow of the MacArthur Foundation
  • 1998 - Rolf Nevanlinna Prize

Overview

Peter W. Shor is affiliated with the Massachusetts Institute of Technology (MIT) in the United States. Their research spans multiple fields including Computer Science and Physics and Astronomy, with a focus on quantum information and computation.

The main fields of study for this scientist include:

  • Computer Science
  • Physics and Astronomy

Within these fields, key subfields covered are:

  • Artificial Intelligence
  • Atomic and Molecular Physics, and Optics
  • Computational Theory and Mathematics
  • Control and Systems Engineering
  • Statistical and Nonlinear Physics

Major research topics addressed in their work are:

  • Quantum Information and Cryptography
  • Quantum Computing Algorithms and Architecture
  • Quantum Mechanics and Applications
  • Computability, Logic, AI Algorithms
  • Advanced Thermodynamics and Statistical Mechanics
  • Quantum Electrodynamics and Casimir Effect
  • Thermal Radiation and Cooling Technologies

Recent publications reflect a wide range of interests in quantum computation and information theory. Notable papers include:

  • "The Early Days of Quantum Computation," 2022, published in arXiv (Cornell University)
  • "Bounding the Forward Classical Capacity of Bipartite Quantum Channels," 2023, published in IEEE Transactions on Information Theory
  • "Graphical quantum Clifford-encoder compilers from the ZX calculus," 2023, published in arXiv (Cornell University)
  • "Maximizing Free Energy Gain," 2025, published in Entropy
  • "Bounding the forward classical capacity of bipartite quantum channels," 2020, published in arXiv (Cornell University)

Frequent co-authors who have collaborated with Peter W. Shor include:

  • Andrey Boris Khesin
  • Yihui Quek
  • Jonathan Z. Lu
  • Dawei Ding
  • Sumeet Khatri

The most common venues for publication are:

  • arXiv (Cornell University)
  • IEEE Transactions on Information Theory
  • Entropy
  • The Mathematical Intelligencer
  • PRX Quantum

Awards received by this researcher highlight recognition within the scientific community, including:

  • Member of the National Academy of Engineering (2020) for pioneering contributions to quantum computation
  • ACM Fellow (2019) for contributions to quantum computing, information theory, and randomized algorithms
  • BBVA Foundation Frontiers of Knowledge Award (2019)
  • IEEE Eric E. Sumner Award (2018) for contributions to quantum communication and information theory
  • Fellow of the American Academy of Arts and Sciences (2011)
  • Member of the National Academy of Sciences (2002)
  • Fellow of the MacArthur Foundation (1999)
  • Rolf Nevanlinna Prize (1998)

Best Publications

  • Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

    Peter W. Shor

  • Algorithms for quantum computation: discrete logarithms and factoring

    P.W. Shor

  • Elementary gates for quantum computation.

    Adriano Barenco;Charles H. Bennett;Richard Cleve;David P. DiVincenzo

  • Scheme for reducing decoherence in quantum computer memory

    Peter W. Shor

  • Simple proof of security of the BB84 quantum key distribution protocol

    Peter W. Shor;John Preskill

  • Good quantum error-correcting codes exist

    A. R. Calderbank;Peter W. Shor

  • Quantum error correction via codes over GF(4)

    A.R. Calderbank;E.M. Rains;P.M. Shor;N.J.A. Sloane

  • Applications of random sampling in computational geometry, II

    K. L. Clarkson

  • Quantum nonlocality without entanglement

    Charles H. Bennett;David P. DiVincenzo;Christopher A. Fuchs;Tal Mor

  • Fault-tolerant quantum computation

    P.W. Shor

  • Remote State Preparation

    Charles H. Bennett;David P. DiVincenzo;Peter W. Shor;John A. Smolin

  • Quantum Error Correction and Orthogonal Geometry

    A. R. Calderbank;E. M. Rains;P. W. Shor;N. J. A. Sloane

  • Unextendible product bases and bound entanglement

    Charles H. Bennett;David P. DiVincenzo;Tal Mor;Tal Mor;Peter W. Shor

  • Entanglement Breaking Channels

    Michael Horodecki;Peter W. Shor;Mary Beth Ruskai

  • Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem

    C.H. Bennett;P.W. Shor;J.A. Smolin;A.V. Thapliyal

  • The Capacity of a Quantum Channel for Simultaneous Transmission of Classical and Quantum Information

    I. Devetak;P. W. Shor

  • Geometric applications of a matrix-searching algorithm

    Alok Aggarwal;Maria M. Klawe;Shlomo Moran;Peter W. Shor

  • General Entanglement Breaking Channels

    Michael Horodecki;Peter W. Shor;Mary Beth Ruskai

  • Fault-Tolerant Error Correction with Efficient Quantum Codes.

    David P. DiVincenzo;Peter W. Shor

  • Equivalence of Additivity Questions in Quantum Information Theory

    Peter W. Shor;Peter W. Shor

Frequent Co-Authors

John A. Smolin
John A. Smolin IBM (United States)
Charles H. Bennett
Charles H. Bennett IBM (United States)
Edward G. Coffman
Edward G. Coffman Columbia University
Richard Weber
Richard Weber University of Cambridge
David P. DiVincenzo
David P. DiVincenzo RWTH Aachen University
David S. Johnson
David S. Johnson AT&T (United States)
Neil J. A. Sloane
Neil J. A. Sloane OEIS Foundation Inc.
Scott Aaronson
Scott Aaronson The University of Texas at Austin

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students pursuing Mathematics in the USA, expanding knowledge through complementary online degrees can open diverse career opportunities. Many professionals consider programs like the fastest mba online to quickly gain leadership and business skills that complement their analytical expertise.

If marketing and data analysis spark your interest, earning an ms in digital marketing degree cost usa is a practical choice. These degrees are designed to fit flexible budgets and timelines while potentially enhancing earning potential in technology-driven roles.

For those looking to accelerate their career progression, one year mba programs provide intensive, focused education, helping students enter the workforce faster or advance within their current roles.

Additionally, many programs recognize prior learning, allowing students to save time and money by transferring credits. Exploring options on can you transfer credits into an mba program can help you find the best fit for your educational background and career goals.

Best Scientists Citing Peter W. Shor

Trending Scientists

Recently Published Articles