Explicit channels with unbounded gains in classical communication using entangled inputs
Hao-Chung Cheng, Benjamin Lovitz, Peixue Wu
quant-ph
Sep 22, 2026 · v2
cs.IT math-ph
TL;DR
All mathematical proofs of the explicit channel construction and its entropy bounds are formally verified in Lean, with a companion Lean verification artifact.
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.
Problem
Hastings showed that entangled inputs can increase the classical capacity of independent uses of a quantum channel, but only proved this exists. No explicit channel with the property was known.
Approach
The authors construct an explicit family of finite-dimensional quantum channels built from deterministic qudit Clifford unitaries plus a single binary measurement with classical feedforward. They design the measurement and feedforward so that one-copy and two-copy output entropy bounds follow from moment estimates alone, with no need for strong convergence of the unitary family. All proofs are formally verified in Lean.
Results
Entangling inputs across pairs of channel uses gives an unbounded separation from the rate achievable with unentangled inputs: chi_max of two copies exceeds N while chi_max of one copy is below 1/N. The proofs are machine-checked in Lean.