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

Science

Factoring Numbers with Waves

Muhammad Suhail Zubairy

Published Apr 26, 2007• 5 citations
Publisher

Abstract

Finding prime factors of a number by means of wave interference may have applications in quantum computing and security systems.
DOI
10.1126/science.1140915

Related papers

HUBO and QUBO models for prime factorization

Kyungtaek Jun, Hyunju Lee

The security of the RSA cryptosystem is based on the difficulty of factoring a large number N into prime numbers [Formula: see text] and [Formula: see text] satisfying [Formula: see text]. This paper presents a prime factorization method using a D-Wave quantum computer that could threaten the RSA cryptosystem in the future. The starting point for this method is very simple, representing two prime numbers as qubits. Then, we set the difference between the product of the two prime numbers expressed in qubits and N as a cost function, and we find the solution when the cost function is minimized. D-Wave's quantum annealer can find the minimum value of any quadratic problem. However, the cost function must be a higher-order unconstrained optimization (HUBO) model because it contains second- or higher-order terms. We used a hybrid solver accessible via Leap, D-Wave's real-time quantum cloud service, and the dimod package provided by the D-Wave Ocean software development kit (SDK) to solve the HUBO problem. We also successfully factorized 102,454,763 with 26 logical qubits. In addition, we factorized 1,000,070,001,221 using the range-dependent Hamiltonian algorithm.

arXiv:2301.06738•Scientific Reports•Jun 21, 2023•31 citations

A New Simple and Efficient Quantum Algorithm for Factoring Composite Integers

Dhananjay P. Mehendale

Quantum Physics Letters•Aug 1, 2018•1 citation

Quantum Procedures for Factorizing Large Numbers

Schuurman, Lynn K.N.

•Jun 1, 2025•0 citations

Applications to quantum information processing

Howard M. Wiseman, Gerard J Milburn

Any technology that functions at the quantum level must face the issues of measurement and control. We have good reasons to believe that quantum physics enables communication and computation tasks that are either impossible or intractable in a classical world [NC00]. The security of widely used classical cryptographic systems relies upon the difficulty of certain computational tasks, such as breaking large semi-prime numbers into their two prime factors in the case of RSA encryption. By contrast, quantum cryptography can be absolutely secure, and is already a commercial reality. At the same time, the prospect of a quantum computer vastly faster than any classical computer at certain tasks is driving an international research programme to implement quantum information processing. Shor's factoring algorithm would enable a quantum computer to find factors exponentially faster than any known algorithm for classical computers, making classical encryption insecure. In this chapter, we investigate how issues of measurement and control arise in this most challenging quantum technology of all, quantum computation.

Cambridge University Press eBooks•Nov 12, 2009•0 citations

Modeling One-way and Two-way quantum key distribution protocols

Ahmed Mahmoud Sofy, Mohamed Ahmed Shalaby, Hisham Dahshan +1 more

The present cryptography systems security depends on the hardness of factorizing an integer number with a large number of digits to its prime integer factors. In 1994, Peter Shor proposed a quantum procedure (Shor's algorithm) that easily factorizes large integer numbers to its prime factors compared with other algorithms. Consequently, present cryptography systems became endangered and once quantum computers exist, conventional cryptography systems could breakdown. On the other hand, quantum cryptography security is based on the well-known quantum mechanics uncertainty principle, and so the quantum cryptography enhances the cryptography field with a mechanism for eavesdropper detecting. Here, a hardware implementation was proposed for two types of key distribution protocols based on quantum computing, the one-way quantum key distribution protocol (BB84 protocol), and the two-way quantum key distribution protocol.

International Conference on Intelligent Computing and Information Systems (ICICIS)•Dec 1, 2019•4 citations

Computing prime factors with a Josephson phase qubit quantum processor

Erik A. Lucero, R. Barends, Yulin Chen +11 more

arXiv:1202.5707•Nature Physics•Aug 19, 2012•325 citations
The security of the RSA cryptosystem is based on the difficulty of factoring a large number N into prime numbers [Formula: see text] and [Formula: see text] satisfying [Formula: see text]. This paper presents a prime factorization method using a D-Wave quantum computer that could threaten the RSA cryptosystem in the future. The starting point for this method is very simple, representing two prime numbers as qubits. Then, we set the difference between the product of the two prime numbers expressed in qubits and N as a cost function, and we find the solution when the cost function is minimized. D-Wave's quantum annealer can find the minimum value of any quadratic problem. However, the cost function must be a higher-order unconstrained optimization (HUBO) model because it contains second- or higher-order terms. We used a hybrid solver accessible via Leap, D-Wave's real-time quantum cloud service, and the dimod package provided by the D-Wave Ocean software development kit (SDK) to solve the HUBO problem. We also successfully factorized 102,454,763 with 26 logical qubits. In addition, we factorized 1,000,070,001,221 using the range-dependent Hamiltonian algorithm.
Any technology that functions at the quantum level must face the issues of measurement and control. We have good reasons to believe that quantum physics enables communication and computation tasks that are either impossible or intractable in a classical world [NC00]. The security of widely used classical cryptographic systems relies upon the difficulty of certain computational tasks, such as breaking large semi-prime numbers into their two prime factors in the case of RSA encryption. By contrast, quantum cryptography can be absolutely secure, and is already a commercial reality. At the same time, the prospect of a quantum computer vastly faster than any classical computer at certain tasks is driving an international research programme to implement quantum information processing. Shor's factoring algorithm would enable a quantum computer to find factors exponentially faster than any known algorithm for classical computers, making classical encryption insecure. In this chapter, we investigate how issues of measurement and control arise in this most challenging quantum technology of all, quantum computation.
The present cryptography systems security depends on the hardness of factorizing an integer number with a large number of digits to its prime integer factors. In 1994, Peter Shor proposed a quantum procedure (Shor's algorithm) that easily factorizes large integer numbers to its prime factors compared with other algorithms. Consequently, present cryptography systems became endangered and once quantum computers exist, conventional cryptography systems could breakdown. On the other hand, quantum cryptography security is based on the well-known quantum mechanics uncertainty principle, and so the quantum cryptography enhances the cryptography field with a mechanism for eavesdropper detecting. Here, a hardware implementation was proposed for two types of key distribution protocols based on quantum computing, the one-way quantum key distribution protocol (BB84 protocol), and the two-way quantum key distribution protocol.