Identifying primes from entanglement dynamics
arXiv:2303.10157 · doi:10.1103/PhysRevA.108.042404
Abstract
Factorization is the most fundamental way to determine if a number is prime or composite. Yet, this approach becomes impracticable when considering large values of , a difficulty that is exploited by cryptographic protocols. We propose an alternative method to decide the primality of a natural number, that is based on the analysis of the evolution of the linear entanglement entropy. Specifically, we show that a singular behavior in the amplitudes of the Fourier series of this entropy is associated with prime numbers. We also discuss how this idea could be experimentally implemented and examine possible connections between our results and the zeros of the Riemann zeta function.
arXiv comment5 pages, 3 figures
References in corpus (17)
- Freezing Transition, Characteristic Polynomials of Random Matrices, and the Riemann Zeta-Function
- Physics of the Riemann Hypothesis
- Hamiltonian for the zeros of the Riemann zeta function
- The H=xp model revisited and the Riemann zeros
- Landau levels and Riemann zeros
- Quantum mechanical potentials related to the prime numbers and Riemann zeros
- Nearest neighbor spacing distribution of prime numbers and quantum chaos
- Will a physicist prove the Riemann Hypothesis?
- Prime Suspects in a Quantum Ladder
- The Berry-Keating Hamiltonian and the Local Riemann Hypothesis
- General covariant xp models and the Riemann zeros
- Identifying the Riemann zeros by periodically driving a single qubit
- The Prime state and its quantum relatives
- Prime Factorization of Arbitrary Integers with a Logarithmic Energy Spectrum
- Quantum thermodynamic fluctuations of a chaotic Fermi-gas model
- Quantum graphs whose spectra mimic the zeros of the Riemann zeta function
- Quantum simulation of the integer factorization problem: Bell states in a Penning trap