arXiv:2609.26743
Explicit channels with unbounded gains in classical communication using entangled inputs
Hao-Chung Cheng, Benjamin Lovitz, Peixue Wu
Abstract
A seminal result of Hastings showed that entangled inputs can increase the rate of classical communication through independent uses of a quantum channel. While Hastings' result proved the existence of this phenomenon, it has remained a major open problem to find an explicit channel with this property. In this work, we resolve this question by constructing an explicit family of finite-dimensional quantum channels for which entangling inputs between pairs of channel uses yields an unbounded separation from the achievable communication rate using unentangled inputs. We describe a circuit implementation of our channel that uses only deterministic qudit Clifford unitaries and a single binary measurement with classical feedforward. The key ingredient is a careful design of the 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.
AI Summary
The paper addresses the explicit-construction version of Hastings’ nonadditivity result: can a deterministically specified finite-dimensional channel exhibit increased classical communication rates from entangled inputs? It claims a family $\Phi_N$ satisfying $\chi_{\max}(\Phi_N)<1/N$ while $\chi_{\max}(\Phi_N^{\otimes2})>N$. Thus entanglement across pairs of uses gives an unbounded additive advantage over product-state encoding. The stated output and input dimensions are respectively exponential and doubly exponential in $N$. The construction combines a complementary mixed-unitary channel with a binary measurement and conditional depolarization. Its unitaries are explicitly prescribed products and tensor products of modular-addition qudit Clifford operations. The measurement filter $H^2=\gamma(I+F)^{-1}$ suppresses exceptional directions, with $F$ built from high even powers of combinations of the unitaries. A net argument gives uniform one-copy entropy bounds; arithmetic fixed-point counting and free-group-style cancellation estimates control moments and bound $\operatorname{Tr}F$. Maximally entangled inputs then yield two-copy entropy bounds without requiring strong convergence. Tensor-coordinate estimates, output postprocessing, and a Weyl-covariant extension produce the claimed Holevo-information separation. The dimensions are not practical: a concrete minimum-output-entropy violation uses a 27-qubit output and approximately $8.8\times10^{23}$ input qubits. The paper identifies reducing dimensions and controlling implementation cost as open goals. Although the unitary ingredients are Clifford operations, the construction also requires the explicitly specified, nontrivial measurement filter; no efficient implementation bound for that filter is supplied.
Central claim may not hold: Theorem 1 relies on an unspecified post-processing channel R_r whose existence and explicit construction with the asserted entropy guarantees are not proved. The final Holevo lower-bound argument uses a Bell-input entropy bound where the stated preceding estimate bounds only the minimum output entropy. The advertised Clifford-only implementation is not established because the circuit requires coherently controlled Clifford operations that are not themselves generally Clifford.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- Update: a complete Lean verification is added