Using quantum computers to identify prime numbers via entanglement dynamics
arXiv:2403.14703 · doi:10.1103/PhysRevA.110.022405
Abstract
Recently, the entanglement dynamics of two harmonic oscillators initially prepared in a separable-coherent state was demonstrated to offer a pathway for prime number identification. This article presents a generalized approach and outlines a deterministic algorithm making possible the implementation of this theoretical concept on scalable fault-tolerant qubit-based quantum computers. We prove that the diagonal unitary operations employed in our algorithm exhibit a polynomial-time complexity of degree two, contrasting with the previously reported exponential complexity of general diagonal unitaries.
References in corpus (15)
- Concentrating Partial Entanglement by Local Operations
- Quantum fingerprinting
- Robustness of entanglement
- Direct estimations of linear and non-linear functionals of a quantum state
- Universal Quantum Estimator
- Physics of the Riemann Hypothesis
- Efficient Quantum Circuits for Diagonal Unitaries Without Ancillas
- Landau levels and Riemann zeros
- Will a physicist prove the Riemann Hypothesis?
- Entanglement Monotones from Complementarity Relations
- Computing partial traces and reduced density matrices
- Prime Suspects in a Quantum Ladder
- Strengthening the Baillie-PSW primality test
- The Prime state and its quantum relatives
- Identifying primes from entanglement dynamics