Algebraic rank-one decompositions and graph-theoretic transport scheduling reduce addressing layers by up to 2x and atom transports by ~50% for neutral-atom quantum circuits.
The compilation problem for column-aligned C-Z gates can be treated analogously
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Structure-Aware Compilation for Scalable Neutral-Atom Quantum Computing
Algebraic rank-one decompositions and graph-theoretic transport scheduling reduce addressing layers by up to 2x and atom transports by ~50% for neutral-atom quantum circuits.