A divide-and-conquer algorithm decomposes atom reconfiguration into three 1D shuttling tasks, enabling O(sqrt N) total transportation cost and reliable solutions via the Gale-Ryser theorem for arbitrary geometries.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
baseline 1
citation-polarity summary
fields
quant-ph 3years
2026 3roles
baseline 1polarities
baseline 1representative citing papers
Block routing number on Ramanujan hypergraphs for surface code patches is Θ(d_C log N_L), with spectral analysis and integration into error correction protocols.
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.
citing papers explorer
-
Square-root Time Atom Reconfiguration Plan for Lattice-shaped Mobile Tweezers
A divide-and-conquer algorithm decomposes atom reconfiguration into three 1D shuttling tasks, enabling O(sqrt N) total transportation cost and reliable solutions via the Gale-Ryser theorem for arbitrary geometries.
-
Block Permutation Routing on Ramanujan Hypergraphs for Fault-Tolerant Quantum Computing
Block routing number on Ramanujan hypergraphs for surface code patches is Θ(d_C log N_L), with spectral analysis and integration into error correction protocols.
-
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.