---
title: Rotation-Symmetric Quantum Codes
url: https://www.emergentmind.com/topics/rotation-symmetric-codes
type: topic
---

# Rotation-Symmetric Quantum Codes

Rotation-symmetric codes are a class of quantum error-correcting codes defined in the infinite-dimensional Hilbert space of a bosonic mode, whose structure is determined by invariance under discrete phase-space rotation. The underlying symmetry enables robust error detection and correction against dominant noise channels, particularly photon loss and dephasing, in both circuit QED and all-optical platforms. Notable representatives include cat codes and binomial codes, while recent developments extend rotation symmetry to multi-mode encodings and random code ensembles. The defining mathematical, operational, and error-correction properties of these codes have been systematically elucidated, revealing precise trade-offs, optimal error correction, and powerful error mitigation strategies based on symmetry expansion.

## 1. Formal Structure of Rotation-Symmetric Bosonic Codes

Let $\hat{a}$ and $\hat{a}^\dag$ denote bosonic annihilation and creation operators, and $\hat{n} = \hat{a}^\dag \hat{a}$ the number operator. The $N$-fold discrete phase rotation is generated by
\[ R_N = \exp\left(i\frac{2\pi}{N}\hat{n}\right). \]
A state $|\psi\rangle$ is $N$-fold rotation-symmetric if $R_N |\psi\rangle = |\psi\rangle$. The codespace $\mathcal{C}_N$ is defined as the $+1$ eigenspace of $R_N$, isolated by the projector
\[ \Pi_N = \frac{1}{N}\sum_{k=0}^{N-1} R_N^k, \]
which projects onto Fock states $|n\rangle$ with $n \equiv 0 \mod N$.

Logical basis states are constructed by selecting a primitive state $|\Phi\rangle$ and applying symmetrization:
\begin{align*}
|0_N, \Phi\rangle &\propto \Pi_N |\Phi\rangle, \\
|1_N, \Phi\rangle &\propto R\left(\frac{\pi}{N}\right) \Pi_N |\Phi\rangle.
\end{align*}
In Fock basis, the support of $|0_N\rangle$ is on $|2kN\rangle$; $|1_N\rangle$ is on $|(2k+1)N\rangle$.

Prominent specializations include:
- **Cat codes**: $|\Phi\rangle = |\alpha\rangle$ (coherent state); codewords are superpositions of $|\alpha e^{2\pi i k/N}\rangle$.
- **Binomial codes**: $|\Phi\rangle$ a finite Fock-space superposition, with codewords
\begin{align*}
|0_N\rangle &= \sum_{m\;\mathrm{even}} \sqrt{C_m} |m N\rangle, \\
|1_N\rangle &= \sum_{m\;\mathrm{odd}} \sqrt{C_m} |m N\rangle.
\end{align*}
Such codewords exactly inhabit the rotation-symmetric subspace [2211.06164, 2311.13670, 1901.08071, 2311.16089].

## 2. Error-Correction Properties and Code Distance

The essential error basis for rotation-symmetric codes consists of shift–rotation operators:
\[
\mathbb{E}_k(\theta) = 
\begin{cases}
  e^{i\theta \hat{n}}\,\hat{\Sigma}_{|k|}^-, & k<0, \\
  \hat{\Sigma}_k^+\,e^{i\theta \hat{n}}, & k\geq0,
\end{cases}
\]
where $\hat{\Sigma}_1^- = \sum_n |n\rangle\langle n+1|$ ($k$-step generalization as $\hat{\Sigma}_k^-$).

The Knill–Laflamme conditions for these codes yield the code distance vector
\[
(d_n, d_\theta) = (N, \pi/N),
\]
where $d_n$ is the maximum number of detectable photon-loss events, and $d_\theta$ quantifies the minimal distinguishable phase (rotation) error [2311.13670]. This sets a strict trade-off: increasing $N$ enhances loss protection but reduces phase error resilience.

Explicit error correction proceeds by measuring the stabilizers ($R_N$ for number-shifts, $\hat{\Sigma}_{2N}^-$ for modular rotation), extracting the syndromes, and applying a recovery operator constructed from the error basis. Teleportation-based protocols using dual-basis ancillae and controlled-rotations provide software-trackable recovery, optimal for continuous-variable architectures [1901.08071].

## 3. Error Models, Performance, and Noise Robustness

Rotation-symmetric codes exhibit distinct responses to photon loss, Gaussian and non-Gaussian dephasing, as well as non-Markovian environments:
- **Photon loss:** Loss of $k < N$ photons maps codewords to mutually orthogonal error spaces, so single-photon loss can be detected and corrected. In the presence of higher-order loss, logical errors occur when $k \geq N$ [1901.08071, 2311.13670].
- **Dephasing:** Symmetry ensures phase errors of magnitude less than $d_\theta$ can be detected.
- **Random telegraph noise (RTN):** Non-Markovian dephasing arising from bistable fluctuators leads to oscillatory fidelity dynamics. The Breuer–Laine–Piilo measure of non-Markovianity grows linearly with $N$. Higher $N$ induces faster dephasing-revival oscillations, presenting both opportunities and timing challenges for optimal QEC [2505.08670].

