
Rydberg blockade based parity quantum optimization
Martin Lanthaler,1, ∗Clemens Dlaska,1, ∗Kilian Ender,1, 2 and Wolfgang Lechner1, 2
1Institute for Theoretical Physics, University of Innsbruck, A-6020 Innsbruck, Austria
2Parity Quantum Computing GmbH, A-6020 Innsbruck, Austria
We present a scalable architecture for solving higher-order constrained binary optimization prob-
lems on current neutral-atom hardware operating in the Rydberg blockade regime. In particular,
we formulate the recently developed parity encoding of arbitrary connected higher-order optimiza-
tion problems as a maximum-weight independent set (MWIS) problem on disk graphs, that are
directly encodable on such devices. Our architecture builds from small MWIS modules in a problem-
independent way, crucial for practical scalability.
Introduction.— With the recent advances in experi-
ments, programmable arrays of Rydberg atoms have be-
come a versatile platform for quantum computing and
quantum simulation [1–5]. In particular, the platform has
been identified as a prime candidate for tackling combi-
natorial optimization problems using quantum annealing
and variational quantum algorithms [6,7]. Many combi-
natorial optimization problems are known to be hard to
solve for classical computers and thus current quantum
computing efforts are directed toward exploring potential
quantum speedups.
A key challenge to reach this goal, especially in the
current era of noisy intermediate scale quantum (NISQ)
devices [8], is to make efficient use of the available phys-
ical resources. To this end, it is of crucial importance to
match the strengths of a particular physical platform to
the computational problem under consideration. In the
realm of quantum optimization, it was recently shown
that the Rydberg platform provides a natural, overhead-
free match for encoding maximum-weight independent
set (MWIS) problems on disk graphs [6,9] based on the
so-called Rydberg blockade mechanism [10–12]. Even
though solving this “Rydberg-encoded” MWIS problem
has been shown to be NP-hard [13], it remains challeng-
ing to extend this approach restricted to disk graphs for
encoding arbitrary optimization problems. This is espe-
cially true for problems that go beyond quadratic binary
optimization (QUBO), i.e., allowing for higher-order in-
teraction terms (hypergraphs) and side conditions (hard
constraints).
Here, we propose a scheme to overcome these limi-
tations by utilizing the recently introduced parity en-
coding of arbitrary combinatorial optimization prob-
lems [14,15]. Our scheme allows one to construct
the problem-defining spin model from small, problem-
independent MWIS blocks on a two-dimensional lattice
geometry, paving the way for straightforward scalabil-
ity. Furthermore, we equip our approach with a lo-
cal compensation routine minimizing unwanted Rydberg-
interaction-induced crosstalk and numerically demon-
strate, that our procedure faithfully encodes the solution
∗These authors contributed equally to this work. Corresponding
author: martin.lanthaler@uibk.ac.at
FIG. 1. Rydberg parity MWIS protocol. Arbitrary combinato-
rial optimization problems (a) can be parity-transformed to
a spin model utilizing only local-fields and quasi-local inter-
actions (indicated by blue squares and triangles) (b). The
resulting plaquette logic can be realized as a MWIS problem
on disk graphs, readily implementable in state-of-the-art neu-
tral atom devices (c). There, each vertex is represented by
an atom, with states |0iand |1iencoded in electronic ground
|giand strongly interacting Rydberg states |ri, coherently
driven by Rabi frequency Ω and detunings ∆. Strong van
der Waals interactions energetically unfavour configurations
where atoms in state |riare closer than rB.
to the optimization problem as a MWIS ground state.
Maximum-weight independent set with Rydberg atom
arrays.— A paradigmatic NP-complete problem is the
so-called maximal independent set (MIS) problem [16].
Given a graph G= (V, E), an independent set S⊆Vis
a subset of vertices where no pair is connected via an edge
e∈E. The problem of finding the independent set with
maximal cardinality is called MIS problem. Assigning a
weight ∆v>0 to each vertex generalizes the MIS problem
to the MWIS problem that asks for the independent set
with maximal total weight W=Pv∈S∆v. The MWIS
problem can be formulated as a spin model
arXiv:2210.05604v1 [quant-ph] 11 Oct 2022