Peter Scholl’s Algorithm: Is It Really a Threat to the Internet? Here’s Why He’s Not Concerned

“Is he the Beyoncé of this event?” a young woman asked beside me. As we observe a crowd of bearded men in orange sweaters, getting a glimpse of him feels akin to viewing the Mona Lisa—a momentary, fleeting encounter. “His algorithm is revolutionary,” remarked a colleague, capturing quick snapshots with attendees who were taking selfies and getting conference badges autographed.

I’m currently at the Quantum.Tech World conference in Boston, where Peter Schor is the headliner. Schor is renowned in the quantum computing sphere, thanks to his notable invention, known as Schor’s algorithm.

During the 1990s, Schor was a visionary at Bell Laboratories in New Jersey. At the time, quantum computing was an emerging research topic that piqued his interest after attending a seminar presented by quantum pioneer Umesh Vazirani. He posed questions about the advantages quantum computers held over classical ones, which led him to wonder about practical applications.

Over six transformative months, he pinpointed a significant problem—factoring large numbers—and engineered a solution for quantum computers. Thus, Schor’s algorithm was born, a breakthrough that “could disrupt everything.” This pivotal contribution motivated researchers to push forward with the real construction of quantum computers.

Modern cryptography heavily relies on the challenge of factoring large numbers. As long as classical computers struggle with this task, our digital data—ranging from emails to banking records—remains secure. However, a quantum computer utilizing Schor’s algorithm can efficiently tackle this problem. In fact, a sufficiently powerful quantum computer could leverage this algorithm to decrypt even the most secure data.

Yet, in a rare moment of calm at the conference’s makeshift lounge, Schor expressed that he isn’t overly concerned. “We have robust methods for post-quantum cryptography; we just need to implement them.” He cautioned, “It will be a substantial challenge.”

Fortunately, well-documented encryption techniques exist that can withstand his algorithm.Organizations like the National Institute of Standards and Technology (NIST) are already establishing quantum-resistant encryption standards. However, adapting to these methods is a daunting and costly endeavor. For large entities like banks or hospitals, it may take years to audit their systems for vulnerabilities, followed by an equally lengthy process to update their infrastructure and software.

Time is of the essence. While current quantum computers are still in their developing stages, lacking the power to execute Schor’s algorithm, there have been remarkable advancements in both hardware and software in recent years. Major tech companies like Google are aiming for a 2029 target to finalize the transition to post-quantum cryptography. Furthermore, U.S. President Joe Biden recently issued a presidential order mandating that all high-value government systems achieve similar transitions by 2031.

“Quantum computers are still experimental, but they won’t remain that way for long,” Schor asserts. He commends the significant strides made by researchers to enhance the size and computational capabilities of quantum computers. The collaborative efforts in academia and industry to improve error correction in quantum systems have been impressive, according to Schor.

He clarifies a common misconception: not everything a classical computer does can be replicated faster by a quantum computer. “I don’t expect quantum systems to predict the stock market,” he states.

In Schor’s perspective, quantum computing should focus on a limited set of questions. Beyond cryptography, he emphasizes simulating complex systems related to quantum mechanics, chemistry, and biomedicine, alongside tackling certain optimization challenges. He expresses particular enthusiasm for optimization algorithms, which he believes have often been overlooked.

However, he candidly acknowledges that creating genuinely useful quantum algorithms thus far has proven to be an uphill battle. “It’s not that we aren’t intelligent enough to design superior algorithms; it may simply be that quantum computers will only be applicable for a narrow range of tasks,” he muses.

Final thoughts lead to a question about what could help advance understanding in the field. “Engaging with real quantum computers to explore their limitations and potential is vital,” he advises. “However, mastering quantum mechanics and computer science is a daunting task—it requires a great deal of dedication.”