Related papers: Factoring integers with Young's N-slit interferome…
This paper presents a computer program, written in Maple, that allows a user to simulate certain aspects of Shor's quantum factoring algorithm on a desktop or laptop computer. The program does not simulate the unitary operations carried out…
In presence of dissipation, quantal states may acquire complex-valued phase effects. We suggest a notion of dissipative interferometry that accommodates this complex-valued structure and that may serve as a tool for analyzing the effect of…
The analysis of papers on usage NMR in quantum computations is provided and the probable direction of the future investigations are considered.
Quantum noise limits the sensitivity of interferometric measurements. It is generally admitted that it leads to an ultimate sensitivity, the ``standard quantum limit''. Using a semi-classical analysis of quantum noise, we show that a…
We report an experimental demonstration of a complied version of Shor's algorithm using four photonic qubits. We choose the simplest instance of this algorithm, that is, factorization of N=15 in the case that the period $r=2$ and exploit a…
Multi-port beamsplitters are cornerstone devices for high-dimensional quantum information tasks, which can outperform the two-dimensional ones. Nonetheless, the fabrication of such devices has been proven to be challenging with progress…
We propose, experimentally realize and study possible applications of a new type of logic element: random flip-flop. By definition it operates similarly to a conventional flip-flop except that it functions with probability of 1/2 otherwise…
We consider a probabilistic quantum implementation of a variable of the Pocklington-Lehmer $N-1$ primality test using Shor's algorithm. O($\log^3 N \log\log N \log\log\log N$) elementary q-bit operations are required to determine the…
Quantum theory of interference phenomena does not take the diameter of the particle into account, since particles were much smaller than the width of the slits in early observations. In recent experiments with large molecules, the diameter…
Simplification of fractional powers of positive rational numbers and of sums, products and powers of such numbers is taught in beginning algebra. Such numbers can often be expressed in many ways, as this article discusses in some detail.…
Quantum annealing leverages the properties of interacting quantum spin systems to solve computational problems, typically optimisation problems. Current hardware now has capabilities that can be used to solve condensed matter physics…
We devise a multiphoton interferometry scheme for sampling a quadratic function of a specific immanant for any submatrix of a unitary matrix and its row permutations. The full unitary matrix describes a passive, linear interferometer, and…
The interference pattern produced by a quantum particle in Young's double-slit setup is attributed to the particle's wavefunction having gone through both slits. In the path integral formulation, this interference involves a superposition…
We factorize a 48-bit integer using 10 trapped-ion qubits on a Quantinuum's quantum computer. This result outperforms the recent achievement by B. Yan et al., arXiv:2212.12372 (2022), increasing the success probability by a factor of 6 with…
We investigate the application of efficient recursive numerical integration strategies to models in lattice gauge theory from quantum field theory. Given the coupling structure of the physics problems and the group structure within lattice…
Quantum computers can theoretically have significant acceleration over classical computers; but, the near-future era of quantum computing is limited due to small number of qubits that are also error prone. Quilt is a framework for…
We present reversible classical circuits for performing various arithmetic operations aided by dirty ancillae (i.e. extra qubits in an unknown state that must be restored before the circuit ends). We improve the number of clean qubits…
In this paper, we introduce a novel quantum algorithm for the factorization of composite odd numbers. This work makes two significant contributions. First, we present a new improvement to the classical Fermat method, fourfold reducing the…
We investigate the time T a quantum computer requires to factorize a given number dependent on the number of bits L required to represent this number. We stress the fact that in most cases one has to take into account that the execution…
The Quantum Fourier Transform (QFT) is a fundamental component of many quantum computing algorithms. In this paper, we present an alternative method for factoring this transformation. Inspired by this approach, we introduce a new quantum…