OpenFrontiers
← Back to the index
OP-3004Partially solvedQuantum information

Quantum capacity of the qubit depolarizing channel

For Dq(ρ)=(1−q)ρ+q3(XρX+YρY+ZρZ)\mathcal D_q(\rho)=(1-q)\rho+\frac q3(X\rho X+Y\rho Y+Z\rho Z), determine the unassisted memoryless quantum capacity, or at least q=sup⁡{q∈[0,3/4]:Q(Dq)>0}q_ = \sup\{q\in[0,3/4]:Q(\mathcal D_q)>0\}.

Source-reported statusAs of 2026-09-04Source & evidence ↓

Problem statement

For Dq(ρ)=(1−q)ρ+q3(XρX+YρY+ZρZ)\mathcal D_q(\rho)=(1-q)\rho+\frac q3(X\rho X+Y\rho Y+Z\rho Z), determine the unassisted memoryless quantum capacity, or at least q∗=sup⁡{q∈[0,3/4]:Q(Dq)>0}q_* = \sup\{q\in[0,3/4]:Q(\mathcal D_q)>0\}.

Lean 4

Not yet attached

No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.

Background

The depolarizing channel is a canonical simple noise model whose ordinary quantum capacity is still unknown. The parameter qq here is the total nonidentity Pauli error probability; the probability of each individual Pauli error is p=q/3p=q/3. Other definitions of “depolarizing probability” differ, so numerical thresholds must state their convention.

Antidegradability gives zero quantum capacity for q∈[1/4,3/4]q\in[1/4,3/4]. Achievable rates from coherent information and degenerate quantum codes give lower bounds, but optimization over a single use is not generally the capacity. The residual gap already poses a sharp problem for a two-dimensional channel.

Preprint progress (August 2026): Krohn-Grimberghe supplies an exact-arithmetic certificate claiming positive coherent information for a 45-copy rank-two input at per-Pauli noise p=0.064956p=0.064956, or total error q=0.194868q=0.194868. If verified, this certifies q∗≥0.194868q_*\geq0.194868; it is not an exact capacity formula or the threshold itself. The certificate is designed to permit independent checking, which this catalogue does not claim to have performed.

This benchmark was promoted from C1 to keep the precise threshold question and its noise normalization visible. Unassisted vanishing-error capacity is intended; two-way, zero-error and restricted-code capacities are different quantities.

Source disclosures

Krohn-Grimberghe reports an AI-driven numerical search and AI assistance with code, calculations, mechanical proof derivations and drafting under author direction. The author takes responsibility; the verification chain is intended to be independent of witness discovery. Source

Progress & source assessment

Source catalogue review: 4 September 2026. Improved indicates partial progress, including qualified preprint claims.

preprint: Exact-arithmetic positive coherent-information certificate for a 45-copy rank-two input at total Pauli error q=0.194868; not an exact threshold. Evidence

References
  1. [1]Krohn-Grimberghe, 'A certified lower bound on the quantum-capacity threshold of the depolarizing channel' (2026 preprint) link
  2. [2]Tomamichel, 'A strong converse for stabilizer codes over Pauli channels via the blowing-up lemma' (2026 preprint; includes depolarizing parameter regimes) link

Recorded progress

Add yours →

Nothing recorded yet. A pointer to a paper the entry is missing counts.

Machine attempts

0 recorded

Attempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.

No machine attempts recorded.

Sign in to run an attempt. New accounts start with enough credits for ten.

Discussion

0 notes

Notes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.

No notes yet.

Sign in to add a note.