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

Journal of Physical Mathematics

The Quantum Sieve of Eratosthenes

Artur Sowa

Published Jan 1, 2016• 0 citations
Publisher

Abstract

We introduce and examine quantum states of a special kind, referred to as E-states, whose properties are both structurally and functionally analogous to the sieve of Eratosthenes. More broadly, the concept of an E-state is related to a certain noncommutative extension of the Dirichlet ring, also discussed here for the first time. Furthermore, we demonstrate that E-states can be implemented on a universal quantum computer and, as a particular application, we construct an algorithm which implements the Dirichlet multiplication of sequences on a quantum computer. We also discuss the potential applicability of E-states to the problem of integer factorization although, we haste to add, we are not aware at present of the possibility of using this approach to obtain algorithms of sub-exponential complexity.

DOI
10.4172/2090-0902.1000180

Related papers

Integer Factorization by Quantum Measurements

Giuseppe Mussardo, Andrea Trombettoni

Quantum algorithms are at the heart of the ongoing efforts to use quantum mechanics to solve computational problems unsolvable on ordinary classical computers. Their common feature is the use of genuine quantum properties such as entanglement and superposition of states. Among the known quantum algorithms, a special role is played by the Shor algorithm, i.e. a polynomial-time quantum algorithm for integer factorization, with far reaching potential applications in several fields, such as cryptography. Here we present a different algorithm for integer factorization based on another genuine quantum property: quantum measurement. In this new scheme, the factorization of the integer $N$ is achieved in a number of steps equal to the number $k$ of its prime factors, -- e.g., if $N$ is the product of two primes, two quantum measurements are enough, regardless of the number of digits $n$ of the number $N$. Since $k$ is the lower bound to the number of operations one can do to factorize a general integer, one sees that a quantum mechanical setup can saturate such a bound.

arXiv:2309.10757•Sep 19, 2023•3 citations

The quantum Euclid algorithm and its application to factoring

Asma Al-Qasimi, Daniel F. V. James

We present a quantum implementation of the Euclid algorithm for calculating the Greatest Common Divisor when one of the integers involved is a compound of two odd-valued primes. We discuss a possible application to the quantum factoring problem, for which modular exponentiation is no longer required, and the factors are revealed directly by measurements, although the method does not scale for large numbers in a favourable manner.

arXiv:2611.15387•EPJ Quantum Technology•Nov 9, 2026•0 citations

Quadratic Sieve Factorization Quantum Algorithm and its Simulation

Amandeep Singh Bhatia, Ajay Kumar

Quantum computing is a winsome field that concerns with the behaviour and nature of energy at the quantum level to improve the efficiency of computations. In recent years, quantum computation is receiving much attention for its capability to solve difficult problems efficiently in contrast to classical computers. Specifically, some well-known public-key cryptosystems depend on the difficulty of factoring large numbers, which takes a very long time. It is expected that the emergence of a quantum computer has the potential to break such cryptosystems by 2020 due to the discovery of powerful quantum algorithms (Shor's factoring, Grover's search algorithm and many more). In this paper, we have designed a quantum variant of the second fastest classical factorization algorithm named "Quadratic Sieve". We have constructed the simulation framework of quantized quadratic sieve algorithm using high-level programming language Mathematica. Further, the simulation results are performed on a classical computer to get a feel of the quantum system and proved that it is more efficient than its classical variants from computational complexity point of view.

arXiv:2005.11668•May 24, 2020•2 citations

A brief review on Quantum Computing and the Shor's Factoring Algorithm

L. Martina, Giulio Soliani

Quantum Information and Quantum Computation are rapidly evolving domains in their theoretical foundations, implementations and applications. The main scope of the present book is to give the basic ideas of this field to undergraduate students in Physics. A rigorous approach is used to provide the key concepts and methods. Many examples are discussed. To be self-contained, the principles of Quantum Mechanics are reviewed. The discussion is aimed to the specific, but paradigmatic, factorization problem of integers, dealt by the Quantum Shor’s Algorithm. Thus, notions of the Number Theory are given in the first Chapter, while the exposition of the algorithm and its implementation is reserved to the last Section.

•Jan 1, 2006•0 citations

QUANTUM COMPUTATION: AN INTRODUCTION

Adriano Barenco

When applied to computation, quantum mechanics opens completely new perspectives; by exploiting quantum mechanical features such as entanglement or super-position, one can solve some problems much more efficiently than with classical computers. One of the most striking examples is the factoring problem. This task is believed to be out of reach of classical computers as soon as the number of digits in the number to factor exceeds a certain limit. In this contribution, we present the basic notion of quantum computation and review the most common quantum algorithms discovered so far.

WORLD SCIENTIFIC eBooks•Oct 1, 1998•13 citations

Holographic realization of the prime number quantum potential

