Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physics Today

A question pertaining to Shor’s discovery

Terry Goldman

Published Sep 1, 2025• 0 citations
Publisher
DOI
10.1063/pt.wizl.mbfx

Related papers

Hidden Prime-Factor Subgroups in Molecular and Condensed-Phase Systems

Srinivasan S. Iyengar, Amr Sabry

We describe a group theoretic analysis of Shor's algorithm and other related hidden subgroup problems in mathematics and relate these to symmetries of molecular and condensed phase assemblies. By recasting Shor's algorithm through the lens of group theory, we expose the possibility that physical systems such as molecular orbitals, condensed phase assemblies and optical beams may be designed such that these contain information pertaining to the solution to hard mathematical problems such as prime-factoring. We discuss real molecular systems, whose orbitals are constructed from symmetry-adapted linear combinations of atomic orbitals, and show that these contain information pertaining to the prime-factors of corresponding integers. Due to the broad significance of prime-factoring towards a variety of encryption problems in cyber-security, we believe this novel and fundamental approach may have broad impact.

quant-pharXiv:2605.04343•May 7, 2026•0 citations

Shor’s Algorithm

Hiu Yung Wong

Springer eBooks•Jan 1, 2022•1 citation

Shor’s Algorithm

Hiu Yung Wong

Springer eBooks•Jun 21, 2023•19 citations

Cryptography in a Quantum World

Stephanie Wehner

Quantum computing had a profound impact on cryptography. Shor's discovery of an efficient quantum algorithm for factoring large integers implies that many existing classical systems based on computational assumptions can be broken, once a quantum computer is built. It is therefore imperative to find other means of implementing secure protocols. This thesis aims to contribute to the understanding of both the physical limitations, as well as the possibilities of cryptography in the quantum setting. In particular, we investigate several questions that are crucial to the security of quantum protocols: How can we find good uncertainty relations for a large number of measurement settings? How does the presence of entanglement affect classical protocols? And, what limitations does entanglement impose on implementing quantum protocols? Finally, can we circumvent some of those limitations using realistic assumptions?

arXiv:0806.3483•Jun 20, 2008•24 citations

Shor’s Algorithm

Belal Ehsan Baaquie, L. C. Kwek

Springer eBooks•Jan 1, 2023•1 citation

Shor Algorithm

Ray LaPierre

In 1994, a mathematician named Peter Shor surprised the world by publishing an efficient quantum algorithm for finding the prime factors of very large numbers, which is the basis for today’s data encryption. This discovery spurred the further development of quantum computing, making Shor’s algorithm one of the most important algorithms.

The Materials Research Society series•Oct 24, 2025•0 citations
We describe a group theoretic analysis of Shor's algorithm and other related hidden subgroup problems in mathematics and relate these to symmetries of molecular and condensed phase assemblies. By recasting Shor's algorithm through the lens of group theory, we expose the possibility that physical systems such as molecular orbitals, condensed phase assemblies and optical beams may be designed such that these contain information pertaining to the solution to hard mathematical problems such as prime-factoring. We discuss real molecular systems, whose orbitals are constructed from symmetry-adapted linear combinations of atomic orbitals, and show that these contain information pertaining to the prime-factors of corresponding integers. Due to the broad significance of prime-factoring towards a variety of encryption problems in cyber-security, we believe this novel and fundamental approach may have broad impact.
Quantum computing had a profound impact on cryptography. Shor's discovery of an efficient quantum algorithm for factoring large integers implies that many existing classical systems based on computational assumptions can be broken, once a quantum computer is built. It is therefore imperative to find other means of implementing secure protocols. This thesis aims to contribute to the understanding of both the physical limitations, as well as the possibilities of cryptography in the quantum setting. In particular, we investigate several questions that are crucial to the security of quantum protocols: How can we find good uncertainty relations for a large number of measurement settings? How does the presence of entanglement affect classical protocols? And, what limitations does entanglement impose on implementing quantum protocols? Finally, can we circumvent some of those limitations using realistic assumptions?