Table of Contents
Fetching ...

Parallax: A Compiler for Neutral Atom Quantum Computers under Hardware Constraints

Jason Ludmir, Tirthak Patel

TL;DR

PARALLAX is introduced, 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 $\mathbf{2 8 \%}$ on average compared to the state-of-the-art technique.

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.

Parallax: A Compiler for Neutral Atom Quantum Computers under Hardware Constraints

TL;DR

PARALLAX is introduced, a zero-SWAP, scalable, and parallelizable compilation and atom movement scheduling method tailored for neutral atom systems, which reduces high-error operations by and increases the success rate by on average compared to the state-of-the-art technique.

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.
Paper Structure (13 sections, 1 equation, 13 figures, 4 tables, 1 algorithm)

This paper contains 13 sections, 1 equation, 13 figures, 4 tables, 1 algorithm.

Figures (13)

  • Figure 1: The depicted Fredkin circuit has three qubits, represented by horizontal lines, on which the one-qubit U3 gates and two-qubit CZ gates are applied (represented by the vertical lines connecting two qubits). The qubits are measured at the end to get the output probability distribution. The circuit has 16 layers. Gates within a layer are parallelly executable.
  • Figure 2: Device layout of operating a neutral atom quantum computer. The atoms are suspended in a vacuum chamber and controlled using SLM and AOD devices.
  • Figure 3: (a) When a two-qubit gate is running on Q0-Q1, a two-qubit gate can simultaneously run on Q3-Q4, but not on Q2-Q3 or Q2-Q4, as Q2 is blocked when Q0-Q1 are interacting. The radius of the circles corresponding to the interaction radius represents half of the actual interaction radius. We draw the half-radius for ease of interpretation. Thus, if two qubits' interaction radii circles touch or overlap, they can interact with each other. Similarly, the radius of the circles corresponding to the blockade radius represents half of the actual blockade radius. (b) Qubits on the SLM are stationary throughout circuit execution, while qubits on the AOD are mobile. The radius of the circles corresponding to the distance constraint represents half of the minimum separation distance constraint.
  • Figure 4: A high-level overview of the four steps that Parallax takes to compile a circuit for neutral atom quantum computers. The steps here correspond to the three-qubit Fredkin circuit shown in Fig. \ref{['fig:fredkin']}. The atom configuration in Step 3 corresponds to layers 1-7 and 9 in the Fredkin circuit, and the one in Step 4 corresponds to layers 8 and 10-16 in the Fredkin circuit.
  • Figure 5: (a) Parallax ensures there is enough gap among SLM qubits for AOD qubits to traverse through. (b) Parallax ensures one qubit per row/column in the AOD.
  • ...and 8 more figures