In this paper it has been described how to use the unitary dynamics of quantum mechanics to solve the prime factorization problem on a spin ensemble without any quantum entanglement. The ensemble quantum computation for the prime factorization is based on the basic principle that both a closed quantum system and its ensemble obey the same unitary dynamics of quantum mechanics if there is not any decoherence effect in both the quantum system and its ensemble. It uses the NMR multiple-quantum measurement techniques to output the quantum computational results that are the inphase multiple-quantum spectra of the spin ensemble. It has been shown that the inphase NMR multiple-quantum spectral intensities used to search for the period of the modular exponential function may reduce merely in a polynomial form as the qubit number of the spin ensemble. The time evolution process of the modular exponential operation on the quantum computer obeys the unitary dynamics of quantum mechanics and hence the computational output is governed by the quantum dynamics. This essential difference between the quantum computer and the classical one could be the key point for the quantum computation outperforming the classical one in the prime factorization on a spin ensemble without any quantum entanglement. It has been shown that the prime factorization based on the quantum dynamics on a spin ensemble is locally efficient at least. This supports the conjecture that the quantum dynamics could play an important role for the origin of power of quantum computation and quantum entanglement could not be a unique resource to achieve power of quantum computation in the prime factorization.
We give algorithms to factorize large integers in the duality computer. We provide three duality algorithms for factorization based on a naive factorization method, the Shor algorithm in quantum computing, and the Fermat's method in classical computing. All these algorithms are polynomial in the input size.
We report a quantum-classical hybrid scheme for factorization of bi-prime numbers (which are odd and square-free) using IBM's quantum processors. The hybrid scheme proposed here involves both classical optimization techniques and adiabatic quantum optimization techniques, and is build by extending a previous scheme of hybrid factorization [Pal et al., Pramana 92, 26 (2019) and Xu et al., Phys. Rev. Lett. 108, 130501 (2012)]. The quantum part of the scheme is very general in the sense that it can be implemented using any quantum computing architecture. Here, as an example, we experimentally imp…
The effects of imperfect gate operations in implementation of Shor's prime factorization algorithm are investigated. The gate imperfections may be classified into three categories: the systematic error, the random error, and the one with combined errors. It is found that Shor's algorithm is robust against the systematic errors but is vulnerable to the random errors. Error threshold is given to the algorithm for a given number $N$ to be factorized.
The effects of imperfect gate operations in implementation of Shor's prime factorization algorithm are investigated. The gate imperfections may be classified into three categories: the systematic error, the random error, and the one with combined errors. It is found that Shor's algorithm is robust against the systematic errors but is vulnerable to the random errors. Error threshold is given to the algorithm for a given number $N$ to be factorized.
We have developed a framework to convert an arbitrary integer factorization problem to an executable Ising model by first writing it as an optimization function and then transforming the k-bit coupling ($k\geq 3$) terms to quadratic terms using ancillary variables. The method is efficient and uses $\mathcal{O}(\text{log}^2(N))$ binary variables (qubits) for finding the factors of integer $N$. The method was tested using the D-Wave 2000Q for finding an embedding and determining the prime factors for a given composite number. As examples, we present quantum annealing results for factoring 15, 14…
A Hilbert space in M dimensions is shown explicitly to accommodate representations that reflect the prime numbers decomposition of M. Representations that exhibit the factorization of M into two relatively prime numbers: the kq representation (J. Zak, Phys. Today, {\bf 23} (2), 51 (1970)), and related representations termed $q_{1}q_{2}$ representations (together with their conjugates) are analysed, as well as a representation that exhibits the complete factorization of M. In this latter representation each quantum number varies in a subspace that is associated with one of the prime numbers tha…
We propose an iterative scheme to factor numbers based on the quantum dynamics of an ensemble of interacting bosonic atoms stored in a trap where the single-particle energy spectrum depends logarithmically on the quantum number. When excited by a time-dependent interaction these atoms perform Rabi oscillations between the ground state and an energy state characteristic of the factors. The number to be factored is encoded into the frequency of the sinusoidally modulated interaction. We show that a measurement of the energy of the atoms at a time chosen at random yields the factors with probabil…
The N distinct prime numbers that make up a composite number M allow $2^{N-1}$ bi partioning into two relatively prime factors. Each such pair defines a pair of conjugate representations. These pairs of conjugate representations, each of which spans the M dimensional space are the familiar complete sets of Zak transforms (J. Zak, Phys. Rev. Let.{\bf 19}, 1385 (1967)) which are the most natural representations for periodic systems. Here we show their relevance to factorizations. An example is provided for the manifestation of the factorization.
Determining the prime factors of a given number N is a problem, which requires super-polynomial time for conventional digital computers. A polynomial-time algorithm was invented by P. Shor for quantum computers. However, the realization of quantum computers is associated with significant technological challenges in achieving and preserving quantum entanglement. Prime factorization can be also solved by using classical wave interference without quantum entanglement. In this work, we present experimental data showing prime factorization by utilizing spin wave interference. The prime factorizatio…
We investigate prime factorization from two perspectives: quantum annealing and computational algebraic geometry, specifically Gröbner bases. We present a novel scalable algorithm which combines the two approaches and leads to the factorization of all bi-primes up to just over $200 \, 000$, the largest number factored to date using a quantum processor.
The road to computing on quantum devices has been accelerated by the promises that come from using Shor's algorithm to reduce the complexity of prime factorization. However, this promise hast not yet been realized due to noisy qubits and lack of robust error correction schemes. Here we explore a promising, alternative method for prime factorization that uses well-established techniques from variational imaginary time evolution. We create a Hamiltonian whose ground state encodes the solution to the problem and use variational techniques to evolve a state iteratively towards these prime factors.…
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. This paper considers factoring integers and finding discrete logarithms, two problems which are generally thought to be hard on a classical computer and have been used as the basis of several proposed cryptosystems. Efficient randomized algorithms are given for these two problems on a hypothetical …
Modern cryptography is largely based on complexity assumptions, for example, the ubiquitous RSA is based on the supposed complexity of the prime factorization problem. Thus, it is of fundamental importance to understand how a quantum computer would eventually weaken these algorithms. In this paper, one follows Feynman's prescription for a computer to simulate the physics corresponding to the algorithm of factoring a large number $N$ into primes. Using Dirac-Jordan transformation theory one translates factorization into the language of quantum hermitical operators, acting on the vectors of the …
Inspired by non-abelian vortex anyons in spinor Bose-Einstein condensates, we consider the quantum double $\mathcal{D}(Q_8)$ anyon model as a platform to carry out a particular instance of Shor's factorization algorithm. We provide the excitation spectrum, the fusion rules, and the braid group representation for this model, and design a circuit architecture that facilitates the computation. All necessary quantum gates, less one, can be compiled exactly for this hybrid topological quantum computer, and to achieve universality the last operation can be implemented in a non-topological fashion. T…
We demonstrate how structured decompositions of unitary operators can be employed to derive control schemes for finite-level quantum systems that require only sequences of simple control pulses such as square wave pulses with finite rise and decay times or Gaussian wavepackets. To illustrate the technique it is applied to find control schemes to achieve population transfers for pure-state systems, complete inversions of the ensemble populations for mixed-state systems, create arbitrary superposition states and optimize the ensemble average of dynamic observables.
Prime factorization is a difficult problem with classical computing, whose exponential hardness is the foundation of Rivest-Shamir-Adleman (RSA) cryptography. With programmable quantum devices, adiabatic quantum computing has been proposed as a plausible approach to solve prime factorization, having promising advantage over classical computing. Here, we find there are certain hard instances that are consistently intractable for both classical simulated annealing and un-configured adiabatic quantum computing (AQC). Aiming at an automated architecture for optimal configuration of quantum adiabat…
New algorithms for prime factorization that outperform the existing ones or take advantage of particular properties of the prime factors can have a practical impact on present implementations of cryptographic algorithms that rely on the complexity of factorization. Currently used keys are chosen on the basis of the present algorithmic knowledge and, thus, can potentially be subject to future breaches. For this reason, it is worth to investigate new approaches which have the potentiality of giving a computational advantage. The problem has also relevance in quantum computation, as an efficient …
In the context of the mixing dynamical systems we present a derivation of the Gaussian ensembles distributions from mixing quantum systems having a classical analog that is mixing. We find that mixing factorization property is satisfied for the mixing quantum systems expressed as a factorization of quantum mean values. For the case of the kicked rotator and in its fully chaotic regime, the factorization property links decoherence by dephasing with Gaussian ensembles in terms of the weak limit, interpreted as a decohered state. Moreover, a discussion about the connection between random matrix t…
Feynman's prescription for a quantum simulator was to find a hamitonian for a system that could serve as a computer. Pólya and Hilbert conjecture was to demonstrate Riemann's hypothesis through the spectral decomposition of hermitian operators. Here we study the problem of decomposing a number into its prime factors, $N=xy$, using such a simulator. First, we derive the hamiltonian of the physical system that simulate a new arithmetic function, formulated for the factorization problem, that represents the energy of the computer. This function rests alone on the primes below $\sqrt N$. We exactl…
In this article we develop an algorithm which computes a divisor of an integer $N$, which is assumed to be neither prime nor the power of a prime. The algorithm uses discrete time heat diffusion on a finite graph. If $N$ has $m$ distinct prime factors, then the probability that our algorithm runs successfully is at least $p(m) = 1-(m+1)/2^{m}$. We compute the computational complexity of the algorithm in terms of classical, or digital, steps and in terms of diffusion steps, which is a concept that we define here. As we will discuss below, we assert that a diffusion step can and should be consid…
