Related papers: Factoring integers with Young's N-slit interferome…
Almost all public secure communication relies on the inability to factor large numbers. There is no known analytic or classical numeric method to rapidly factor large numbers. Shor[1] has shown that a quantum computer can factor numbers in…
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…
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…
We report a quantum eraser experiment which actually uses a Young double-slit to create interference. The experiment can be considered an optical analogy of an experiment proposed by Scully, Englert and Walther. One photon of an entangled…
A common starting point of traditional quantum algorithm design is the notion of a universal quantum computer with a scalable number of qubits. This convenient abstraction mirrors classical computations manipulating finite sets of symbols,…
Building on techniques recently introduced by the second author, and further developed by the first author, we show that a positive integer $N$ may be rigorously and deterministically factored into primes in at most \[ O\left( \frac{N^{1/5}…
Feynman's prescription for a quantum simulator was to find a hamitonian for a system that could serve as a computer. P\'olya and Hilbert conjecture was to demonstrate Riemann's hypothesis through the spectral decomposition of hermitian…
Current asymmetric cryptography is based on the principle that while classical computers can efficiently multiply large integers, the inverse operation, factorization, is significantly more complex. For sufficiently large integers, this…
The problem of factorising positive integer $N$ into two integer factors $x$ and $y$ is first reformulated as an optimisation problem over the positive integer domain of either of the Diophantine polynomials $Q_N(x,y)=N^2(N-xy)^2 +…
We give a geometric approach to integer factorization. This approach is based on special approximations of segments of the curve that is represented by $y=n/x$, where $n$ is the integer whose factorization we need.
We propose an alternative method to factorize an integer by using three harmonic oscillators. These oscillators are coupled together via specific Kerr nonlinear interactions. This method can be applied even if two harmonic oscillators are…
We investigate the problem of factorization of large numbers on a quantum computer which we imagine to be realized within a linear ion trap. We derive upper bounds on the size of the numbers that can be factorized on such a quantum…
The task of factoring integers poses a significant challenge in modern cryptography, and quantum computing holds the potential to efficiently address this problem compared to classical algorithms. Thus, it is crucial to develop quantum…
Higher-point functions in N = 4 super Yang-Mills theory can be constructed using integrability by triangulating the surfaces on which Feynman graphs would be drawn. It remains hard to analytically compute the necessary re-gluing of the…
Quantum interferometry uses quantum resources to improve phase estimation with respect to classical methods. Here we propose and theoretically investigate a new quantum interferometric scheme based on three-dimensional waveguide devices.…
Classical, interferometric, optical lithography is diffraction limited to writing features of a size lambda/2 or greater, where lambda is the optical wavelength. Using nonclassical photon number states, entangled N at a time, we show that…
A positive integer $n$ is called practical if all integers between $1$ and $n$ can be written as a sum of distinct divisors of $n$. We give an asymptotic estimate for the number of integers $\le x$ which have a practical divisor $\ge y$.
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. In effect, they follow the same logical paradigm as (multi-particle)…
A quantum computer is a multi-particle interferometer that comprises beam splitters at both ends and arms, where the n two-level particles undergo the interactions among them. The arms are designed so that relevant functions required to…
The quantum Fourier transform (QFT) has been implemented on a three bit nuclear magnetic resonance (NMR) quantum computer, providing a first step towards the realization of Shor's factoring and other quantum algorithms. Implementation of…