Peter Shor and Lov Grover: The Two Algorithms That Started the Race

Updated 2026-10-11 | 4 min read | QUANTUM (QNT) community

Two ideas, one lab

For years after the first theoretical proposals, quantum computing was an interesting puzzle without a killer reason to build one. Then, in the mid 1990s, two researchers at Bell Laboratories supplied reasons. Peter Shor showed a quantum computer could factor large numbers dramatically faster than known classical methods. Lov Grover showed a quantum computer could search an unsorted list with fewer steps. These two results still anchor most explanations of what quantum computers are good for. For the technical walk through, see Shor's algorithm explained and Grover's algorithm explained.

Profiles on this site cover public professional activity only, drawn from the sources listed at the bottom. Nothing here suggests any person named has any connection to the QNT memecoin.

Peter Shor

Reported as born in New York City in 1959, Shor studied at Caltech and earned his PhD in applied mathematics at MIT in 1985. After a postdoctoral position at UC Berkeley he joined AT&T Bell Laboratories in 1986. Sources differ on the exact New Jersey site, so this page names only the company. He has been a professor of applied mathematics at MIT since 2003, where his title is reported as the Henry Adams Morss and Henry Adams Morss, Jr. Professor of Applied Mathematics, with an affiliation to CSAIL.

His 1994 algorithm solves the factoring problem efficiently on an ideal quantum computer. Wikipedia reports that he first found a quantum algorithm for the discrete logarithm problem and then solved factoring soon after, inspired by Simon's problem. That matters because widely used public key systems such as RSA rely on factoring being hard. See why quantum breaks RSA.

Shor also helped answer an early objection: that noise would make quantum computers impossible. His error correcting code, and the quantum threshold theorem, are listed among the things he is known for. The takeaway for optimists: the theory of fault tolerance came early, and the hardware is now working toward it. See quantum error correction.

Shor's honors, as listed on his Wikipedia page, include the Nevanlinna Prize (1998), a MacArthur Fellowship and the Godel Prize (both 1999), the Dirac Medal of the ICTP (2017), the Breakthrough Prize in Fundamental Physics (2023) and the Claude E. Shannon Award (2025).

Lov Grover

Wikipedia reports Grover as born in 1961 in Meerut, India. He earned a bachelor's degree at the Indian Institute of Technology, Delhi in 1981 and a PhD in electrical engineering at Stanford in 1985. He joined Bell Laboratories in 1984, was a visiting professor at Cornell from 1987 to 1994, retired from Bell Labs in 2008 and is described as an independent researcher.

In 1996 he introduced a quantum database search algorithm. It was the second major quantum algorithm after Shor's, and it was implemented in a scalable physical quantum system in 2017, according to the same source. Grover's algorithm gives a quadratic speedup, which is helpful but not exponential. In practice that means a search that takes a million steps classically could take about a thousand quantum steps, in the ideal case.

Why the difference matters for security

The gap between the two results shapes policy. Shor's algorithm threatens public key schemes outright, which is why standards bodies are moving to new designs. See post quantum cryptography. Grover's speedup only weakens symmetric encryption and hashes by a manageable amount, usually answered by using longer keys. See hash functions and quantum computers.

What neither algorithm means

• No machine is breaking RSA today. Running Shor's algorithm at cryptographic size needs a large error corrected machine that does not exist yet.
• Neither person is tied to any token. Both are scientists whose published work is public. The QNT memecoin has no link to them.
• Speedups are task specific. Quantum computers are not faster at everything. See quantum computing myths.

The optimistic reading

Three decades after these papers, the field has moved from blackboard to labs, clouds and billion dollar roadmaps. Two clever ideas from one research lab explain why. That is a hopeful pattern: a few well chosen algorithms can pull an entire industry into existence.

Sources and further reading

• Wikipedia: Peter Shor
• Wikipedia: Lov Grover
• AIP History Programs: Peter Shor oral history catalog entry
• King Faisal Prize: Professor Peter W. Shor

Reported as of 2026-10-09. Titles and roles change, so check each person's own organization. This page is education, not financial advice, and it is not an endorsement of any person, company or asset. The QNT memecoin is an independent community project with no link to any person or organization named here, including Quantinuum Ltd.

Frequently asked questions

Share on X

Keep reading

• Shor's Algorithm Explained Step by Step
  How does Shor's algorithm work? A plain English walk through period finding, why it breaks RSA and elliptic curves in theory, and what hardware it would need.
• Grover's Algorithm Explained Step by Step
  How does Grover's algorithm work? Learn amplitude amplification, why the speedup is only quadratic, and what it really means for keys and hashes.
• Quantum Algorithms Explained for Beginners
  What is a quantum algorithm? Learn how Shor's, Grover's and other quantum algorithms work in plain English, and which ones matter for cryptography and crypto.
• The People Leading the Charge in Quantum Computing
  Researchers and executives who shaped quantum computing: Neven, Gambetta, Hazra, Devoret, Martinis, Shor, Preskill, Nayak, O'Brien, Gidney, Aspect and more.

All Quantum industry, people and AI guides | Back to top | Search the site

Main pages: Quantum computing explained | Quantum and crypto | Companies | Quantum news | Glossary