ﻻ يوجد ملخص باللغة العربية
Finding the factors of an integer can be achieved by various experimental techniques, based on an algorithm developed by Schleich et al., which uses specific properties of Gauss{}sums. Experimental limitations usually require truncation of these series, but if the truncation parameter is too small, it is no longer possible to distinguish between factors and so-called ghost factors. Here, we discuss two techniques for distinguishing between true factors and ghost factors while keeping the number of terms in the sum constant or only slowly increasing. We experimentally test these modified algorithms in a nuclear spin system, using NMR.
We construct an analog computer based on light interference to encode the hyperbolic function f({zeta}) = 1/{zeta} into a sequence of skewed curlicue functions. The resulting interferogram when scaled appropriately allows us to find the prime number
We study the theory of linearly chirped biphoton wave-packets produced in two basic quasi-phase-matching configurations: chirped photonic-like crystals and aperiodically poled crystals. The novelty is that these structures are considered as definite
In this paper, we will describe a new factorization algorithm based on the continuous representation of Gauss sums, generalizable to orders j>2. Such an algorithm allows one, for the first time, to find all the factors of a number N in a single run w
The definitions of the $n^{th}$ Gauss sum and the associated $n^{th}$ central charge are introduced for premodular categories $mathcal{C}$ and $ninmathbb{Z}$. We first derive an expression of the $n^{th}$ Gauss sum of a modular category $mathcal{C}$,
We report a study of the Majorana geometrical representation of a qutrit, where a pair of points on a unit sphere represents its quantum states. A canonical form for qutrit states is presented, where every state can be obtained from a one-parameter f