A new heuristic compiler for multi-qubit iceberg patches reduces circuit depth by 34 percent, cuts gate counts, and improves fidelity metrics on 71 benchmarks compared with naive mapping.
A tweezer array with 6,100 highly coherent atomic qubits
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 3years
2026 3roles
background 1polarities
background 1representative citing papers
A hot-zone architecture for OQFT on reconfigurable neutral-atom hardware yields tunable latency via 2-4 zones, converging to roughly 500 extra logical ancillae and 128-qubit peak parallelism for half-time performance on 256-2048 bit instances.
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.
citing papers explorer
-
Logical Compilation for Multi-Qubit Iceberg Patches
A new heuristic compiler for multi-qubit iceberg patches reduces circuit depth by 34 percent, cuts gate counts, and improves fidelity metrics on 71 benchmarks compared with naive mapping.
-
Towards Deploying Optimistic Quantum Fourier Transforms: An Architecture-Algorithm Co-Design Study
A hot-zone architecture for OQFT on reconfigurable neutral-atom hardware yields tunable latency via 2-4 zones, converging to roughly 500 extra logical ancillae and 128-qubit peak parallelism for half-time performance on 256-2048 bit instances.
-
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.