Haar random codes attain the quantum Hamming bound, approximately

2025-10-08

AI Summary

This work investigates the approximate error-correction capability of Haar-random quantum codes against Pauli errors, aiming to determine whether they can asymptotically approach the quantum Hamming bound. Method: We construct a quantum code by selecting a $K$-dimensional subspace uniformly at random from the $N$-dimensional Hilbert space according to the Haar measure, and rigorously analyze its error-correction performance using matrix concentration inequalities developed by Bandeira–Boedihardjo–van Handel. Contribution/Results: We establish, for the first time, that Haar-random codes approximately correct arbitrary $m$-qubit Pauli errors whenever $mK ll N$, achieving the tightest known bound for approximate quantum error correction. This result surpasses the performance limits of exact quantum error-correcting codes and reveals a fundamental trade-off between resource efficiency and fault tolerance in approximate coding. It provides a rigorous theoretical foundation for lightweight fault-tolerant protocols in high-dimensional quantum systems.

Technology Category

• Machine Learning: Quantum Machine Learning
• Knowledge Representation and Reasoning: Qualitative Reasoning
• Multiagent Systems: Adversarial Agents

Application Category

• Security and Privacy: Large-scale security measurements
• Search and Retrieval-Augmented AI: Web evaluation methodologies and metrics
• Economics, Online Markets and Human Computation: Data quality aspects of human-annotated datasets

Abstract

We study the error correcting properties of Haar random codes, in which a $K$-dimensional code space $oldsymbol{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.

Problem

• Haar random codes achieve quantum Hamming bound
• Approximate error correction outperforms exact QECs
• Corrects m Pauli errors when mK is much less than N

Innovation

• Haar random codes achieve quantum Hamming bound
• Approximate error correction outperforms exact QECs
• Proof uses recent matrix concentration techniques