Related papers: Factoring integers with Young's N-slit interferome…
Young's double slit experiment is formulated in the framework of canonical quantum field theory in view of the modern quantum optics. We adopt quantum scalar fields instead of quantum electromagnetic fields ignoring the vector freedom in…
Quantum phenomena such as entanglement can improve fundamental limits on the sensitivity of a measurement probe. In optical interferometry, a probe consisting of $N$ entangled photons provides up to a $\sqrt{N}$ enhancement in phase…
We use a fiber based double slit Young interferometer for studying the far-field spatial distribution of the two-photon coincidence rate (coincidence pattern) for various quantum states with different degree of spatial entanglement. The…
Spatial interference of quantum mechanical particles exhibits a fundamental feature of quantum mechanics. A two-mode entangled state of N particles known as N00N state can give rise to non-classical interference. We report the first…
Photon indistinguishability plays a fundamental role in information processing, with applications such as linear-optical quantum computation and metrology. It is then necessary to develop appropriate tools to quantify the amount of this…
Quantum computers allow for direct simulation of the quantum interference and entanglement used in modern interferometry experiments with applications ranging from biological sensing to gravitational wave detection. Inspired by recent…
Is there any hope for quantum computing to challenge the Turing barrier, i.e. to solve an undecidable problem, to compute an uncomputable function? According to Feynman's '82 argument, the answer is {\it negative}. This paper re-opens the…
Motivated by recent proposals for quantum proof of work protocols, we investigate approaches for simulating linear optical interferometers using digital quantum circuits. We focus on a second quantisation approach, where the quantum…
The interference of single photons going through a double slit is a compelling demonstration of the wave and particle nature of light in the same experiment. Single photons produced by spontaneous parametric down-conversion can be used for…
Quantum processors are potentially superior to their classical counterparts for many computational tasks including factorization. Circuit methods as well as adiabatic methods have already been proposed and implemented for finding the…
This work is a tutorial on Shor's factoring algorithm by means of a worked out example. Some basic concepts of Quantum Mechanics and quantum circuits are reviewed. It is intended for non-specialists which have basic knowledge on…
We present fast and highly parallelized versions of Shor's algorithm. With a sizable quantum computer it would then be possible to factor numbers with millions of digits. The main algorithm presented here uses FFT-based fast integer…
This paper presents the concept of digit polynomials, which leads to a deterministic and unconditional integer factorization algorithm with the runtime complexity $\mathcal{O}(N^{1/4+\epsilon})$. Strassen's well known factoring approach is…
Traditional computers work with finite numbers. Situations where the usage of infinite or infinitesimal quantities is required are studied mainly theoretically. In this paper, a recently introduced computational methodology (that is not…
In this paper, we present an approach to integer factorization using distributed representations formed with Vector Symbolic Architectures. The approach formulates integer factorization in a manner such that it can be solved using neural…
The Quantum Fourier Transform offers an interesting way to perform arithmetic operations on a quantum computer. We review existing Quantum Fourier Transform adders and multipliers and propose some modifications that extend their…
This note introduces a new class of integer factoring algorithms. Two versions of this method will be described, deterministic and probabilistic. These algorithms are practical, and can factor large classes of balanced integers N = pq, p <…
We report on progress toward computing a four-loop supersymmetric form factor in maximally supersymmetric Yang-Mills theory. A representative example particle content from the involved supermultiplets is a stress-tensor operator with two…
Quantum integer factorization is a potential quantum computing solution that may revolutionize cryptography. Nevertheless, a scalable and efficient quantum algorithm for noisy intermediate-scale quantum computers looks far-fetched. We…
There has been no lack of coverage in the past few years in scientific journals of the topic of quantum computation. Rightly so, as this is a novel idea with--so far--at least one very important practical application (prime factorisation)…