Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 7 min ago
PreprintarXiv licencearXiv

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

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.

Related

  1. Disassembling qLDPC codes for depth-optimal parity-check circuits
    Minh T. P. Nguyen, Maximilian Rimbach-Russ, Stefano Bosco
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  2. Optimizing optimal transport: Role of final distributions in finite-time thermodynamics
    Kaito Tojo, Rihito Nagase, Ken Funo +1
    Physical Review ResearchPeer-reviewedPublisher termsStatistical & nonlinear physicsCrossref
  3. Time-reversal-odd Transport in Odd-Parity Magnets
    Ling Bai, Si Li, Libor Šmejkal +2
    arXivPreprintarXiv licenceFull textCondensed matterarXiv
  4. Optimizing diffusion-limited transport, with applications to electrochemical systems
    Manu Mannattil, L. Mahadevan
    arXivPreprintarXiv licenceFull textPhysical chemistryOptimisation & controlarXiv
  5. Optimizing Cell-Based Negative Weight Mitigation with Optimal Transport
    Lauren Hay, Rishabh Jain, Matt LeBlanc +1
    arXivPreprintCC BY 4.0Full textComputational physicsHigh-energy & particle physicsarXiv
BibTeX
@misc{kazemi2026optimizing,
  title = {{Optimizing Atom Transport, Gate-Count and Depth with Parity Twine}},
  author = {Javad Kazemi and Michael Fellner and Riccardo J. Valencia-Tortora and Michael Schuler and Wolfgang Lechner},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.03583},
  eprint = {2609.03583},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.03583},
}
RIS
TY  - UNPB
TI  - Optimizing Atom Transport, Gate-Count and Depth with Parity Twine
AU  - Javad Kazemi
AU  - Michael Fellner
AU  - Riccardo J. Valencia-Tortora
AU  - Michael Schuler
AU  - Wolfgang Lechner
PY  - 2026
DA  - 2026/09/03
PB  - arXiv
DO  - 10.48550/arxiv.2609.03583
UR  - https://arxiv.org/abs/2609.03583
AB  - 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.
ER  -