Stabilizer Codes
Quantum stabilizer codes and the complexity of decoding them, including the Learning Stabilizer with Noise problem.
| Status | Problem | Tags |
|---|---|---|
|
No Self-Reduction for LSN Conjecture 5.20 of the source. It proves no random self-reduction exists from an arbitrary worst-case QNCP instance into LSN, naming exchange symmetry between code and error as the obstruction, and proves the tableau-randomizing barrier conditionally on the scrambling gap being polynomially related to \(\varepsilon\). It is explicit that this is not an impossibility for random self-reductions in general. 4 open |
Average Case HardnessLearning Parity With NoiseQuantum InformationStabilizer Codesimpossibilityadaptation (ai) |
No matching items