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

Efficiently computable bounds on the energy-constrained quantum reading capacity

Vishal Singh, Zixin Huang, Mark M. Wilde

quant-phcs.ITSubmitted Oct 6, 2026• Announced Oct 8, 2026• 1 citation
arXivHTMLPDF

Abstract

In quantum reading, classical messages are encoded in sequences of quantum channels and recovered by probing the channels and processing their outputs. We study the reading capacity of a finite family of finite-dimensional channels under an average constraint on the probing energy, allowing arbitrary adaptive operations between channel uses. Using an input-dependent chain rule for the Belavkin-Staszewski relative entropy, we derive a converse bound expressed as an optimization involving channel Choi operators and the operator relative entropy. This formulation admits semidefinite approximations and reduces, without an energy constraint, to a channel information radius. To obtain achievable rates, we construct bilinear semidefinite lower approximations to a standard non-adaptive reading bound. Alternating optimization produces feasible probe states and encoding distributions, whose Holevo information gives a directly evaluable achievable rate. For jointly classical-quantum channels, we derive a separate converse based on the Umegaki relative entropy. Without an energy constraint, this converse matches a non-adaptive achievable rate, recovering a recent result of Pascual Abraldes and Winter: non-adaptive protocols suffice to achieve the unconstrained reading capacity of jointly classical-quantum channels.

AI Summary

The paper studies the reading capacity of a finite family of finite-dimensional quantum channels under an average probe-energy constraint, allowing arbitrary adaptive operations and quantum memory between channel uses. It develops a numerically accessible converse and a procedure for finding non-adaptive achievable rates. The main converse is $R_{H,E}\le\inf_{\mathcal S,\lambda\in\mathbb R,\mu\ge0}(\lambda+\mu E)$, subject to $[\operatorname{Tr}_B\widehat D_{\mathrm{op}}(\Gamma^x,\Gamma^{\mathcal S})]^T\le\lambda I+\mu H$ for every channel label $x$. Here $\mathcal S$ is a reference channel and $\Gamma$ denotes a Choi operator. An input-dependent Belavkin–Staszewski relative-entropy chain rule bounds the information accumulated through an adaptive protocol; dualizing the energy constraint yields the operator inequalities. Existing operator-relative-entropy approximations give SDP formulations. Without an energy constraint, the bound becomes $\inf_{\mathcal S}\max_x\widehat D(\mathcal N^x\Vert\mathcal S)$. For achievability, semidefinite discretizations of an integral representation of Umegaki relative entropy yield bilinear lower approximations to the standard single-probe Holevo rate. Alternating optimization finds feasible probe states and encoding distributions, whose Holevo information can then be evaluated directly. For jointly classical–quantum channels, a Umegaki-based converse matches non-adaptive achievability without energy constraints, recovering a known capacity characterization. The lower-bound optimization has no global-optimality guarantee. Numerical examples cover qubit unitaries and loss–dephasing channels; the latter use finite-dimensional truncation without certified bosonic-capacity error bounds. Whether adaptivity improves energy-constrained reading capacity for jointly classical–quantum channels remains open.

Little sign of AI-generated textIncremental

Error found: Appendix A's finite-order semidefinite approximation can return approximately 0.9901 bits for two orthogonal replacer channels whose reading capacity is exactly 1 bit, so its uncorrected output is not necessarily a capacity upper bound.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
22+5 pages, 2 figures

Related papers

Efficiently Computable Strategies and Limits for Bosonic Channel Discrimination

Zixin Huang, Ludovico Lami, Vishal Singh +1 more

