Noise threshold for positive quantum capacity of the depolarizing channel
34No. 1,499 in all physics · No. 73 in Quantum Information and Foundations
For the qubit depolarizing channel $D_p(\rho) = (1 - p) \rho + (p/3)(X \rho X + Y \rho Y + Z \rho Z)$, find $p*$ with quantum capacity $Q(D_p) > 0$ if and only if $p < p*$. Known: $Q = 0$ for $p \ge 1/4$; the hashing bound is positive up to $p \sim 0.1893$, and degenerate codes push positivity above 0.19 (DiVincenzo, Shor and Smolin 1998; Smith and Smolin 2007), with further small improvements since. More generally, compute $Q(D_p)$ for any $0 < p < 1/4$.
What would settle it
A matching upper bound below $1/4$ and code construction, or an exact capacity formula.
Status in the literature
Unverified note: it names recent work and was partly written without a live literature search; it awaits a check by an editor.
2026 preprints refine lower bounds on the threshold (e.g. arXiv:2608.15870, arXiv:2609.39747); $p*$ is unknown.
No solutions, ideas or subproblems yet.
See also
Details, signature and history
- Kind
- Well-posed question
- Answer
- Value
- Posed
- 1996
- Topic review
- R. Horodecki, P. Horodecki, M. Horodecki and K. Horodecki, Quantum entanglement, Reviews of Modern Physics, 2009. Link
- Record
- Revision 2 · notation repaired by the platform · compiled by AI, not yet reviewed by an editor
- Batch approval
- Approved for the batch by Victor Galitski (ORCID 0000-0001-5532-1096) · approval record · bundle This approves the batch, not each problem (what it means).
- AI systems
- AI systems used to prepare this seed revision, as listed in its record: ai:gpt-5.5 (how the seed revision was made)
- Earlier revisions
- revision 1 bundle
Proof
- Fingerprint
- a3da47a56171…
- Public log
- Entry 2,034, in checkpoint 2,123
- In the log by
- Block 969,698, 2026-10-03
This text was in the PubPhys log by that date. The date says nothing about when the problem was first posed.
Comments (0)
Comments are not records: they are not signed, stamped or logged. How comments work
No comments yet.
Sign in to comment.