Skip to content
Preprint

Optimizing Atom Transport, Gate-Count and Depth with Parity Twine

Sep 2026 · 0 citations · 67 references
Physics

TL;DR

This work develops PTN constructions based on different native entangling-gate realizations, namely CZ, CZSWAP, and iSWAP, providing flexibility to accommodate different hardware capabilities on both static and mobile neutral-atom platforms.

Abstract

We present an efficient implementation of the Parity Architecture for neutral-atom quantum processors. We adapt Parity Twine Networks (PTNs) to different atom layouts, native entangling gates, and atom-shuttling capabilities. This provides a general framework for hardware-aware optimization of gate count, circuit depth, and atom transport for quantum circuits encoding arbitrary interaction graphs in a common basis. Specifically, we develop PTN constructions based on different native entangling-gate realizations, namely CZ, CZSWAP, and iSWAP, providing flexibility to accommodate different hardware capabilities on both static and mobile neutral-atom platforms. Using the quantum Fourier transform (QFT) as a representative example, we demonstrate substantial reductions in two-qubit gate count, atom transport, and circuit depth. These resource savings translate into an estimated circuit fidelity three orders of magnitude higher than competing compilation strategies for a 30-qubit QFT. We further extend the construction to the recently introduced optimistic QFT and discuss the broader applicability of PTNs to other quantum algorithms on neutral-atom platforms.

View source

Similar papers

Preprint Sep 2026

From NISQ to Fault-Tolerance: Applications and Algorithmic Benchmarks for Spin Qubits

This work shows that the compilation method Parity Twine perfectly complements the hardware's capabilities to perform tasks such as the quantum Fourier transform or QAOA, and describes an error detection technique native to Parity Twine, which EO qubits can leverage in a unique and advantageous way to improve algorithm...

F. Lohof, Florian Ginzel, Wolfgang Lechner · 0 citations
Preprint Sep 2026

Parallel algebraic surgery for qLDPC codes with constant shuttling depth

Reconfigurable atom arrays provide a promising platform for high-rate quantum low-density parity-check codes, but their computational advantage depends on whether logical operations can be implemented without incurring prohibitive shuttling and space overheads. We introduce algebraic surgery for lifted product codes, c...

Tian-Gang Zhou, Bo-Ren Gu, Jens Eisert et al. · 0 citations
Preprint Aug 2026

Efficient Assembly of a Defect-Free Quantum Register of 1024 Neutral-Atom Qubits

Low-entropy arrays of atomic quantum systems in optical tweezers offer unique prospects for fundamental research on few- and many-body systems as well as for extended applications in quantum technology. The significance of this approach relies on the achievable system size, its uniformity, and the rate of qubit allocat...

Lukas Sturm, Marcel Mittenbuehler, Tim Gollerthan et al. · 0 citations
Preprint Sep 2026

Optimized Matrix-Product State Simulations of Quantum Error Correction Circuits

Simulating quantum error correction (QEC) circuits including non-Clifford gates at scale is important to accelerate progress toward fault-tolerant quantum computing. Here we demonstrate that matrix product state (MPS) techniques can handle many QEC circuits exactly and without restriction on gate types. Crucially, we f...

A. Orioli, Chen Zhao, G. Masella et al. · 1 citation
Preprint Sep 2026

Mapping Dynamic, Hierarchical Quantum Circuits

Qubit mapping is a critical pass in quantum compilation. Despite various advances, dynamic circuits, those exhibiting data dependent control-flow, often resulting from qubit measurements, are not yet supported by the vast majority of available qubit mappers. The crucial limitation to overcome is the dependence on flat,...

Marouane Benbetka, Merwan Bekkar, Bokyeong Yoon et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.