Position graph abstraction plus SHAPER/SHAW heuristics enable shuttling-aware compilation on trapped-ion machines, succeeding on extreme cases where baselines fail and yielding 1.45x average (up to 4x) speedups.
Cormen, Charles E
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2025 2representative citing papers
Orionet delivers parallel PPSP algorithms using bidirectional search and A* with a query-graph abstraction for batch queries, showing 2.9-6.8x speedups over GraphIt and MBQ on 14 graphs.
citing papers explorer
-
Efficient Compilation for Shuttling Trapped-Ion Machines via the Position Graph Architectural Abstraction
Position graph abstraction plus SHAPER/SHAW heuristics enable shuttling-aware compilation on trapped-ion machines, succeeding on extreme cases where baselines fail and yielding 1.45x average (up to 4x) speedups.
-
Parallel Point-to-Point Shortest Paths and Batch Queries
Orionet delivers parallel PPSP algorithms using bidirectional search and A* with a query-graph abstraction for batch queries, showing 2.9-6.8x speedups over GraphIt and MBQ on 14 graphs.