Related papers: Factoring integers with Young's N-slit interferome…
Quantum computational algorithms exploit quantum mechanics to solve problems exponentially faster than the best classical algorithms. Shor's quantum algorithm for fast number factoring is a key example and the prime motivator in the…
I describe the use of NMR experiments which implement Gauss sums as a method for factoring numbers and discuss whether this approach can be computationally useful.
Determining whether a given integer is prime or composite is a basic task in number theory. We present a primality test based on quantum order finding and the converse of Fermat's theorem. For an integer $N$, the test tries to find an…
In this note, we represent integers in a type of factoradic notation. Rather than use the corresponding Lehmer code, we will view integers as permutations. Given a pair of integers n and k, we give a formula for n mod k in terms of the…
Shor's algorithms for factorization and discrete logarithms on a quantum computer employ Fourier transforms preceding a final measurement. It is shown that such a Fourier transform can be carried out in a semi-classical way in which a…
Diffraction on the slit can be interpreted in accordance with the Heisenberg uncertainty principle. This elementary example hints at the importance of the information theory for the quantum physics. The role played by one particularly…
Advancements in physics are often motivated/accompanied by advancements in our precision measurements abilities. The current generation of atomic and optical interferometers is limited by shot noise, a fundamental limit when estimating a…
We present an architecture to investigate wave-particle duality in $N$-path interferometers on a universal quantum computer involving as low as $2\log N$ qubits and develop a measurement scheme which allows the efficient extraction of…
Quantum computers hold promise to enable efficient simulations of the properties of molecules and materials; however, at present they only permit ab initio calculations of a few atoms, due to a limited number of qubits. In order to harness…
Shor's algorithm for factoring in polynomial time on a quantum computer\cite{Shor} gives an enormous advantage over all known classical factoring algorithm. We demonstrate how to factor products of large prime numbers using a compiled…
The using of quantum parallelism is often connected with consideration of quantum system with huge dimension of space of states. The n-qubit register can be described by complex vector with 2^n components (it belongs to n'th tensor power of…
Truncated Fourier, Gauss, Kummer and exponential sums can be used to factorize numbers: for a factor these sums equal unity in absolute value, whereas they nearly vanish for any other number. We show how this factorization algorithm can…
Quantum Fourier transform (QFT) is a key function to realize quantum computers. A QFT followed by measurement was demonstrated on a simple circuit based on fiber-optics. The QFT was shown to be robust against imperfections in the rotation…
We consider a classical analogue of the well known quantum two-slit experiment. Charged particles are scattered on flat screen with two slits and hit the second screen. We show that the probability distribution on the second screen when…
Nuclear magnetic resonance offers an appealing prospect for implementation of quantum computers, because of the long coherence times associated with nuclear spins, and extensive laboratory experience in manipulating the spins with radio…
The assumed computationally difficulty of factoring large integers forms the basis of security for RSA public-key cryptography, which specifically relies on products of two large primes or semi-primes. The best-known factoring algorithms…
There have been several efforts to apply quantum SAT solving methods to factor large integers. While these methods may provide insight into quantum SAT solving, to date they have not led to a convincing path to integer factorization that is…
Let $n = \mathrm{p}\!\cdot\!\mathrm{q}$ (p < q) and $\Delta = \lvert p-q \rvert$, where p,q are odd integers, then, it is hypothesized that factorizing this composite n will take O(1) time once the steady state value is reached for any…
We recognize quantum circuit model of computation as factorisable scattering model and propose that a quantum computer is associated with a quantum many-body system solved by the Bethe ansatz. As an typical example to support our…
We confirm by explicit computation the conjectured all-orders iteration of planar maximally supersymmetric N=4 Yang-Mills theory in the nontrivial case of five-point two-loop amplitudes. We compute the required unitarity cuts of the…