Related papers: A proposal for factorization using Kerr nonlineari…
A theoretical framework for non-negative matrix factorization based on generalized dual Kullback-Leibler divergence, which includes members of the exponential family of models, is proposed. A family of algorithms is developed using this…
We propose an alternative factorization for the simple harmonic oscillator hamiltonian which includes Mielnik's isospectral factorization as a particular case. This factorization is realized in two non-mutually adjoint operators whose…
We present three methods for calculating the Feynman propagator for the non-relativistic harmonic oscillator. The first method was employed by Schwinger a half a century ago, but has rarely been used in non-relativistic problems since. Also…
The factorization and resummation approach of Nagar and Shah~[Phys.~Rev.~D~94 (2016), 104017], designed to improve the strong-field behavior of the post-Newtonian (PN) residual waveform amplitudes $f_{\ell m}$'s entering the…
We discuss a model comprising two coupled nonlinear oscillators (Kerr-like nonlinear coupler) with one of them pumped by an external coherent excitation. Applying the method of nonlinear quantum scissors we show that the quantum evolution…
We give algorithms to factorize large integers in the duality computer. We provide three duality algorithms for factorization based on a naive factorization method, the Shor algorithm in quantum computing, and the Fermat's method in…
This article analysis differential equations which represents damped and fractional oscillators. First, it is shown that prior to using physical quantities in fractional calculus, it is imperative that they are turned dimensionless.…
The task of factoring integers poses a significant challenge in modern cryptography, and quantum computing holds the potential to efficiently address this problem compared to classical algorithms. Thus, it is crucial to develop quantum…
We compute three-loop corrections of $\mathcal{O}(\alpha_{s}^3)$ to form factors with one massive and one massless quark coupling to an external vector, axialvector, scalar, pseudoscalar, or tensor current. We obtain analytic results for…
We propose a method to factor numbers based on two interacting bosonic atoms in a central potential where the single-particle spectrum depends logarithmically on the radial quantum numbers of the zero angular momentum states. The bosons…
This article generalizes a recently introduced procedure to solve nonlinear systems of equations, radically departing from the conventional Newton-Raphson scheme. The original nonlinear system is first unfolded into three simpler…
Nambu's construction of multi-linear brackets for super-integrable systems can be thought of as degenerate Poisson brackets with a maximal set of Casimirs in their kernel. By introducing privileged coordinates in phase space these…
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…
A method of determining two factors of an odd integer without need of multiplication or division operation in iterative portion of computation is presented. It is feasible for an implementing algorithm to use only integer addition and…
The Phononic Casimir effect between planar objects is investigated by deriving a formalism from the quantum partition function of the system following multiscattering approach. This fluctuation-induced coupling is mediated by phonons…
The best deterministic unconditionally proven integer factorization algorithms have exponential running time complexities of O(N^(1/4)) arithmetic operations, and conditional on the Riemann hypothesis, there is a deterministic algorithm of…
Current asymmetric cryptography is based on the principle that while classical computers can efficiently multiply large integers, the inverse operation, factorization, is significantly more complex. For sufficiently large integers, this…
Fault tolerant quantum simulation via the phase estimation algorithm and qubitization has a T-gate count that scales proportionally to the 1-norm of the Hamiltonian, the cost of block encoding the Hamiltonian, and inversely proportionally…
We determine the kind of parametric oscillators that are generated in the usual factorization procedure of second-order linear differential equations when one introduces a constant shift of the Riccati solution of the classical harmonic…
Shor's factoring algorithm illustrates the potential power of quantum computation. Here we present and numerically investigate a proposal for a compiled version of such an algorithm based on a quantum-wire network exploiting the…