# Permutation-Invariant Codes **Permutation-invariant codes** are quantum error-correcting codes whose codewords are unchanged if you swap (permute) any of the qubits. They are a leading example of a **non-stabilizer** code — one defined outside the usual [[Stabilizer Codes|stabilizer]] framework. ## First principles In a stabilizer code, the location of an error matters: the [[Syndrome Extraction|syndrome]] tells you *which* qubit broke. A permutation-invariant code is built on a different bet: > [!intuition] It doesn't matter which one broke, only that one broke > If the codewords depend only on *how many* qubits are in each state — not *which* qubits — then the system only needs to detect that *some* error of a given type occurred, not pin down its address. The correction acts on the collective, symmetric state. Because the information is stored in totally symmetric combinations, the natural way to manipulate it is with operations that touch **every qubit at once**. ## What the hardware must provide This symmetry maps onto two specific hardware capabilities: - **[[Global Control Fields]]** — one signal that addresses *all* qubits simultaneously, instead of wiring each qubit individually. Symmetric codes want symmetric control. - **A [[Bosonic Bus]]** — a single shared quantum channel that every qubit couples to, providing the collective interaction the encoding relies on. ## Why it matters - It shows error correction need not be local or address-based; **symmetry itself** can be the protective resource. - Its requirements (global control + a shared bus) are a strong match for platforms with all-to-all, reconfigurable interactions like [[Neutral Atom Qubits|neutral atoms]] — so the choice of code is, again, tied to the [[Qubit Connectivity and Reconfigurability|connectivity]] of the machine. ## Related - [[Stabilizer Codes]] - [[Global Control Fields]] - [[Bosonic Bus]] - [[Neutral Atom Qubits]] - [[Quantum Error Correction]]