Numerical benchmarks across loss and dephasing rates confirm that for moderate-to-large loss with low dephasing, rotation-symmetric codes (including random code variants) surpass cat and binomial codes, while structured codes dominate at high dephasing [2311.16089].

The interplay is summarized by $d_n d_\theta = \pi$, enforcing an intrinsic trade-off and guiding code parameter selection [2311.13670, 2311.16089].

## 4. Code Construction: Cat, Binomial, Random, and Multimode Generalizations

**Cat and binomial codes** are concrete families extensively analyzed in circuit QED and optics. Their explicit Fock-space constructions ensure number-parity and phase-symmetry protection [2211.06164, 2105.11035].

**Random rotation codes** extend this landscape by sampling Fock-space amplitudes according to Haar measure. "One-primitive" and "two-primitive" ensembles allow systematic exploration of the code space bounded by a number cutoff. The best two-primitive random codes outperform fixed cat and binomial codes in high-loss, low-dephasing regimes, owing to effective Fock-weight variational optimization [2311.16089].

**Multimode extensions** employ group-theoretic frameworks to encode qudits in $d$ bosonic modes, implementing Pauli operators via linear optics. Two-mode binomial codes constructed in this formalism exhibit simultaneous protection against loss and correlated dephasing, without the trade-offs present in single-mode codes. This facilitates exact correction of dephasing-induced errors and allows qudit encoding [2508.20647].

## 5. Practical State Preparation, Error Mitigation, and Fault-Tolerant Protocols

**State preparation:** All-optical engineering protocols generate rotation-symmetric code states by coherent photon subtraction from two-mode squeezed vacua, followed by photon-number-resolving (PNR) detection. Heralding rates at $\sim 10^{-3}$–$10^{-2}$ per shot with established squeezing levels ($6$–$12$ dB) confirm near-term feasibility. Detector inefficiency and loss can be managed so that state-preparation infidelity remains $O(\gamma)$, compatible with fault-tolerance [2105.11035].

**Error mitigation:** Symmetry expansion (SE) leverages intrinsic code-group symmetry to realize virtual projections onto the codespace during both preparation and measurement. The process, implementable with an ancilla and two controlled-rotation gates, suppresses leading-order photon-loss errors exactly up to order $N-1$. Sampling cost scales as $e^{2\Gamma}$ for photon loss $\Gamma$, remaining modest for near-term devices [2211.06164]. SE is compatible with dispersive, circuit-QED, and trapped ion platforms.

**Fault tolerance:** Advanced protocols concatenate rotation-symmetric codes with repetition and Bacon-Shor subsystem codes. Fault-tolerance thresholds of $10^{-2}$–$10^{-3}$ per mode are observed, with syndrome measurements delegated to CROT gates and minimal hardware overhead. Destructive measurements and non-Gaussian ancillae are integral in this architecture [1901.08071].

## 6. Applications and Performance in Communication and Computation

Rotation-symmetric codes underpin high-performance quantum communication, with particular utility in quantum repeaters for long-distance key distribution. Comparative studies reveal:
- **Binomial codes** outclass cat codes and squeezed-cat codes in secret-key rate, success probability, and resource overhead.
- **GKP-like rotation codes** achieve further improvement by combining translation and rotation symmetry, at cost of increased complexity.
- **Resource scaling:** Binomial codes enable up to $>2$ km spacing between repeater stations for target SKRs, with optimized mean photon number $\bar{n} \approx 2$, and clear advantages in cost per kilometer in realistic models [2308.15815].

Design guidelines emphasize matching rotation order $N$ to the dominant error (larger $N$ for loss, smaller $N$ for dephasing), optimizing $\bar{n}$, and using moderate squeezing. Random and multimode codes provide additional flexibility for hardware and noise constraints [2311.16089, 2508.20647].

## 7. Theoretical Developments and Future Directions

Recent advances include explicit error propagation analyses using rotation-adapted error bases, analytical demonstration of code distances $(d_n, d_\theta)$, and the construction of group-covariant multimode codes with arbitrary-dimension logical encoding [2311.13670, 2508.20647]. Research continues into resource-efficient state preparation, advanced error mitigation strategies beyond symmetry expansion, and integration into measurement-based computation and photonic network architectures [2211.06164, 2105.11035].

The ubiquity and hardware efficiency of rotation-symmetric codes highlight their promise for fault-tolerant, scalable quantum processing and communication under realistic noise and operational constraints.

Source: https://www.emergentmind.com/topics/rotation-symmetric-codes