Achieving quantum advantage in a search for a violations of the Goldbach conjecture, with driven atoms in tailored potentials
Oleksandr V. Marchukov, Andrea Trombettoni, Giuseppe Mussardo, and Maxim Olshanii

TL;DR
This paper proposes a quantum device utilizing Grover's search algorithm to efficiently find Goldbach partitions for even numbers, demonstrating a quantum advantage in number theory problems involving prime decompositions.
Contribution
It introduces a quantum analogue device that applies Grover's search to identify Goldbach partitions, achieving a quadratic speedup over classical methods.
Findings
Successfully identified Goldbach partitions for large even numbers.
Demonstrated a quantum advantage with a √N speedup in search efficiency.
Numerical example with 51 even numbers above previous computational limits.
Abstract
The famous Goldbach conjecture states that any even natural number greater than can be written as the sum of two prime numbers and . In this article we propose a quantum analogue device that solves the following problem: given a small prime , identify a member of a -strong set even numbers for which is also a prime. A table of suitable large primes is assumed to be known a priori. The device realizes the Grover quantum search protocol and as such ensures a quantum advantage. Our numerical example involves a set of 51 even numbers just above the highest even classical-numerically explored so far [T. O. e Silva, S. Herzog, and S. Pardi, Mathematics of Computation {\bf 83}, 2033 (2013)]. For a given small prime number , it took our quantum…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNuclear physics research studies
