A gate-level compiler maps Boolean circuits to weighted king-subgraph MWIS instances on Rydberg arrays, cutting atom counts by about 22x versus CNF-based encoding.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Encoding Circuit Satisfiability in Rydberg Atom Arrays
A gate-level compiler maps Boolean circuits to weighted king-subgraph MWIS instances on Rydberg arrays, cutting atom counts by about 22x versus CNF-based encoding.