Quantum Counting in the Rydberg Blockade

TL;DR

This paper introduces a quantum algorithm leveraging Rydberg blockade to approximately count solutions of planar 2SAT formulas on neutral atom quantum computers, enabling efficient solution estimation.

Contribution

It presents a novel quantum counting method using Rydberg atom dynamics to solve #P-complete problems on neutral atom quantum hardware.

Findings

Numerical simulations show near-uniform solution sampling in 1D and 2D grids.

The protocol accurately estimates solution counts for 2SAT instances on punctured grids.

The method is promising as a heuristic for complex combinatorial problems.

Abstract

We propose a quantum algorithm for approximately counting the number of solutions to planar 2-satisfiability (2SAT) formulas natively on neutral atom quantum computers. Our algorithm maps Boolean variables to atomic registers arranged in space according to a given formula, so that 2SAT constraints are enforced via the Rydberg blockade between neighboring atoms. A quench under Rydberg dynamics of an initial computational basis state produces a superposition of all solutions after a sufficiently long evolution. For almost uniform superpositions, a polynomial number of measurements is enough to estimate the solution count up to any constant multiplicative factor via sampling based counting. We demonstrate numerically that this protocol leads to almost uniform solution sampling in 1D and 2D grids and that it produces accurate counts for 2SAT instances on punctured grids, suggesting its general applicability as a heuristic for #P-complete problems.