Proves Θ(log N) routing number for Ramanujan (d,r)-regular hypergraphs via clique expansion matchings and develops applications to neutral atom qubit routing including virtual overlays, entanglement assistance, and hierarchical methods.
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
UNVERDICTED 1representative citing papers
citing papers explorer
-
Permutation Routing on Ramanujan Hypergraphs with Applications to Neutral Atom Quantum Architectures
Proves Θ(log N) routing number for Ramanujan (d,r)-regular hypergraphs via clique expansion matchings and develops applications to neutral atom qubit routing including virtual overlays, entanglement assistance, and hierarchical methods.