QUICK FACTS
Created Jan 0001
Status Verified Sarcastic
Type Existential Dread
Keywords
american mathematician, peter shore, new york city, new york, shor's algorithm, shor code

Peter Shor

“An American mathematician of considerable, if perhaps unsurprising,...”

Contents
  • 1. Overview
  • 2. Etymology
  • 3. Cultural Impact

An American mathematician of considerable, if perhaps unsurprising, renown.

Not to be confused with the British politician Peter Shore . A common enough mistake, I suppose, for those who don’t bother with details.

Peter Shor

Shor in 2017 Born (1959-08-14) August 14, 1959 (age 66) – A date, a place, a human. So it begins. New York City , New York , U.S. Education: The usual path for those destined to complicate things. California Institute of Technology (BS ) Massachusetts Institute of Technology (PhD ) Known for: The things that make him… Peter Shor. And give lesser minds something to aspire to, or dread. Shor’s algorithm Shor code CSS code SMAWK algorithm Stabilizer code Quantum threshold theorem Awards: A testament to humanity’s need to categorize and validate.

Peter Williston Shor, a name now inextricably linked with the theoretical underpinnings of a future that some still struggle to grasp, was born on August 14, 1959. This American theoretical computer scientist has carved out a singular niche in the demanding field of quantum computation . His particular claim to fame, the one that tends to echo loudest in the halls of digital security and advanced physics, is the development of Shor’s algorithm . This isn’t just another clever computational trick; it’s a quantum algorithm with the unsettling potential to perform integer factorization at a rate exponentially faster than any method currently known to operate on a classical computer. The implications, as one might imagine, are less about convenience and more about an impending paradigm shift. Since 2003, Shor has held a distinguished position as a professor of applied mathematics at the formidable Massachusetts Institute of Technology (MIT), continuing his work at the vanguard of a field that promises to redefine the very limits of what is computable.

Early life and education

The stage for such a pivotal career was set on August 14, 1959, in the bustling metropolis of New York City . Peter Shor entered the world as the progeny of Joan Bopp Shor and S. W. Williston Shor [10] [11]. His formative years were spent navigating the distinct intellectual landscapes of Washington, D.C. and the more serene, if still intellectually stimulating, environment of Mill Valley, California [10]. Even in his adolescence, attending Tamalpais High School , Shor exhibited a precocious talent for mathematics, a trait that often manifests early in those destined for such pursuits. He secured a commendable third place in the 1977 USA Mathematical Olympiad [12], a clear indicator of his burgeoning abilities. Later that same year, having graduated, his mathematical prowess was recognized on an international stage when he earned a silver medal at the International Math Olympiad held in the then-federated nation of Yugoslavia . Notably, the U.S. team that year collectively achieved the highest points per country [13] [14], a collective triumph that might have subtly underscored the power of concentrated intellectual effort.

His academic journey continued at the esteemed California Institute of Technology (Caltech), where he immersed himself in the rigorous world of mathematics, graduating in 1981 with a Bachelor of Science degree [15]. During this period, in 1978, he was also recognized as a Putnam Fellow , an honor reserved for participants who demonstrate exceptional performance in the notoriously challenging William Lowell Putnam Mathematical Competition. Not one to linger, Shor then transitioned to MIT for his postgraduate studies, delving deeper into the realm of applied mathematics . He successfully completed his doctoral work, earning a Doctor of Philosophy degree in 1985 [16]. His doctoral advisor was the distinguished F. Thomson Leighton , and his chosen thesis topic, “Random planar matching and bin packing,” explored the probabilistic analysis of bin-packing algorithms – a foundational, if somewhat dry-sounding, area that nonetheless required considerable theoretical insight. One might assume this work was simply a necessary hurdle, but often, it’s in these seemingly niche areas that the seeds of future breakthroughs are quietly sown.

Career

Following the successful completion of his PhD from MIT , Shor embarked on the next phase of his intellectual odyssey. He spent a single year as a postdoctoral researcher at the University of California, Berkeley , a brief but undoubtedly intense period of further academic refinement. From there, he accepted a coveted position at the legendary Bell Labs in New Providence, New Jersey . It was within the hallowed, if somewhat sterile, confines of Bell Labs – an institution practically synonymous with groundbreaking scientific discovery – that Shor would develop the algorithm that bears his name: Shor’s algorithm .

