analiza aiqbench
This paper presents a deterministic construction of quantum channels where entanglement across input pairs enables unbounded classical communication rates, contrasting sharply with zero capacity under product-state constraints. By derandomizing Hastings' probabilistic approach using Clifford unitaries and specific feedforward mechanisms, the work advances fundamental limits in quantum information theory without relying on strong convergence assumptions.
Explicit channels with unbounded gains in classical communication using entangled inputs
arXiv:2609.26743v1 Announce Type: new Abstract: We construct an explicit family of finite-dimensional quantum channels for which the optimal classical communication rate achievable with product-state codewords and collective decoding tends to zero, while rates achievable using entanglement only within pairs of channel inputs grow without bound. Our construction combines deterministic qudit Clifford unitaries with a binary measurement and classical feedforward, providing a derandomization to Hastings' probabilistic construction. The key ingredient is a careful design of measurement and feedforward process that yields the required one-copy and two-copy output entropy bounds from moment estimates alone, without requiring strong convergence of the underlying unitary family.
Abstract:We construct an explicit family of finite-dimensional quantum channels for which the optimal classical communication rate achievable with product-state codewords and collective decoding tends to zero, while rates achievable using entanglement only within pairs of channel inputs grow without bound. Our construction combines deterministic qudit Clifford unitaries with a binary measurement and classical feedforward, providing a derandomization to Hastings' probabilistic construction. The key ingredient is a careful design of measurement and feedforward process that yields the required one-copy and two-copy output entropy bounds from moment estimates alone, without requiring strong convergence of the underlying unitary family.
Quantum Physics (quant-ph); Information Theory (cs.IT); Mathematical Physics (math-ph)
arXiv:2609.26743 [quant-ph]
(or arXiv:2609.26743v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2609.26743 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 · 196 cuvinte
Subiecte conexe

University of Edinburgh team builds secure quantum network protocols
Quantum Zeitgeist · 1 oct. 2026

How Sonos rebooted itself
The Verge · 3 sept. 2026

Import AI 472: DeepMind’s cheating math agents; populist AI policies; and Forethought theorizes a nightwatchman
Import AI · 7 sept. 2026

Deconfusing Corrigibility
AI Alignment Forum · 17 oct. 2026