Quantum
Exponential strong converse for blind quantum data compression
Publication: quant-ph updates on arXiv.org
Author: Kohdai Kuroiwa
Source published: 01/10/2026, 04:00:00 UTC
Briefing created: 01/10/2026, 04:19:35 UTC
Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 01/10/2026, 04:13:24 UTC.
Briefings
The authors established exponential strong converse theorems for blind quantum data compression of finite-dimensional mixed-state sources, both with and without entanglement assistance. For unassisted compression, accuracy decays exponentially with block length at every rate below the optimum. With unlimited entanglement assistance, exponential strong converse holds at the optimal rate. A new overlap quantity based on quantum state structure connects information preservation to transmitted system dimension. The results resolve a long-standing open question about strong converse behavior for mixed-state sources.
Key points
- Exponential strong converse theorems were established for blind quantum data compression of finite-dimensional mixed-state sources, both with and without entanglement assistance.
- For unassisted compression, accuracy decays exponentially with block length at every rate below the optimum for general mixed-state sources without protocol restrictions.
Context and limitations
The results apply to finite-dimensional mixed-state sources; the proof introduces a new overlap quantity based on state structure, but its general applicability to other quantum information tasks remains to be verified.
Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 01/10/2026, 04:19:35 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.
View archived briefing on IPFS
bafybeiglpii6kg4zfmr4vjrtr2lgoytnt4ohjsa3qlo3o4muhbs4ixze24