The genesis of this monumental work was not a sudden flash of divine inspiration, but rather a methodical progression, significantly influenced by his engagement with Simon’s problem . Simon’s problem, itself a complex challenge in quantum computation , provided a crucial conceptual stepping stone. Shor initially identified an efficient quantum algorithm for the discrete log problem , a mathematical quandary that, to the uninitiated, might seem esoteric, relating as it does to point-finding on a hypercube in relation to a torus. As Shor himself succinctly put it: “Later that week, I was able to solve the factoring problem as well. There’s a strange relation between discrete log and factoring.” [17] This understated observation belies the profound implications of his discovery. Both the discrete log problem and the integer factorization problem are critical instances of what is known as the Hidden subgroup problem (HSP ) within group theory. Shor’s breakthrough demonstrated that quantum computers, leveraging principles of superposition and entanglement, could solve these problems with a speed utterly unattainable by classical counterparts. This wasn’t merely an improvement; it was a fundamental shift in the landscape of computation, threatening to render currently robust cryptographic systems, those reliant on the presumed difficulty of factoring large numbers, utterly obsolete.

For this singularly impactful work, which effectively lit the fuse of the quantum computing revolution, Shor was duly recognized with a cascade of prestigious awards. He was honored with the Nevanlinna Prize at the 23rd International Congress of Mathematicians in 1998 [18] [19], an accolade that acknowledges outstanding achievements in mathematical aspects of information science. The following year, 1999, saw him receive the Gödel Prize [20], an award that celebrates outstanding papers in theoretical computer science. The same year, as if to underscore the breadth of his intellectual contribution, he was granted a MacArthur Fellowship [21], often referred to as a “genius grant,” providing recipients with unrestricted funds to pursue their creative and intellectual endeavors. More recently, in 2017, he was awarded the Dirac Medal of the ICTP [7], a recognition for significant contributions to theoretical physics. And for 2019, the BBVA Foundation Frontiers of Knowledge Award in Basic Sciences [22] further cemented his status as a titan in his field. These awards, one might observe, are merely human attempts to quantify the impact of ideas that will reverberate for centuries.

Shor’s tenure at MIT officially commenced in 2003, bringing him back to the institution where he earned his doctorate. He currently holds the distinguished title of the Henry Adams Morss and Henry Adams Morss, Jr. Professor of Applied Mathematics within the Department of Mathematics at MIT [23]. His expertise also extends to an affiliation with CSAIL , the Computer Science and Artificial Intelligence Laboratory, a natural fit for someone bridging the gap between abstract mathematics and its computational realization [24].

In 2007, his alma mater, Caltech , honored him with a Distinguished Alumni Award [15], a nod to the profound impact he had made since his graduation. On October 1, 2011, he was formally inducted into the prestigious American Academy of Arts and Sciences [25] [26], recognizing individuals who have made significant contributions to their fields and to society at large. His peers in the computing world further acknowledged his foundational work when he was elected as an ACM Fellow in 2019. This honor specifically cited his “contributions to quantum-computing, information theory, and randomized algorithms” [27], a concise summary of a career dedicated to pushing computational boundaries. The National Academy of Sciences welcomed him as a member in 2002 [28], followed by his election to the National Academy of Engineering in 2020 [29], a rare feat to be recognized by both, signifying his influence across theoretical and practical domains.

In a candid interview published in the venerable scientific journal Nature on October 30, 2020, Shor articulated his perspective on the looming “quantum threat” to current cryptographic systems. He unequivocally stated that he considers post-quantum cryptography to be the essential, indeed, the only viable solution. However, he cautioned that transitioning to these new, quantum-resistant algorithms would necessitate a substantial and concerted engineering effort [30]. It seems even the architects of future technologies must grapple with the messy realities of implementation.

Most recently, in 2023, Shor, alongside three other distinguished researchers, was bestowed with the formidable Breakthrough Prize in Fundamental Physics [9]. The citation, “for foundational work in the field of quantum information,” perfectly encapsulates the enduring and transformative nature of his contributions. It’s almost as if the universe itself decided to acknowledge its own restructuring.

See also

