Lower Bounds on Pauli Manipulation Detection Codes
Abstract
We present a lower bound for Pauli Manipulation Detection (PMD) codes, a class of quantum codes that detect every Pauli error with high probability. Our lower bound reveals the first trade-off between the error parameter and the coding rate. Specifically, we show that everyq-ary PMD code of lengthnand coding rateRmust satisfyR≤ 1 – 2/nlogq(1/ε)+o(1), where ε is the error parameter.
Fields of Study & Subjects
Quantum Computing Algorithms and Architecture
Radiation Effects in Electronics
Coding theory and cryptography
Publication details
- Journal / source
- IEEE Transactions on Information Theory
- Volume
- 72
- Issue
- 7
- Pages
- 4926–4929
- Publication date
- 22 April 2026
- Language
- EN