analiza aiqbench
This research refines the theoretical understanding of quantum depolarizing channels by proving an approximate majorization relation, which establishes tight bounds on the capacity advantage provided by entanglement in finite-blocklength regimes. By sharpening King's analysis using Schatten norms and anti-concentration bounds, the study demonstrates that collective decoding improves message size by at most $O(\log \log n)$ bits over product-coding strategies. These findings clarify the limits of coherent operations for classical communication across multiple channel uses.
Approximate majorization and high-order capacity of quantum depolarizing channels
arXiv:2609.37240v1 Announce Type: new Abstract: A central challenge in quantum information theory is to determine whether entanglement provides an advantage for information processing when coherent operations across multiple channel uses are allowed. For depolarizing channels, King's proof of the additivity of the minimum output entropy rules out such an advantage for classical communication at leading asymptotic order, while leaving open the possibility of an advantage for higher orders. In this work, we conjecture a majorization relation for the outputs of depolarizing channels and prove an approximate version of this conjecture. Our proof combines an exact ordering of shifted log-determinants with an anti-concentration bound for the spectrum of the product-state output, refining King's analysis based on Schatten norms. As a direct application, we obtain a tight third-order expansion for the classical capacity of quantum depolarizing channels. Consequently, entangled codewords and collective decoding can improve the message size over the product-coding strategy by at most $O(\log \log n)$ bits, sharpening our understanding of the role of entanglement in the finite-blocklength regime.
Abstract:A central challenge in quantum information theory is to determine whether entanglement provides an advantage for information processing when coherent operations across multiple channel uses are allowed. For depolarizing channels, King's proof of the additivity of the minimum output entropy rules out such an advantage for classical communication at leading asymptotic order, while leaving open the possibility of an advantage for higher orders. In this work, we conjecture a majorization relation for the outputs of depolarizing channels and prove an approximate version of this conjecture. Our proof combines an exact ordering of shifted log-determinants with an anti-concentration bound for the spectrum of the product-state output, refining King's analysis based on Schatten norms. As a direct application, we obtain a tight third-order expansion for the classical capacity of quantum depolarizing channels. Consequently, entangled codewords and collective decoding can improve the message size over the product-coding strategy by at most $O(\log \log n)$ bits, sharpening our understanding of the role of entanglement in the finite-blocklength regime.
arXiv:2609.37240 [quant-ph]
(or arXiv:2609.37240v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2609.37240 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 255 cuvinte
Subiecte conexe

Lattice-Based Cryptography Explained
Quantum Zeitgeist · 15 aug. 2026

Digital States 2026: AI Moves From Experiment to Infrastructure
govtech.com · 24 sept. 2026
News Archive 2026
Quantum Computing Report · 25 iul. 2026

News
Quantum Computing Report · 7 iun. 2026