← Back to papers
Lower Bounds on Pauli Manipulation Detection Codes
Keiya Ichikawa, Kenji Yasunaga·April 1, 2025
Quantum PhysicsCryptographycs.IT
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
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 every $q$-ary PMD code of length $n$ and coding rate $R$ must satisfy $R \leq 1 - \frac{2}{n}\log_q\left(\frac{1}ε\right) + o(1)$, where $ε$ is the error parameter.