Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.13854

No advantage from classical assistance for energy-constrained bosonic dephasing channels

Amir Arqand, Graeme Smith

quant-phSubmitted Oct 9, 2026• Announced Oct 12, 2026• 0 citations
arXivHTMLPDF

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.

Some signs of AI-generated textAI use disclosed
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.

Related papers

Energy-constrained two-way capacities of pure-loss and quantum-limited amplifier channels

Stefano Pirandola

We determine the two-way quantum, entanglement-distribution, private, and secret-key capacities of the pure-loss bosonic channel under an unconditional mean transmitted-photon-number constraint. For transmissivity $η$ and mean photon number $N$, all four capacities coincide and are given by $g(N)-g((1-η)N)$, where $g$ is the entropy of a thermal mode. This resolves the longstanding energy-constrained capacity problem by establishing the optimality of the reverse-coherent-information rate introduced in 2009. Our central tool is sector teleportation simulation, which we develop specifically to transfer the input-energy constraint to the shared entanglement resource, thereby preserving the constraint throughout converse arguments for general adaptive protocols. For every $N>0$, we further show that the corresponding strong-converse thresholds coincide with the unconstrained value $-\log_2(1-η)$. For parallel protocols with a hard total-photon-number cutoff, the same energy-constrained capacity formula instead satisfies an exponential strong converse. As an extension, we determine the energy-constrained two-way capacities of the quantum-limited amplifier, showing that classical assistance does not improve its unassisted quantum and private rates. Together, these results establish a unified finite-energy framework for adaptive bosonic communication and reveal how energy constraints fundamentally reshape both attainable rates and converse bounds.

quant-pharXiv:2610.06832•Oct 6, 2026•7 citations

Energy-constrained two-way capacities of the pure-loss bosonic channel

Stefano Pirandola

Abstract: We determine the two-way quantum, entanglement-distribution, private, and secret-key capacities of the pure-loss bosonic channel under an unconditional mean transmitted-photon-number constraint. For transmissivity $\eta$ and mean photon number $N$, all four capacities coincide and are given by $g(N)-g((1-\eta)N)$,where $g$ is the entropy of a thermal mode. This resolves the longstanding finite-energy capacity problem by establishing the optimality of the reverse-coherent-information rate introduced in 2009. Our central tool is sector teleportation simulation, which we develop specifically to transfer the input-energy constraint to the shared entanglement resource, thereby preserving the constraint throughout converse arguments for general adaptive protocols. For every $N>0$, we further show that the corresponding strong-converse thresholds coincide with the unconstrained value $-\log_2(1-\eta)$. For parallel protocols with a hard total-photon-number cutoff, the same finite-energy capacity formula instead satisfies an exponential strong converse. Together, these results establish a unified finite-energy framework for adaptive bosonic communication and reveal how energy constraints fundamentally reshape both attainable rates and converse bounds.

•Oct 6, 2026•0 citations

Classical Capacity of Single-Mode Bosonic Gaussian Channels

Gerardo Adesso, Ludovico Lami, Vittorio Giovannetti

The classical capacity of a noisy optical channel is the maximum rate at which information can be transmitted reliably, given a constraint on the mean input energy. For the ubiquitous bosonic Gaussian channels, which include standard models of loss and noise in fibre and free-space optical links, determining this rate requires addressing whether entanglement between channel uses or non-Gaussian signals can outperform Gaussian encodings. More precisely, the question is whether the energy-constrained Holevo information is additive across arbitrarily many channel uses and coincides with its Gaussian counterpart. We answer these fundamental questions in the affirmative for every single-mode bosonic Gaussian channel at every input energy. Namely, we prove that independently prepared Gaussian states with Gaussian-distributed random displacements achieve the capacity, including in the low-energy regime where squeezing the signals competes with encoding information in their displacement. Our proof connects an entanglement inequality to a sharp, additive lower bound on output entropy. We then characterise communication above capacity: under a strict total photon-number cutoff, the probability of correct decoding decreases exponentially with the number of channel uses, and we derive explicit bounds on the decay exponent. When only the mean photon number is constrained, a simple energy-rescaling formula determines exactly the entire asymptotic rate--error trade-off: the capacity at mean photon number $N$ and allowed average decoding error $ε$ equals the vanishing-error capacity at mean photon number $N/(1-ε)$. Together, these results identify the ultimate limits of classical communication for some of the most fundamental models of optical communication.

