Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Haar random codes attain the quantum Hamming bound, approximately

Fermi Ma, Xinyu Tan, John Wright

TL;DR

The paper proves that Haar random quantum codes approximately saturate the quantum Hamming bound: a code with dimension $K$ can reliably correct up to $m$ Pauli-like errors when $Km\ll N$, with the code achieving an $O(\sqrt{Km/N})$ disturbance. The main method blends AQEC formalism with unitary error sets and a decoding isometry, then leverages powerful matrix-concentration results (notably from Bandeira, Boedihardjo, and van Handel) to show that a Haar random encoding behaves like an approximate nondegenerate code with high probability. The authors introduce the notions of $\delta$-approximate nondegenerate codes and $\mathcal{E}=\mathrm{span}\{E_i\}$-AQECs, proving Haar randomness yields $\delta$-approximate isometries for $X=\sum_i E_i G\otimes|i\rangle$ and thus $\boldsymbol{V}$ encodes $K$-dimensional spaces into $N$-dimensional spaces with controlled error. Consequences include near-saturation of the quantum Hamming bound for general Pauli errors and a near-Singleton bound performance for erasures, highlighting the potential of approximate quantum error correction and prompting questions about optimality versus degeneracy in quantum codes. The work also connects to physical models of chaos and black holes via Hayden–Preskill-type reasoning, illustrating the broad relevance of random quantum codes beyond circuit-design contexts.

Abstract

We study the error correcting properties of Haar random codes, in which a $K$-dimensional code space $\boldsymbol{C} \subseteq \mathbb{C}^N$ is chosen at random from the Haar distribution. Our main result is that Haar random codes can approximately correct errors up to the quantum Hamming bound, meaning that a set of $m$ Pauli errors can be approximately corrected so long as $mK \ll N$. This is the strongest bound known for any family of quantum error correcting codes (QECs), and continues a line of work showing that approximate QECs can significantly outperform exact QECs [LNCY97, CGS05, BGG24]. Our proof relies on a recent matrix concentration result of Bandeira, Boedihardjo, and van Handel.

Haar random codes attain the quantum Hamming bound, approximately

TL;DR

The paper proves that Haar random quantum codes approximately saturate the quantum Hamming bound: a code with dimension can reliably correct up to Pauli-like errors when , with the code achieving an disturbance. The main method blends AQEC formalism with unitary error sets and a decoding isometry, then leverages powerful matrix-concentration results (notably from Bandeira, Boedihardjo, and van Handel) to show that a Haar random encoding behaves like an approximate nondegenerate code with high probability. The authors introduce the notions of -approximate nondegenerate codes and -AQECs, proving Haar randomness yields -approximate isometries for and thus encodes -dimensional spaces into -dimensional spaces with controlled error. Consequences include near-saturation of the quantum Hamming bound for general Pauli errors and a near-Singleton bound performance for erasures, highlighting the potential of approximate quantum error correction and prompting questions about optimality versus degeneracy in quantum codes. The work also connects to physical models of chaos and black holes via Hayden–Preskill-type reasoning, illustrating the broad relevance of random quantum codes beyond circuit-design contexts.

Abstract

We study the error correcting properties of Haar random codes, in which a -dimensional code space is chosen at random from the Haar distribution. Our main result is that Haar random codes can approximately correct errors up to the quantum Hamming bound, meaning that a set of Pauli errors can be approximately corrected so long as . This is the strongest bound known for any family of quantum error correcting codes (QECs), and continues a line of work showing that approximate QECs can significantly outperform exact QECs [LNCY97, CGS05, BGG24]. Our proof relies on a recent matrix concentration result of Bandeira, Boedihardjo, and van Handel.

Paper Structure

This paper contains 21 sections, 12 theorems, 57 equations.

Table of Contents

  1. Introduction
  2. Approximate quantum error correction
  3. Our contributions
  4. Unitary error sets
  5. Approximately nondegenerate codes
  6. Main results
  7. Consequences of our results
  8. Related work
  9. Approximate quantum error correction.
  10. Exact quantum error correction.
  11. Unitary error sets.
  12. Notation
  13. Approximate nondegenerate codes are AQECs
  14. The decoding channel and the error-diagnosing isometry
  15. Intuition for the decoding channel: the perfectly nondegenerate case
  16. ...and 6 more sections

Key Result

Theorem 1.10

Let $V:\mathbb C^K\mapsto \mathbb C^N$ be an encoding isometry and $\{E_1, \ldots, E_m\}$ be a unitary error set. Given $0 \leq \delta < 1$, if $V$ is a $\delta$-approximate nondegenerate code with respect to $\{E_1, \ldots, E_m\}$, then $V$ specifies an AQEC which corrects for the set of errors $\m

Theorems & Definitions (34)

  • Definition 1.1: Errors
  • Definition 1.2: Approximate quantum error correcting code
  • Definition 1.3: Haar measure
  • Definition 1.4: Haar random codes
  • Definition 1.5: Unitary error sets
  • Example 1.6: Pauli matrices
  • Definition 1.7: Approximate isometry
  • Definition 1.8: Approximately orthonormal basis
  • Definition 1.9: Approximate nondegenerate code
  • Theorem 1.10: Approximate nondegenerate codes are AQECs
  • ...and 24 more