Quantum Hamming sphere-packing bound (t=1): 2^k · (1 + 3n) ≤ 2^n for non-degenerate codes

Layer 1 — Physicsin the quantum-error-correction subtree

Quantum Hamming (sphere-packing) bound. Setup: a non-degenerate [[n,k,d]] stabiliser code able to correct t = ⌊(d−1)/2⌋ arbitrary single-qubit errors. Theorem: 2^k·V_q(n,t) ≤ 2^n where the quantum error-sphere volume V_q(n,t) = Σ_{j=0}^t…

Related concepts

Explore Quantum Hamming sphere-packing bound (t=1): 2^k · (1 + 3n) ≤ 2^n for non-degenerate codes on the interactive knowledge graph →