Related papers: A proposal for factorization using Kerr nonlineari…
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…
Introducing a Kerr medium in a cavity coupled to a harmonically moving mirror, we reproduce known and solvable interactions such as two-coupled harmonic oscillators and ion-laser like interactions for specific conditions. This is achieved…
We use Maxwell's equations to derive several models describing the interaction of the multi-mode fundamental field and its second harmonic in a ring microresonator with quadratic nonlinearity and quasi-phase-matching. We demonstrate how…
Tensor factorization arises in many machine learning applications, such knowledge base modeling and parameter estimation in latent variable models. However, numerical methods for tensor factorization have not reached the level of maturity…
We study optical parametric oscillations in Kerr-nonlinear microresonators, revealing an intricate solution space -- parameterized by the pump-to-signal conversion efficiency -- that arises from an interplay of nonlinear processes. Using a…
In this work, we develop a new fast algorithm, spaQR -- sparsified QR, for solving large, sparse linear systems. The key to our approach is using low-rank approximations to sparsify the separators in a Nested Dissection based Householder QR…
Higher order calculations in perturbative Quantum Field Theories often produce coupled linear systems of differential equations which factorize to first order. Here we present an algorithm to solve such systems in terms of iterated…
The numerical evaluation of integrals of the form \begin{align*} \int_a^b f(x) e^{ikg(x)}\,dx \end{align*} is an important problem in scientific computing with significant applications in many branches of applied mathematics, science and…
We present a general method for analytically factorizing the n-fold form factor integrals $f^{(n)}_{N,N}(t)$ for the correlation functions of the Ising model on the diagonal in terms of the hypergeometric functions…
The road to computing on quantum devices has been accelerated by the promises that come from using Shor's algorithm to reduce the complexity of prime factorization. However, this promise hast not yet been realized due to noisy qubits and…
In a previous study, we have discovered that nonlinear processes can be enhanced several orders of magnitude due to the path interference effects which are introduced by Fano resonances. Emergence of this phenomenon has been demonstrated…
Multidimensional factorization method is formulated in arbitrary curvilinear coordinates. Particular cases of polar and spherical coordinates are considered and matrix potentials with separating variables are constructed. A new class of…
Phase shifts induced by the Kerr effect are usually very small at the single-photon level. We propose two circuits for enhancing the cross-Kerr phase shift by applying one- and two-mode quadrature squeezing operators. Our results are based…
In this paper, we discuss a systematic and self consistent procedure to factorize a rather general class of coupled nonlinear ordinary differential equations (ODEs), namely coupled quadratic and mixed Li\'enard type equations, which include…
A practical and simple stable method for calculating Fourier integrals is proposed, effective both at low and at high frequencies. An approach based on the fruitful idea of Levin, to use of the collocation method to approximate the slowly…
We derive new formulas for the number of unordered (distinct) factorizations with $k$ parts of a positive integer $n$ as sums over the partitions of $k$ and an auxiliary function, the number of partitions of the prime exponents of $n$,…
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 offer multiplication method for factoring big natural numbers which extends the group of the Fermat's and Lehman's factorization algorithms and has run-time complexity $O(n^{1/3})$. This paper is argued the finiteness of proposed…
This work aims to provide an alternative approach to modeling a two-state system (qubit) coupled to a nonlinear oscillator. Within a single algebraic scheme based upon the f-deformed oscillator description, hard and soft nonlinearities are…
Many combinatorial optimization problems can be mapped to finding the ground states of the corresponding Ising Hamiltonians. The physical systems that can solve optimization problems in this way, namely Ising machines, have been attracting…