Related papers: Identifying primes from entanglement dynamics
In this work, we address the numerical identification of entanglement in dynamical scenarios. To this end, we consider different programs based on the restriction of the evolution to the set of separable (i.e., non-entangled) states,…
We argue that in the case of identical particles the most natural identification of separability, that is of absence of non-classical correlations, is via the factorization of mean values of commuting observables. It thus follows that…
Studying the factorization theory of numerical monoids relies on understanding several important factorization invariants, including length sets, delta sets, and $\omega$-primality. While progress in this field has been accelerated by the…
Let f(t) be a rational function of degree at least 2 with rational coefficients. For a given rational number x_0, define x_{n+1}=f(x_n) for each nonnegative integer n. If this sequence is not eventually periodic, then the difference…
We introduce the concept of entanglement features of unitary gates, as a collection of exponentiated entanglement entropies over all bipartitions of input and output channels. We obtained the general formula for time-dependent $n$th-Renyi…
Entanglement has been termed a critical resource for quantum information processing and is thought to be the reason that certain quantum algorithms, such as Shor's factoring algorithm, can achieve exponentially better performance than their…
The unitary evolution can be represented by a finite product of exponential operators. It leads to a perturbative expression of the density operator of a close system. Based on the perturbative expression scheme, we present a entanglement…
In this paper it has been described how to use the unitary dynamics of quantum mechanics to solve the prime factorization problem on a spin ensemble without any quantum entanglement. The ensemble quantum computation for the prime…
We relate the entropy of entanglement of ensembles of random vectors to their generalized fractal dimensions. Expanding the von Neumann entropy around its maximum we show that the first order only depends on the participation ratio, while…
Hittmeir recently presented a deterministic algorithm that provably computes the prime factorisation of a positive integer $N$ in $N^{2/9+o(1)}$ bit operations. Prior to this breakthrough, the best known complexity bound for this problem…
We present the pattern underlying some of the properties of natural numbers, using the framework of complex networks. The network used is a divisibility network in which each node has a fixed identity as one of the natural numbers and the…
We introduce a framework for the study of multiparty entanglement by analyzing the behavior of collective variables. Throughout the manuscript, we explore a specific type of multiparty entanglement which can be detected through the…
In 2011, Anderson and Frazier define the concept of $\tau_{(n)}$-factorization, where $\tau_{(n)}$ is a restriction of the modulo $n$ equivalence relation. These relations have been worked mostly for small values of $n$. However, it is…
Entanglement is the key feature of many-body quantum systems, and the development of new tools to probe it in the laboratory is an outstanding challenge. Measuring the entropy of different partitions of a quantum system provides a way to…
I develop a function that, for any integer $n \geq 2$, takes a value of 1 if $n$ is prime, 0 if $n$ is composite. I also discuss two applications: First, the characteristic function provides a new expression for the prime counting function.…
We adopt a physically motivated empirical approach to the characterisation of the distributions of twin and triplet primes within the set of primes, rather than in the set of all natural numbers. Remarkably, the occurrences of twins or…
We investigate some extremal problems in Fourier analysis and their connection to a problem in prime number theory. In particular, we improve the current bounds for the largest possible gap between consecutive primes assuming the Riemann…
This is a paper in the intersection of time series analysis and complexity theory that presents new results on permutation complexity in general and permutation entropy in particular. In this context, permutation complexity refers to the…
In this paper we present the experimental results that more clearly than any theory suggest an answer to the question: when in detection of large (probably) prime numbers to apply, a very resource demanding, Miller-Rabin algorithm. Or, to…
The order and disorder of binary representations of the natural numbers < 2^8 is measured using the BiEntropy function. Significant differences are detected between the primes and the non primes. The BiEntropic prime density is shown to be…