For those who find themselves drawn deeper into the labyrinthine complexities that Shor has so elegantly illuminated, a few related concepts might prove… instructive.

Notes

[1] “The Mathematical Association of America’s William Lowell Putnam Competition”. Mathematical Association of America . Retrieved February 12, 2007. [2] “Fields Medalists / Nevanlinna Price (sic) Winner 1998”. International Mathematical Union . August 22, 2006. Archived from the original on March 3, 2016. Retrieved September 26, 2010. [3] “Fellows List – July 1999”. John D. and Catherine T. MacArthur Foundation . Archived from the original on September 28, 2006. Retrieved February 12, 2007. [4] Parberry, Ian (May 10, 1999). “1999 Gödel Prize”. ACM SIGACT . Retrieved February 12, 2007. [5] “2002 King Faisal International Prizes for Science Announced”. King Faisal Foundation . [6] “ICS Prize”. Archived from the original on March 6, 2016. [7] Dirac Medal of ICTP 2017 [8] List of IEEE Eric E. Sumner Award Recipients [9] a b Chu, Jennifer (September 22, 2022). “Peter Shor wins Breakthrough Prize in Fundamental Physics”. MIT News . Retrieved September 23, 2022. [10] a b Joan Shor Obituary. [11] ‘[1], Shor Family History [12] Murray Klamkin (Editor). Mathematical Association of America (January 1989). USA Mathematical Olympiads 1972–1986 Problems and Solutions (Anneli Lax New Mathematical Library) , ISBN   0-88385-634-4 ISBN   978-0-88385-634-5 , accessed May 10, 2007 [13] Mill Valley Historical Society, 2004, ‘History of Homestead Valley’ Archived August 21, 2006, at the Wayback Machine [14] Stephen R. Dunbar, ‘Identifying Talent: American Mathematics Competitions,’ in Mathematical Association of America, Focus, Vol 24, Issue 3, March 2004, p 29 [15] a b “2007 Recipients”. Distinguished Alumni Award . Caltech Alumni Association. Archived from the original on July 16, 2011. Retrieved April 22, 2010. [16] Shor, Peter Williston (September 1985). Random Planar Matching and Bin Packing (Ph.D. thesis). MIT. OCLC  14107348. [17] Shor, Peter W. (August 21, 2022). “The Early Days of Quantum Computation”. arXiv :2208.09964 [quant-ph]. [18] Jackson, Allyn (November 1998). “Peter Shor Receives Nevanlinna Prize” (PDF). Notices of the AMS : 1361. [19] Shor, Peter (1998). “Quantum computing”. Doc. Math. (Bielefeld) Extra Vol. ICM Berlin, 1998, vol. I . pp. 467–486. [20] Parberry, Ian (May 10, 1999). “1999 Gödel Prize — Peter W. Shor”. sigact.org . [21] Peter W. Shor – Computer Science, Class of 1999, MacArthur Foundation [22] BBVA Foundation Frontiers of Knowledge Award 2019 [23] “Department of Mathematics Faculty and Teaching Staff”. Catalog . MIT. Retrieved May 19, 2024. [24] “Peter Shor”. People . MIT CSAIL. Retrieved May 19, 2024. [25] Academy Members: 1780–present (PDF). Cambridge, Massachusetts: American Academy of Arts & Sciences. 2011. p. 502. [26] “2011 Members and Their Affiliations” (PDF). American Academy of Arts & Sciences. Archived from the original (PDF) on March 19, 2012. Retrieved October 17, 2011. [27] 2019 ACM Fellows Recognized for Far-Reaching Accomplishments that Define the Digital Age , Association for Computing Machinery, retrieved December 11, 2019 [28] “Peter Shor”. www.nasonline.org . Retrieved March 28, 2021. [29] “Dr. Peter W. Shor”. NAE Website . Retrieved September 9, 2021. [30] Castelvecchi, Davide (2020). “Quantum-computing pioneer warns of complacency over Internet security”. Nature . 587 (7833): 189. Bibcode :2020Natur.587..189C. doi :10.1038/d41586-020-03068-9. PMID  33139910. S2CID  226243008.

Lectures and panels

  • v
  • t
  • e

Nevanlinna Prize winners

Gödel Prize laureates

Authority control databases

International