$$ % Dirac notation \newcommand{\ket}[1]{\left|#1\right\rangle} \newcommand{\bra}[1]{\left\langle#1\right|} \newcommand{\braket}[2]{\left\langle#1\middle|#2\right\rangle} \newcommand{\expect}[1]{\left\langle#1\right\rangle} % Common operators \newcommand{\tr}{\operatorname{tr}} \newcommand{\Tr}{\operatorname{Tr}} \DeclareMathOperator*{\argmin}{arg\,min} \DeclareMathOperator*{\argmax}{arg\,max} % Complexity \newcommand{\bigO}[1]{\mathcal{O}\!\left(#1\right)} $$

Gate Decomposition & Scheduling

Interactive tools for QFT compilation on neutral-atom hardware

1. \(CR_k\) Gate Decomposition

Each controlled rotation \(CR_k\) in the QFT must be decomposed into the hardware-native gate set: one CZ gate plus single-qubit \(R_z\) rotations. Select a gate to see its decomposition.

2. Routing Cost Comparison

Compare the cost of SWAP-based routing vs atom shuttling for a gate between two qubits at varying distances on a 2D grid.

3. Compilation Strategy Comparison

Compare estimated fidelity across the three compilation strategies for QFT circuits of varying size.