arXiv:2610.13854
No advantage from classical assistance for energy-constrained bosonic dephasing channels
Amir Arqand, Graeme Smith
Abstract
We prove that four capacities of single-mode bosonic dephasing channels coincide under an average photon-number constraint: the unassisted quantum capacity, the unassisted private capacity, the two-way classically assisted quantum capacity, and the two-way public-classically assisted private capacity. The assistance may be interactive: the parties can exchange classical messages between channel uses and choose subsequent inputs based on earlier outcomes. For every finite value of the constraint, their common value is the coherent information optimized over Fock-diagonal input states satisfying the constraint. The proof uses a relative entropy comparison with the completely dephasing channel to derive chain rules for the Rains relative entropy and the relative entropy of entanglement. These chain rules give an upper bound on the rates achievable by adaptive protocols whose mean input photon number is constrained on average over all channel uses. We also show that both chain rules are attained by canonical purifications of finite-energy Fock-diagonal states.
AI Summary
Does interactive two-way classical communication increase quantum or private communication rates through a bosonic dephasing channel when input energy is finite? Previous equality results without energy constraints did not settle this question because their achievability constructions used diverging photon number. For single-mode bosonic dephasing channels $\mathcal N_\mu$ generated by a phase-noise probability density, the paper proves that, for every $0\leq E<\infty$, $Q(\mathcal N_\mu,E)=P(\mathcal N_\mu,E)=Q_2(\mathcal N_\mu,E)=P_2(\mathcal N_\mu,E)$. Their common value is $\sup_{p:\,\sum_k kp_k\leq E}[H(p)-H(\sum_k p_k|e_k\rangle\langle e_k|)]$, where $|e_k\rangle$ are the complementary-channel outputs for Fock inputs. The assisted protocols may adapt inputs to previous outcomes; the energy constraint applies to unconditional input photon number averaged over all uses, rather than separately to each round. The converse compares channel outputs with those of complete Fock dephasing. A relative-entropy pinching identity yields chain rules bounding the increase of either Rains relative entropy or relative entropy of entanglement in one channel use by the diagonal-input coherent information. Iteration, LOCC monotonicity, and concavity give matching adaptive-protocol bounds. Degradability supplies unassisted achievability. Canonical purifications of finite-energy Fock-diagonal states attain both entanglement bounds; the analysis allows countable photon-number support and infinite-dimensional memories and shields. The characterization leaves the photon-number-distribution optimization unresolved. Determining optimal distributions for specific noise models and extending the methods to combined loss–dephasing channels remain open directions.
The majority of the manuscript was written by the authors, with ChatGPT Astra used iteratively for editing and refinement.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.