Explorerโ€บQuantum Computingโ€บQuantum Physics
Research PaperResearchia:202609.23052

Explicit channels with unbounded gains in classical communication using entangled inputs

Hao-Chung Cheng

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 ingr...

Submitted: September 23, 2026Subjects: Quantum Physics; Quantum Computing

Description / Details

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.


Source: arXiv:2609.26743v1 - http://arxiv.org/abs/2609.26743v1 PDF: https://arxiv.org/pdf/2609.26743v1 Original Link: http://arxiv.org/abs/2609.26743v1

Please sign in to join the discussion.

No comments yet. Be the first to share your thoughts!

Access Paper
View Source PDF
Submission Info
Date:
Sep 23, 2026
Topic:
Quantum Computing
Area:
Quantum Physics
Comments:
0
Bookmark
Explicit channels with unbounded gains in classical communication using entangled inputs | Researchia