quant-pharXiv:2610.22308•Oct 16, 2026•1 citation

Energy-Constrained LOCC-Assisted Quantum Capacity of the Bosonic Dephasing Channel

Amir Arqand, Laleh Memarzadeh, Stefano Mancini

We study the LOCC-assisted quantum capacity of a bosonic dephasing channel with energy constraint on the input states. We start our analysis by focusing on the energy-constrained squashed entanglement of the channel, which is an upper bound for the energy-constrained LOCC-assisted quantum capacity. As computing energy-constrained squashed entanglement of the channel is challenging due to a double optimization (over the set of density matrices and the isometric extensions of a squashing channel), we first derive an upper bound for it, and then, we discuss how tight that bound is for the energy-constrained LOCC-assisted quantum capacity of the bosonic dephasing channel. In doling so, we prove that the optimal input state is diagonal in the Fock basis. Then, we analyze two explicit examples of squashing channels through which we derive explicit upper and lower bounds for the energy-constrained LOCC-assisted quantum capacity of the bosonic dephasing channel in terms of its quantum capacity with different noise parameters. As the difference between upper and lower bounds becomes smaller by increasing the dephasing parameter, the bounds become tighter.

arXiv:2111.04173•Entropy•Jun 29, 2023•6 citations

Energy-constrained two-way assisted private and quantum capacities of quantum channels

Noah Davis, Максим Евгеньевич Широков, Mark M. Wilde

With the rapid growth of quantum technologies, knowing the fundamental characteristics of quantum systems and protocols is essential for their effective implementation. A particular communication setting that has received increased focus is related to quantum key distribution and distributed quantum computation. In this setting, a quantum channel connects a sender to a receiver, and their goal is to distill either a secret key or entanglement, along with the help of arbitrary local operations and classical communication (LOCC). In this work, we establish a general theory of energy-constrained, LOCC-assisted private and quantum capacities of quantum channels, which are the maximum rates at which an LOCC-assisted quantum channel can reliably establish a secret key or entanglement, respectively, subject to an energy constraint on the channel input states. We prove that the energy-constrained squashed entanglement of a channel is an upper bound on these capacities. We also explicitly prove that a thermal state maximizes a relaxation of the squashed entanglement of all phase-insensitive, single-mode input bosonic Gaussian channels, generalizing results from prior work. After doing so, we prove that a variation of the method introduced by Goodenough et al. [New J. Phys. 18, 063005 (2016)] leads to improved upper bounds on the energy-constrained secret-key-agreement capacity of a bosonic thermal channel. We then consider a multipartite setting and prove that two known multipartite generalizations of the squashed entanglement are in fact equal. We finally show that the energy-constrained, multipartite squashed entanglement plays a role in bounding the energy-constrained LOCC-assisted private and quantum capacity regions of quantum broadcast channels.

arXiv:1801.08102•Physical Review A•Jun 7, 2018•30 citations

Energy-constrained two-way capacities of the pure-loss channel

Alessandro Falco, Francesco Anna Mele, Ludovico Lami +1 more

We determine the two-way quantum and secret-key capacities of the pure-loss channel under an average input photon-number constraint. For transmissivity $η$ and photon budget $N$, both capacities equal $g(N)-g((1-η)N)$, where $g$ is the entropy of a thermal state. This coincides with the rate achieved by the known reverse coherent information of a two-mode squeezed vacuum. Our result provides the last missing capacity formula for the celebrated pure-loss channel, completing the picture of bosonic quantum communication under pure loss.