Discriminating between noisy quantum processes is a central primitive for quantum communication, metrology, and computing. While discrimination limits for finite-dimensional channels are well understood, the continuous-variable setting, particularly under experimentally relevant energy constraints, remains significantly less developed. In this work, we establish an energy-constrained chain rule for the Belavkin-Staszewski channel divergence, which yields a fundamental upper bound on the error exponents achievable by fully adaptive, energy-constrained quantum channel discrimination protocols. We then derive efficiently computable bounds on asymmetric error exponents for energy-constrained discrimination of bosonic dephasing and loss-dephasing channels. Specifically, we show that three operationally relevant quantities -- the measured relative entropy, the Umegaki relative entropy, and the geometric Renyi divergence -- admit semidefinite program (SDP) formulations when the input energy is bounded and the Hilbert space is suitably truncated. Applying these tools, we demonstrate that optimal probes for these channels under energy constraints are Fock-diagonal, and we also enable numerically precise evaluation of bounds on achievable error exponents across discrimination strategies ranging from separable to fully adaptive. The resulting SDPs provide practical benchmarks for quantum-limited sensing in low-energy bosonic platforms.

quant-pharXiv:2603.19911•Physical Review A•Mar 23, 2026•5 citations

Energy-constrained two-way capacity bounds for noisy Gaussian channels

Stefano Pirandola

A gap between achievable rates and converse bounds persists for energy-constrained bosonic communication in the presence of excess noise. We derive a unified adaptive weak-converse bound for thermal attenuation, noisy amplification, and additive Gaussian noise under an unconditional mean transmitted-photon-number constraint. The bound applies to arbitrary adaptive protocols with quantum memories and constrains the two-way quantum, entanglement-distribution, private, and secret-key capacities. It vanishes throughout the entanglement-breaking region and approaches the corresponding PLOB bound at infinite energy. At finite energy, it improves the evaluated Gaussian squashed-entanglement and PLOB bounds in relevant parameter regimes, while comparison with hashing rates quantifies the remaining gap to achievability. The result provides a common energy-dependent benchmark for noisy bosonic Gaussian channels and extends finite-energy converse methods beyond the quantum-limited setting.

quant-pharXiv:2610.08786•Oct 7, 2026•3 citations

Energy-Constrained Private and Quantum Capacities of Quantum Channels

Mark M. Wilde, Haoyu Qi

This paper establishes a general theory of energy-constrained quantum and private capacities of quantum channels. We begin by defining various energy-constrained communication tasks, including quantum communication with a uniform energy constraint, entanglement transmission with an average energy constraint, private communication with a uniform energy constraint, and secret key transmission with an average energy constraint. We develop several code conversions, which allow us to conclude non-trivial relations between the capacities corresponding to the above tasks. We then show how the regularized, energy-constrained coherent information is equal to the capacity for the first two tasks and is an achievable rate for the latter two tasks, whenever the energy observable satisfies the Gibbs condition of having a well-defined thermal state for all temperatures and the channel satisfies a finite output-entropy condition. For degradable channels satisfying these conditions, we find that the single-letter energy-constrained coherent information is equal to all of the capacities. We finally apply our results to degradable quantum Gaussian channels and recover several results already established in the literature (in some cases, we prove new results in this domain). Contrary to what may appear from some statements made in the literature recently, proofs of these results do not require the solution of any kind of minimum output entropy conjecture or entropy photon-number inequality.

arXiv:1609.01997•IEEE Transactions on Information Theory•Dec 1, 2018•67 citations

Efficient Approximation of Quantum Channel Capacities

David Sutter, Tobias Sutter, Peyman Mohajerin Esfahani +1 more

We propose an iterative method for approximating the capacity of classical-quantum channels with a discrete input alphabet and a finite-dimensional output under additional constraints on the input distribution. Based on duality of convex programming, we derive explicit upper and lower bounds for the capacity. To provide an additive ε-close estimate to the capacity, the presented algorithm requires O((N ν M)M3log(N)1/2ε-1) steps, where N denotes the input alphabet size and M denotes the output dimension. We then generalize the method to the task of approximating the capacity of classical-quantum channels with a bounded continuous input alphabet and a finite-dimensional output. This, using the idea of a universal encoder, allows us to approximate the Holevo capacity for channels with a finite-dimensional quantum mechanical input and output. In particular, we show that the problem of approximating the Holevo capacity can be reduced to a multi-dimensional integration problem. For certain families of quantum channels, we prove that the complexity to derive an additive ε-close solution to the Holevo capacity is subexponential or even polynomial in the problem size. We provide several examples to illustrate the performance of the approximation scheme in practice.