Donatella Cassettari, Giuseppe Mussardo, Andrea Trombettoni

Abstract We report the experimental realization of the prime number quantum potential VN(x), defined as the potential entering the single-particle Schrödinger Hamiltonian with eigenvalues given by the first N prime numbers. Using computer-generated holography, we create light intensity profiles suitable to optically trap ultracold atoms in these potentials for different N values. As a further application, we also implement a potential whose spectrum is given by the lucky numbers, a sequence of integers generated by a different sieve than the familiar Eratosthenes’s sieve used for the primes. Our results pave the way toward the realization of quantum potentials with arbitrary sequences of integers as energy levels and show, in perspective, the possibility to set up quantum systems for arithmetic manipulations or mathematical tests involving prime numbers.

arXiv:2202.03446•PNAS Nexus•Dec 12, 2022•13 citations
We introduce and examine quantum states of a special kind, referred to as E-states, whose properties are both structurally and functionally analogous to the sieve of Eratosthenes. More broadly, the concept of an E-state is related to a certain noncommutative extension of the Dirichlet ring, also discussed here for the first time. Furthermore, we demonstrate that E-states can be implemented on a universal quantum computer and, as a particular application, we construct an algorithm which implements the Dirichlet multiplication of sequences on a quantum computer. We also discuss the potential applicability of E-states to the problem of integer factorization although, we haste to add, we are not aware at present of the possibility of using this approach to obtain algorithms of sub-exponential complexity.
Quantum algorithms are at the heart of the ongoing efforts to use quantum mechanics to solve computational problems unsolvable on ordinary classical computers. Their common feature is the use of genuine quantum properties such as entanglement and superposition of states. Among the known quantum algorithms, a special role is played by the Shor algorithm, i.e. a polynomial-time quantum algorithm for integer factorization, with far reaching potential applications in several fields, such as cryptography. Here we present a different algorithm for integer factorization based on another genuine quantum property: quantum measurement. In this new scheme, the factorization of the integer NNN is achieved in a number of steps equal to the number kkk of its prime factors, -- e.g., if NNN is the product of two primes, two quantum measurements are enough, regardless of the number of digits nnn of the number NNN. Since kkk is the lower bound to the number of operations one can do to factorize a general integer, one sees that a quantum mechanical setup can saturate such a bound.
Quantum computing is a winsome field that concerns with the behaviour and nature of energy at the quantum level to improve the efficiency of computations. In recent years, quantum computation is receiving much attention for its capability to solve difficult problems efficiently in contrast to classical computers. Specifically, some well-known public-key cryptosystems depend on the difficulty of factoring large numbers, which takes a very long time. It is expected that the emergence of a quantum computer has the potential to break such cryptosystems by 2020 due to the discovery of powerful quantum algorithms (Shor's factoring, Grover's search algorithm and many more). In this paper, we have designed a quantum variant of the second fastest classical factorization algorithm named "Quadratic Sieve". We have constructed the simulation framework of quantized quadratic sieve algorithm using high-level programming language Mathematica. Further, the simulation results are performed on a classical computer to get a feel of the quantum system and proved that it is more efficient than its classical variants from computational complexity point of view.
Quantum Information and Quantum Computation are rapidly evolving domains in their theoretical foundations, implementations and applications. The main scope of the present book is to give the basic ideas of this field to undergraduate students in Physics. A rigorous approach is used to provide the key concepts and methods. Many examples are discussed. To be self-contained, the principles of Quantum Mechanics are reviewed. The discussion is aimed to the specific, but paradigmatic, factorization problem of integers, dealt by the Quantum Shor’s Algorithm. Thus, notions of the Number Theory are given in the first Chapter, while the exposition of the algorithm and its implementation is reserved to the last Section.
When applied to computation, quantum mechanics opens completely new perspectives; by exploiting quantum mechanical features such as entanglement or super-position, one can solve some problems much more efficiently than with classical computers. One of the most striking examples is the factoring problem. This task is believed to be out of reach of classical computers as soon as the number of digits in the number to factor exceeds a certain limit. In this contribution, we present the basic notion of quantum computation and review the most common quantum algorithms discovered so far.
Abstract We report the experimental realization of the prime number quantum potential VN(x), defined as the potential entering the single-particle Schrödinger Hamiltonian with eigenvalues given by the first N prime numbers. Using computer-generated holography, we create light intensity profiles suitable to optically trap ultracold atoms in these potentials for different N values. As a further application, we also implement a potential whose spectrum is given by the lucky numbers, a sequence of integers generated by a different sieve than the familiar Eratosthenes’s sieve used for the primes. Our results pave the way toward the realization of quantum potentials with arbitrary sequences of integers as energy levels and show, in perspective, the possibility to set up quantum systems for arithmetic manipulations or mathematical tests involving prime numbers.