Related papers: Identifying primes from entanglement dynamics
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…
Entanglement in multipartite systems is a key resource for quantum information and communication protocols, making its verification in complex systems a necessity. Because an exact calculation of arbitrary entanglement probes is impossible,…
In this article, we investigate a unique prime factorization property for infinite tensor product factors. We provide several examples of type II and III factors which satisfy this property, including all free product factors with diffuse…
Translation from the Latin original "Utrum hic numerus 1000009 sit primus necne inquiritur" (1778). E699 in the Enestrom index. The idea of this paper is that if some number is a sum of two squares in two ways, then some other smaller…
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 studied two probabilistic models of the distribution of primes in the natural number [1].The paper considers the third probabilistic model of the distribution of primes in the natural number. The author proved that the results obtained…
We analyze the dynamical generation of entanglement in systems of two interacting spins initially prepared in a product of spin coherent states. For arbitrary time-independent Hamiltonians, we derive a semiclassical expression for the…
The results of the study provide guidelines for the development and applications of algorithms. When the number of steps for calculating an assumption tends to infinity, probability theory can be applied to predict whether the assumption…
A quantum state's entanglement across a bipartite cut can be quantified with entanglement entropy or, more generally, Schmidt norms. Using only Schmidt decompositions, we present a simple iterative algorithm to maximize Schmidt norms.…
We pose 100 new conjectures on representations involving primes or related things, which might interest number theorists and stimulate further research. Below are five typical examples: (i) For any positive integer $n$, there exists…
In this article, we give evidence that computing Fourier coefficients of the Hecke eigenforms for composite indices is no easier than factoring integers. In particular, we show that the existence of a polynomial time algorithm that, given…
The prime-counting function $\pi(x)$ which returns the number of primes smaller or equal to a given number is a topic of interest in number theory. An algorithm based on a cyclic group isomorphic to $Z/nZ$, the so-called $Z$-functions, was…
The entanglement content of high-dimensional random pure states is almost maximal, nevertheless, we show that, due to the complexity of such states, the detection of their entanglement using witness operators is rather difficult. We discuss…
This paper presents a novel primality test based on the eigenvalue structure of circulant matrices constructed from roots of unity. We prove that an integer $n > 2$ is prime if and only if the minimal polynomial of the circulant matrix $C_n…
We encode the sequence of prime numbers into simple superpositions of identical waves, mimicking the archetypal prime number sieve of Eratosthenes. The primes are identified as zeros accompanied by phase singularities in a physically…
In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…
To test a possible relation between the topological entropy and the Arnold complexity, and to provide a non trivial example of a rational dynamical zeta function, we introduce a two-parameter family of two-dimensional discrete rational…
Quantum entanglement is an essential resource for quantum science and technology. However, entanglement detection and quantification, via typical entanglement measures such as linear entanglement entropy or negativity, can be a very…
The rich history of prime numbers includes great names such as Euclid, who first analytically studied the prime numbers and proved that there is an infinite number of them, Euler, who introduced the function $\zeta(s)\equiv\sum_{n=1}^\infty…
We present an algorithm for computing the prime factorisation of a knot, which is practical in the following sense: using Regina, we give an implementation that works well for inputs of reasonable size, including prime knots from the…