arXiv:1407.8202•IEEE Transactions on Information Theory•Nov 25, 2015•30 citations

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

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

Amir Arqand, Graeme Smith

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.

quant-pharXiv:2610.13854•Oct 12, 2026•0 citations
In quantum reading, classical messages are encoded in sequences of quantum channels and recovered by probing the channels and processing their outputs. We study the reading capacity of a finite family of finite-dimensional channels under an average constraint on the probing energy, allowing arbitrary adaptive operations between channel uses. Using an input-dependent chain rule for the Belavkin-Staszewski relative entropy, we derive a converse bound expressed as an optimization involving channel Choi operators and the operator relative entropy. This formulation admits semidefinite approximations and reduces, without an energy constraint, to a channel information radius. To obtain achievable rates, we construct bilinear semidefinite lower approximations to a standard non-adaptive reading bound. Alternating optimization produces feasible probe states and encoding distributions, whose Holevo information gives a directly evaluable achievable rate. For jointly classical-quantum channels, we derive a separate converse based on the Umegaki relative entropy. Without an energy constraint, this converse matches a non-adaptive achievable rate, recovering a recent result of Pascual Abraldes and Winter: non-adaptive protocols suffice to achieve the unconstrained reading capacity of jointly classical-quantum channels.
The paper studies the reading capacity of a finite family of finite-dimensional quantum channels under an average probe-energy constraint, allowing arbitrary adaptive operations and quantum memory between channel uses. It develops a numerically accessible converse and a procedure for finding non-adaptive achievable rates.
The main converse is RH,E≤inf⁡S,λ∈R,μ≥0(λ+μE)R_{H,E}\le\inf_{\mathcal S,\lambda\in\mathbb R,\mu\ge0}(\lambda+\mu E)RH,E​≤infS,λ∈R,μ≥0​(λ+μE), subject to [Tr⁡BD^op(Γx,ΓS)]T≤λI+μH[\operatorname{Tr}_B\widehat D_{\mathrm{op}}(\Gamma^x,\Gamma^{\mathcal S})]^T\le\lambda I+\mu H[TrB​Dop​(Γx,ΓS)]T≤λI+μH for every channel label xxx. Here S\mathcal SS is a reference channel and Γ\GammaΓ denotes a Choi operator. An input-dependent Belavkin–Staszewski relative-entropy chain rule bounds the information accumulated through an adaptive protocol; dualizing the energy constraint yields the operator inequalities. Existing operator-relative-entropy approximations give SDP formulations. Without an energy constraint, the bound becomes inf⁡Smax⁡xD^(Nx∥S)\inf_{\mathcal S}\max_x\widehat D(\mathcal N^x\Vert\mathcal S)infS​maxx​D(Nx∥S).
For achievability, semidefinite discretizations of an integral representation of Umegaki relative entropy yield bilinear lower approximations to the standard single-probe Holevo rate. Alternating optimization finds feasible probe states and encoding distributions, whose Holevo information can then be evaluated directly. For jointly classical–quantum channels, a Umegaki-based converse matches non-adaptive achievability without energy constraints, recovering a known capacity characterization.
The lower-bound optimization has no global-optimality guarantee. Numerical examples cover qubit unitaries and loss–dephasing channels; the latter use finite-dimensional truncation without certified bosonic-capacity error bounds. Whether adaptivity improves energy-constrained reading capacity for jointly classical–quantum channels remains open.
Discriminating between noisy quantum processes is a central primitive for quantum communication, metrology, and computing. While discrimination limits for finite-dimensional channels are well understood, the continuous-variable setting, particularly under experimentally relevant energy constraints, remains significantly less developed. In this work, we establish an energy-constrained chain rule for the Belavkin-Staszewski channel divergence, which yields a fundamental upper bound on the error exponents achievable by fully adaptive, energy-constrained quantum channel discrimination protocols. We then derive efficiently computable bounds on asymmetric error exponents for energy-constrained discrimination of bosonic dephasing and loss-dephasing channels. Specifically, we show that three operationally relevant quantities -- the measured relative entropy, the Umegaki relative entropy, and the geometric Renyi divergence -- admit semidefinite program (SDP) formulations when the input energy is bounded and the Hilbert space is suitably truncated. Applying these tools, we demonstrate that optimal probes for these channels under energy constraints are Fock-diagonal, and we also enable numerically precise evaluation of bounds on achievable error exponents across discrimination strategies ranging from separable to fully adaptive. The resulting SDPs provide practical benchmarks for quantum-limited sensing in low-energy bosonic platforms.
A gap between achievable rates and converse bounds persists for energy-constrained bosonic communication in the presence of excess noise. We derive a unified adaptive weak-converse bound for thermal attenuation, noisy amplification, and additive Gaussian noise under an unconditional mean transmitted-photon-number constraint. The bound applies to arbitrary adaptive protocols with quantum memories and constrains the two-way quantum, entanglement-distribution, private, and secret-key capacities. It vanishes throughout the entanglement-breaking region and approaches the corresponding PLOB bound at infinite energy. At finite energy, it improves the evaluated Gaussian squashed-entanglement and PLOB bounds in relevant parameter regimes, while comparison with hashing rates quantifies the remaining gap to achievability. The result provides a common energy-dependent benchmark for noisy bosonic Gaussian channels and extends finite-energy converse methods beyond the quantum-limited setting.
This paper establishes a general theory of energy-constrained quantum and private capacities of quantum channels. We begin by defining various energy-constrained communication tasks, including quantum communication with a uniform energy constraint, entanglement transmission with an average energy constraint, private communication with a uniform energy constraint, and secret key transmission with an average energy constraint. We develop several code conversions, which allow us to conclude non-trivial relations between the capacities corresponding to the above tasks. We then show how the regularized, energy-constrained coherent information is equal to the capacity for the first two tasks and is an achievable rate for the latter two tasks, whenever the energy observable satisfies the Gibbs condition of having a well-defined thermal state for all temperatures and the channel satisfies a finite output-entropy condition. For degradable channels satisfying these conditions, we find that the single-letter energy-constrained coherent information is equal to all of the capacities. We finally apply our results to degradable quantum Gaussian channels and recover several results already established in the literature (in some cases, we prove new results in this domain). Contrary to what may appear from some statements made in the literature recently, proofs of these results do not require the solution of any kind of minimum output entropy conjecture or entropy photon-number inequality.
We propose an iterative method for approximating the capacity of classical-quantum channels with a discrete input alphabet and a finite-dimensional output under additional constraints on the input distribution. Based on duality of convex programming, we derive explicit upper and lower bounds for the capacity. To provide an additive ε-close estimate to the capacity, the presented algorithm requires O((N ν M)M3log(N)1/2ε-1) steps, where N denotes the input alphabet size and M denotes the output dimension. We then generalize the method to the task of approximating the capacity of classical-quantum channels with a bounded continuous input alphabet and a finite-dimensional output. This, using the idea of a universal encoder, allows us to approximate the Holevo capacity for channels with a finite-dimensional quantum mechanical input and output. In particular, we show that the problem of approximating the Holevo capacity can be reduced to a multi-dimensional integration problem. For certain families of quantum channels, we prove that the complexity to derive an additive ε-close solution to the Holevo capacity is subexponential or even polynomial in the problem size. We provide several examples to illustrate the performance of the approximation scheme in practice.
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.
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.