English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

Despite major ongoing advancements in neutral atom hardware technology, thereremains limited work in systems-level software tailored to overcoming thechallenges of neutral atom quantum computers. In particular, most currentneutral atom architectures do not natively support local addressing ofsingle-qubit rotations about an axis in the xy-plane of the Bloch sphere.Instead, these are executed via global beams applied simultaneously to allqubits. While previous neutral atom experimental work has used straightforwardsynthesis methods to convert short sequences of operations into this nativegate set, these methods cannot be incorporated into a systems-level frameworknor applied to entire circuits without imposing impractical amounts ofserialization. Without sufficient compiler optimizations, decompositionsinvolving global gates will significantly increase circuit depth, gate count,and accumulation of errors. No prior compiler work has addressed this, andadapting existing compilers to solve this problem is nontrivial.  In this paper, we present an optimized compiler pipeline that translates aninput circuit from an arbitrary gate set into a realistic neutral atom nativegate set containing global gates. We focus on decomposition and schedulingpasses that minimize the final circuit's global gate count and total globalrotation amount. As we show, these costs contribute the most to the circuit'sduration and overall error, relative to costs incurred by other gate types.Compared to the unoptimized version of our compiler pipeline, minimizing globalgate costs gives up to 4.77x speedup in circuit duration. Compared to theclosest prior existing work, we achieve up to 53.8x speedup. For largecircuits, we observe a few orders of magnitude improvement in circuitfidelities.

Circuit decompositions and scheduling for neutral atom devices with limited local addressability