Parallax: A Compiler for Neutral Atom Quantum Computers under Hardware Constraints
Jason Ludmir, Tirthak Patel

TL;DR
Parallax is a scalable compiler for neutral atom quantum computers that optimizes qubit movement and gate scheduling, significantly reducing errors and improving success rates by leveraging the hardware's unique features.
Contribution
It introduces Parallax, a novel compilation and scheduling method specifically designed for neutral atom quantum computers, addressing scalability and error reduction.
Findings
Reduces high-error operations by 25%
Increases success rate by 28% on average
Leverages hardware advantages like multi-qubit gates and qubit mobility
Abstract
Among different quantum computing technologies, neutral atom quantum computers have several advantageous features, such as multi-qubit gates, application-specific topologies, movable qubits, homogenous qubits, and long-range interactions. However, existing compilation techniques for neutral atoms fall short of leveraging these advantages in a practical and scalable manner. This paper introduces Parallax, a zero-SWAP, scalable, and parallelizable compilation and atom movement scheduling method tailored for neutral atom systems, which reduces high-error operations by 25% and increases the success rate by 28% on average compared to the state-of-the-art technique.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum and electron transport phenomena · Quantum Information and Cryptography
