Related papers: A proposal for factorization using Kerr nonlineari…
Using three coupled harmonic oscillators, we present an amplitude-amplification method for factorization of an integer. We generalize the method in [arXiv:1007.4338] by employing non-orthogonal measurements on the harmonic oscillator. This…
A scheme to encode arbitrarily long integer pairs on degenerate optical parametric oscillations multiplexed in time is proposed. The classical entanglement between the polarization directions and the phases of the oscillating pulses,…
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…
The number of steps any classical computer requires in order to find the prime factors of an $l$-digit integer $N$ increases exponentially with $l$, at least using algorithms known at present. Factoring large integers is therefore…
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…
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…
Several physics-based algorithms for factorizing large number were recently published. A notable recent one by Schleich et al. uses Gauss sums for distinguishing between factors and non-factors. We demonstrate two NMR techniques that…
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…
High-order methods gain more and more attention in computational fluid dynamics. However, the potential advantage of these methods depends critically on the availability of efficient elliptic solvers. With spectral-element methods, static…
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,…
We apply the Dirac factorization method to the nonrelativistic harmonic oscillator and, more in general, to Hamiltonians with a generic potential. It is shown that this procedure naturally leads to a supersymmetric formulation of the…
Factorization of numbers with the help of Gauss sums relies on an intimate relationship between the maxima of these functions and the factors. Indeed, when we restrict ourselves to integer arguments of the Gauss sum we profit from a…
We propose an alternative approach that avoids the nonlinear equations for the Fourier coefficients that appear in the method of harmonic balance. We apply it to two simple illustrative examples.
We introduce a versatile numerical method for modeling light diffraction in periodically patterned photonic structures containing quadratically nonlinear non-centrosymmetric optical materials. Our approach extends the generalized source…
We propose a semiclassical version of Shor's quantum algorithm to factorize integer numbers, based on spin-1/2 SU(2) generalized coherent states. Surprisingly, we find evidences that the algorithm's success probability is not too severely…
We consider the numerical integration of the Gross-Pitaevskii equation with a potential trap given by a time-dependent harmonic potential or a small perturbation thereof. Splitting methods are frequently used with Fourier techniques since…
Three methods: complexifier, factorization and deformation, for construction of coherent states are presented for one dimensional nonlinear harmonic oscillator (1D NLHO). Since by exploring the Jacobi polynomials $P_n^{a,b}$'s, bridging the…
The applicability of the factorization method is extended to the case of quantum fractional-differential Hamiltonians. In contrast with the conventional factorization, it is shown that the `factorization energy' is now a…
A generalization of the factorization technique is shown to be a powerful algebraic tool to discover further properties of a class of integrable systems in Quantum Mechanics. The method is applied in the study of radial oscillator, Morse…
We propose two algorithms to factor numbers using Gauss sums and entanglement: (i) in a Shor-like algorithm we encode the standard Gauss sum in one of two entangled states and (ii) in an interference algorithm we create a superposition of…