quant-pharXiv:2610.12365•Oct 9, 2026•1 citation
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.
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 Nμ\mathcal N_\muNμ​ generated by a phase-noise probability density, the paper proves that, for every 0≤E<∞0\leq E<\infty0≤E<∞, Q(Nμ,E)=P(Nμ,E)=Q2(Nμ,E)=P2(Nμ,E)Q(\mathcal N_\mu,E)=P(\mathcal N_\mu,E)=Q_2(\mathcal N_\mu,E)=P_2(\mathcal N_\mu,E)Q(Nμ​,E)=P(Nμ​,E)=Q2​(Nμ​,E)=P2​(Nμ​,E). Their common value is sup⁡p: ∑kkpk≤E[H(p)−H(∑kpk∣ek⟩⟨ek∣)]\sup_{p:\,\sum_k kp_k\leq E}[H(p)-H(\sum_k p_k|e_k\rangle\langle e_k|)]supp:∑k​kpk​≤E​[H(p)−H(∑k​pk​∣ek​⟩⟨ek​∣)], where ∣ek⟩|e_k\rangle∣ek​⟩ 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.
We determine the two-way quantum, entanglement-distribution, private, and secret-key capacities of the pure-loss bosonic channel under an unconditional mean transmitted-photon-number constraint. For transmissivity ηηη and mean photon number NNN, all four capacities coincide and are given by g(N)−g((1−η)N)g(N)-g((1-η)N)g(N)−g((1−η)N), where ggg is the entropy of a thermal mode. This resolves the longstanding energy-constrained capacity problem by establishing the optimality of the reverse-coherent-information rate introduced in 2009. Our central tool is sector teleportation simulation, which we develop specifically to transfer the input-energy constraint to the shared entanglement resource, thereby preserving the constraint throughout converse arguments for general adaptive protocols. For every N>0N>0N>0, we further show that the corresponding strong-converse thresholds coincide with the unconstrained value −log⁡2(1−η)-\log_2(1-η)−log2​(1−η). For parallel protocols with a hard total-photon-number cutoff, the same energy-constrained capacity formula instead satisfies an exponential strong converse. As an extension, we determine the energy-constrained two-way capacities of the quantum-limited amplifier, showing that classical assistance does not improve its unassisted quantum and private rates. Together, these results establish a unified finite-energy framework for adaptive bosonic communication and reveal how energy constraints fundamentally reshape both attainable rates and converse bounds.
Abstract: We determine the two-way quantum, entanglement-distribution, private, and secret-key capacities of the pure-loss bosonic channel under an unconditional mean transmitted-photon-number constraint. For transmissivity η\etaη and mean photon number NNN, all four capacities coincide and are given by g(N)−g((1−η)N)g(N)-g((1-\eta)N)g(N)−g((1−η)N),where ggg is the entropy of a thermal mode. This resolves the longstanding finite-energy capacity problem by establishing the optimality of the reverse-coherent-information rate introduced in 2009. Our central tool is sector teleportation simulation, which we develop specifically to transfer the input-energy constraint to the shared entanglement resource, thereby preserving the constraint throughout converse arguments for general adaptive protocols. For every N>0N>0N>0, we further show that the corresponding strong-converse thresholds coincide with the unconstrained value −log⁡2(1−η)-\log_2(1-\eta)−log2​(1−η). For parallel protocols with a hard total-photon-number cutoff, the same finite-energy capacity formula instead satisfies an exponential strong converse. Together, these results establish a unified finite-energy framework for adaptive bosonic communication and reveal how energy constraints fundamentally reshape both attainable rates and converse bounds.
The classical capacity of a noisy optical channel is the maximum rate at which information can be transmitted reliably, given a constraint on the mean input energy. For the ubiquitous bosonic Gaussian channels, which include standard models of loss and noise in fibre and free-space optical links, determining this rate requires addressing whether entanglement between channel uses or non-Gaussian signals can outperform Gaussian encodings. More precisely, the question is whether the energy-constrained Holevo information is additive across arbitrarily many channel uses and coincides with its Gaussian counterpart. We answer these fundamental questions in the affirmative for every single-mode bosonic Gaussian channel at every input energy. Namely, we prove that independently prepared Gaussian states with Gaussian-distributed random displacements achieve the capacity, including in the low-energy regime where squeezing the signals competes with encoding information in their displacement. Our proof connects an entanglement inequality to a sharp, additive lower bound on output entropy. We then characterise communication above capacity: under a strict total photon-number cutoff, the probability of correct decoding decreases exponentially with the number of channel uses, and we derive explicit bounds on the decay exponent. When only the mean photon number is constrained, a simple energy-rescaling formula determines exactly the entire asymptotic rate--error trade-off: the capacity at mean photon number NNN and allowed average decoding error εεε equals the vanishing-error capacity at mean photon number N/(1−ε)N/(1-ε)N/(1−ε). Together, these results identify the ultimate limits of classical communication for some of the most fundamental models of optical communication.
We study the LOCC-assisted quantum capacity of a bosonic dephasing channel with energy constraint on the input states. We start our analysis by focusing on the energy-constrained squashed entanglement of the channel, which is an upper bound for the energy-constrained LOCC-assisted quantum capacity. As computing energy-constrained squashed entanglement of the channel is challenging due to a double optimization (over the set of density matrices and the isometric extensions of a squashing channel), we first derive an upper bound for it, and then, we discuss how tight that bound is for the energy-constrained LOCC-assisted quantum capacity of the bosonic dephasing channel. In doling so, we prove that the optimal input state is diagonal in the Fock basis. Then, we analyze two explicit examples of squashing channels through which we derive explicit upper and lower bounds for the energy-constrained LOCC-assisted quantum capacity of the bosonic dephasing channel in terms of its quantum capacity with different noise parameters. As the difference between upper and lower bounds becomes smaller by increasing the dephasing parameter, the bounds become tighter.
With the rapid growth of quantum technologies, knowing the fundamental characteristics of quantum systems and protocols is essential for their effective implementation. A particular communication setting that has received increased focus is related to quantum key distribution and distributed quantum computation. In this setting, a quantum channel connects a sender to a receiver, and their goal is to distill either a secret key or entanglement, along with the help of arbitrary local operations and classical communication (LOCC). In this work, we establish a general theory of energy-constrained, LOCC-assisted private and quantum capacities of quantum channels, which are the maximum rates at which an LOCC-assisted quantum channel can reliably establish a secret key or entanglement, respectively, subject to an energy constraint on the channel input states. We prove that the energy-constrained squashed entanglement of a channel is an upper bound on these capacities. We also explicitly prove that a thermal state maximizes a relaxation of the squashed entanglement of all phase-insensitive, single-mode input bosonic Gaussian channels, generalizing results from prior work. After doing so, we prove that a variation of the method introduced by Goodenough et al. [New J. Phys. 18, 063005 (2016)] leads to improved upper bounds on the energy-constrained secret-key-agreement capacity of a bosonic thermal channel. We then consider a multipartite setting and prove that two known multipartite generalizations of the squashed entanglement are in fact equal. We finally show that the energy-constrained, multipartite squashed entanglement plays a role in bounding the energy-constrained LOCC-assisted private and quantum capacity regions of quantum broadcast channels.
We determine the two-way quantum and secret-key capacities of the pure-loss channel under an average input photon-number constraint. For transmissivity ηηη and photon budget NNN, both capacities equal g(N)−g((1−η)N)g(N)-g((1-η)N)g(N)−g((1−η)N), where ggg is the entropy of a thermal state. This coincides with the rate achieved by the known reverse coherent information of a two-mode squeezed vacuum. Our result provides the last missing capacity formula for the celebrated pure-loss channel, completing the picture of bosonic quantum communication under pure loss.