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

From Permutation Symmetry to Communication Bounds and Additivity

Zahra Baghali Khanian, Debbie Leung, Graeme Smith

quant-phSubmitted Oct 1, 2026• Announced Oct 2, 2026• 0 citations
arXivHTMLPDF

Abstract

Correlations across channel uses can improve quantum communication rates, making optimization over arbitrarily large blocks a central difficulty in determining quantum capacity. We show how full permutation invariance limits this advantage for every finite-dimensional memoryless channel. The optimized coherent information per use converges to the single-use maximum and consequently attains its supremum at a finite block length. Thus finite-block superadditivity remains possible, while the asymptotic optimization reduces to a single channel use. We also establish a strong converse for pure-source entanglement generation with permutation-invariant inputs: at any fixed rate above the single-use coherent-information maximum, the fidelity tends to zero. Beyond these communication bounds, we identify a common structure underlying completely bounded norms and the sandwiched Rényi channel quantities governing discrimination against a replacer and entanglement-assisted communication. De Finetti reduction and permutation covariance yield systematic alternative proofs of their known multiplicativity and additivity results within a shared variational framework. We further show that, for permutation-invariant inputs, correlations cannot sustain an asymptotic reduction in output entropy per use below the single-use minimum. This entropy limit holds for Rényi orders greater than one and for the von Neumann entropy, extending the role of symmetry from communication bounds to the control of output entropy.

AI Summary

The paper asks whether correlations across uses of a finite-dimensional memoryless channel can sustain a coherent-information advantage when the entire input state is invariant under every permutation. Writing $q_n^{\mathrm{sym}}(\mathcal N)$ for the maximum coherent information per use over this class, it proves $Q^{(1)}(\mathcal N)\le q_n^{\mathrm{sym}}(\mathcal N)\le Q^{(1)}(\mathcal N)+O(\log n/\sqrt n)$. Thus the sequence converges to the single-use maximum, and its supremum is attained at a finite block length, although finite-block superadditivity remains possible. The same reduction yields a strong-converse upper threshold at $Q^{(1)}(\mathcal N)$ for pure-source entanglement-generation codes with permutation-invariant channel inputs: fidelity tends to zero at any fixed rate above this threshold. For minimum output entropy restricted to permutation-invariant inputs, it establishes $nh_\alpha-\frac{\alpha}{\alpha-1}\log g_{n,d}\le h_{\alpha,n}^{\mathrm{sym}}\le nh_\alpha$, where $g_{n,d}=\binom{n+d^2-1}{d^2-1}$ and $\alpha>1$. The entropy per use converges to the single-use minimum, also for von Neumann entropy. The proofs combine symmetric purification, polynomial de Finetti/postselection domination, flagged mixtures, and sandwiched Rényi estimates near order one. A shared weighted Schatten-norm formulation also gives alternative proofs of known completely bounded norm multiplicativity and Rényi channel additivity results, removing polynomial factors by amplification. Full input permutation invariance is essential; concatenating symmetric blocks need not preserve it. The coding converse does not cover arbitrary mixed encoders, and equality of the restricted capacity with $Q^{(1)}$ would require an achievability argument.

Some signs of AI-generated textAI use disclosedStrong assumptions
We have used AI to assist with the writing and preparation of the manuscript.

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

Related papers

Permutation Invariant Optimization Problems in Quantum Information Theory: A Framework for Channel Fidelity and Beyond

Bjarne Bergh, Marco Parentin

Exploiting permutation invariance to reduce the exponential scaling of semidefinite programs in quantum information has emerged as a powerful computational technique. In this work, we develop a systematic framework for using this reduction via Schur-Weyl duality for optimization problems, and establish methods that allow one to work fully inside the permutation invariant subspace while performing operations such as (partially) applying channels and taking (partial) traces, or computing expressions like the quantum relative entropy. We then apply our techniques to the problem of computing efficient lower bounds on the channel fidelity over $n$ parallel uses of a quantum channel. The algorithm, which we call symmetric seesaw method, exploits permutation-invariant codes to yield improved lower bounds on the channel fidelity over $n$ uses of the depolarizing and amplitude-damping channel in the regime of tens of channel uses, and was used in [arxiv:2604.27042] to demonstrate non-asymptotic superactivation of quantum capacity for $n = 17$. An implementation of our methods, aimed at being suitable for various quantum information theoretic optimization problems, is also available as an open-source Python package.

quant-pharXiv:2604.27040•Apr 30, 2026•3 citations

One-Shot Entanglement-Assisted Quantum and Classical Communication

Nilanjana Datta, Min-Hsiu Hsieh

We study entanglement-assisted quantum and classical communication over a single use of a quantum channel, which itself can correspond to a finite number of uses of a channel with arbitrarily correlated noise. We obtain characterizations of the corresponding one-shot capacities by establishing upper and lower bounds on them in terms of the difference of two smoothed entropic quantities. In the case of a memoryless channel, the upper and lower bounds converge to the known single-letter formulas for the corresponding capacities, in the limit of asymptotically many uses of it. Our results imply that the difference of two smoothed entropic quantities characterizing the one-shot entanglement-assisted capacities serves as a one-shot analog of the mutual information, since it reduces to the mutual information, between the output of the channel and a system purifying its input, in the asymptotic, memoryless scenario.

arXiv:1105.3321•IEEE Transactions on Information Theory•Nov 21, 2012•55 citations

Superadditivity for Entanglement-Assisted Communication

Hao-Chung Cheng, Mario Berta

The entanglement-assisted capacity of a quantum channel admits an additive single-letter characterization, implying that joint encodings across channel uses cannot increase the ultimate communication rate. Here, we show that this additive picture does not extend to communication reliability. Specifically, we prove that the Petz-Rényi channel information can be strictly superadditive for every $α\in[1/2,1)$, yielding a genuine multi-copy enhancement of the entanglement-assisted random-coding error exponent, even though the entanglement-assisted capacity remains additive. We establish this phenomenon analytically already for measurement channels, which are entanglement-breaking and have additive unassisted capacity. Remarkably, this strict superadditivity is witnessed by a separable, classically correlated two-copy channel-input marginal, demonstrating that no entanglement between the transmitted systems is required. Our results show that, although correlations across channel uses cannot increase the ultimate rate of entanglement-assisted communication, they can enhance its reliability.

quant-pharXiv:2607.15151•Jul 17, 2026•2 citations

Classical Communication Helps Single-Shot Quantum Compression

Omri Farber, Gilad Gour

Free classical communication can yield an unbounded single-shot saving in quantum compression, even though it leaves the asymptotic rate of an i.i.d. source unchanged. At every fixed error in $(0,1)$, we exhibit sources whose unassisted compression cost is arbitrarily large, yet a single qubit suffices with classical communication and no preshared entanglement. We establish this separation by determining the exact optimal source fidelity for compression through an $m$-dimensional noiseless quantum channel, with and without free classical communication, while preserving correlations with an inaccessible reference. Without classical assistance, the optimal fidelity is exactly the Ky Fan norm $\|ρ\|_{(m)}$, the sum of the $m$ largest eigenvalues of the source state. With classical assistance, we obtain an explicit spectral threshold formula and a protocol attaining it. Classical communication strictly improves fidelity whenever $m$ is smaller than the source rank. The corresponding compression costs are two smoothed versions of the log-rank entropy, also called max-entropy: trace-distance smoothing under local operations and quadratic smoothing under LOCC. For i.i.d. copies of a fixed source with positive entropy variance, however, the two costs have identical first-, second-, and third-order asymptotic terms. For nonlattice spectra, we determine the constant-order advantage: classical communication saves $\log_2(e)-1$ bits per block asymptotically, and the ratio of assisted to unassisted minimum communication dimensions converges to $2/e$.

quant-pharXiv:2610.14785•Oct 13, 2026•0 citations

Quantum Information Decoupling Beyond Finite Dimensions

Hayata Yamasaki

Quantum information decoupling is a pillar of quantum information theory, underlying quantum communication, error correction, and information recovery. However, its existing formulations rely on random unitary operations tied to finite-dimensional assumptions on quantum systems. Here we establish a decoupling framework for arbitrary separable, possibly infinite-dimensional systems. For finite-dimensional inputs and arbitrary separable reference/output systems, we derive error bounds on one-shot decoupling for completely positive maps in terms of sandwiched Rényi conditional entropies. For partial-trace decoupling with finite-dimensional references, the error exponent is optimal up to the known critical rate. To handle infinite-dimensional inputs, we assume finite entropy of the manipulated system. We construct finite-rank projections on independent and identically distributed (IID) states to restrict randomization to a projected finite-dimensional subspace, while ensuring high success probability by including auxiliary components in the discarded subsystem at asymptotically negligible cost. This leads to an infinite-dimensional IID partial-trace decoupling protocol achieving optimal asymptotic dimension rates. As an application, we construct an infinite-dimensional quantum-state-merging protocol, a mother protocol of quantum information theory. Under finite entropy of Alice's marginal, it achieves the same quantum-communication and total-cost rates as in finite dimensions, governed by mutual information and conditional entropy. These results show that the operational interpretation of entropic quantities through these achievable rates constitutes a universal principle beyond finite dimensions. More broadly, our framework provides foundational tools for exploring quantum information regardless of whether we model the physical world using finite- or infinite-dimensional spaces.

quant-pharXiv:2607.26123•Jul 30, 2026•1 citation

Strong converse for entanglement-assisted capacity

Manish K. Gupta, Mark M. Wilde

The fully quantum reverse Shannon theorem establishes the optimal rate of noiseless classical communication required for simulating the action of many instances of a noisy quantum channel on an arbitrary input state, while also allowing for an arbitrary amount of shared entanglement of an arbitrary form. Turning this theorem around establishes a strong converse for the entanglement-assisted classical capacity of any quantum channel. The present work proves the strong converse for entanglement-assisted capacity by a completely different approach. Namely, we exploit the recent entanglement-assisted “meta-converse” theorem of Matthews and Wehner, several properties of the recently established sandwiched Rényi relative entropy (also referred to as the quantum Rényi divergence), and the multiplicativity of completely bounded p-norms due to Devetak et al. The proof here demonstrates the extent to which the Arimoto approach can be helpful in proving strong converse theorems, it provides an operational relevance for the multiplicativity result of Devetak et al., and it adds to the growing body of evidence that the sandwiched Rényi relative entropy is the correct quantum generalization of the classical concept for all α > 1.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2014•0 citations
Correlations across channel uses can improve quantum communication rates, making optimization over arbitrarily large blocks a central difficulty in determining quantum capacity. We show how full permutation invariance limits this advantage for every finite-dimensional memoryless channel. The optimized coherent information per use converges to the single-use maximum and consequently attains its supremum at a finite block length. Thus finite-block superadditivity remains possible, while the asymptotic optimization reduces to a single channel use. We also establish a strong converse for pure-source entanglement generation with permutation-invariant inputs: at any fixed rate above the single-use coherent-information maximum, the fidelity tends to zero. Beyond these communication bounds, we identify a common structure underlying completely bounded norms and the sandwiched Rényi channel quantities governing discrimination against a replacer and entanglement-assisted communication. De Finetti reduction and permutation covariance yield systematic alternative proofs of their known multiplicativity and additivity results within a shared variational framework. We further show that, for permutation-invariant inputs, correlations cannot sustain an asymptotic reduction in output entropy per use below the single-use minimum. This entropy limit holds for Rényi orders greater than one and for the von Neumann entropy, extending the role of symmetry from communication bounds to the control of output entropy.
The paper asks whether correlations across uses of a finite-dimensional memoryless channel can sustain a coherent-information advantage when the entire input state is invariant under every permutation. Writing qnsym(N)q_n^{\mathrm{sym}}(\mathcal N)qnsym​(N) for the maximum coherent information per use over this class, it proves Q(1)(N)≤qnsym(N)≤Q(1)(N)+O(log⁡n/n)Q^{(1)}(\mathcal N)\le q_n^{\mathrm{sym}}(\mathcal N)\le Q^{(1)}(\mathcal N)+O(\log n/\sqrt n)Q(1)(N)≤qnsym​(N)≤Q(1)(N)+O(logn/n​). Thus the sequence converges to the single-use maximum, and its supremum is attained at a finite block length, although finite-block superadditivity remains possible.
The same reduction yields a strong-converse upper threshold at Q(1)(N)Q^{(1)}(\mathcal N)Q(1)(N) for pure-source entanglement-generation codes with permutation-invariant channel inputs: fidelity tends to zero at any fixed rate above this threshold. For minimum output entropy restricted to permutation-invariant inputs, it establishes nhα−αα−1log⁡gn,d≤hα,nsym≤nhαnh_\alpha-\frac{\alpha}{\alpha-1}\log g_{n,d}\le h_{\alpha,n}^{\mathrm{sym}}\le nh_\alphanhα​−α−1α​loggn,d​≤hα,nsym​≤nhα​, where gn,d=(n+d2−1d2−1)g_{n,d}=\binom{n+d^2-1}{d^2-1}gn,d​=(d2−1n+d2−1​) and α>1\alpha>1α>1. The entropy per use converges to the single-use minimum, also for von Neumann entropy.
The proofs combine symmetric purification, polynomial de Finetti/postselection domination, flagged mixtures, and sandwiched Rényi estimates near order one. A shared weighted Schatten-norm formulation also gives alternative proofs of known completely bounded norm multiplicativity and Rényi channel additivity results, removing polynomial factors by amplification.
Full input permutation invariance is essential; concatenating symmetric blocks need not preserve it. The coding converse does not cover arbitrary mixed encoders, and equality of the restricted capacity with Q(1)Q^{(1)}Q(1) would require an achievability argument.
Exploiting permutation invariance to reduce the exponential scaling of semidefinite programs in quantum information has emerged as a powerful computational technique. In this work, we develop a systematic framework for using this reduction via Schur-Weyl duality for optimization problems, and establish methods that allow one to work fully inside the permutation invariant subspace while performing operations such as (partially) applying channels and taking (partial) traces, or computing expressions like the quantum relative entropy. We then apply our techniques to the problem of computing efficient lower bounds on the channel fidelity over nnn parallel uses of a quantum channel. The algorithm, which we call symmetric seesaw method, exploits permutation-invariant codes to yield improved lower bounds on the channel fidelity over nnn uses of the depolarizing and amplitude-damping channel in the regime of tens of channel uses, and was used in [arxiv:2604.27042] to demonstrate non-asymptotic superactivation of quantum capacity for n=17n = 17n=17. An implementation of our methods, aimed at being suitable for various quantum information theoretic optimization problems, is also available as an open-source Python package.
We study entanglement-assisted quantum and classical communication over a single use of a quantum channel, which itself can correspond to a finite number of uses of a channel with arbitrarily correlated noise. We obtain characterizations of the corresponding one-shot capacities by establishing upper and lower bounds on them in terms of the difference of two smoothed entropic quantities. In the case of a memoryless channel, the upper and lower bounds converge to the known single-letter formulas for the corresponding capacities, in the limit of asymptotically many uses of it. Our results imply that the difference of two smoothed entropic quantities characterizing the one-shot entanglement-assisted capacities serves as a one-shot analog of the mutual information, since it reduces to the mutual information, between the output of the channel and a system purifying its input, in the asymptotic, memoryless scenario.
The entanglement-assisted capacity of a quantum channel admits an additive single-letter characterization, implying that joint encodings across channel uses cannot increase the ultimate communication rate. Here, we show that this additive picture does not extend to communication reliability. Specifically, we prove that the Petz-Rényi channel information can be strictly superadditive for every α∈[1/2,1)α\in[1/2,1)α∈[1/2,1), yielding a genuine multi-copy enhancement of the entanglement-assisted random-coding error exponent, even though the entanglement-assisted capacity remains additive. We establish this phenomenon analytically already for measurement channels, which are entanglement-breaking and have additive unassisted capacity. Remarkably, this strict superadditivity is witnessed by a separable, classically correlated two-copy channel-input marginal, demonstrating that no entanglement between the transmitted systems is required. Our results show that, although correlations across channel uses cannot increase the ultimate rate of entanglement-assisted communication, they can enhance its reliability.
Free classical communication can yield an unbounded single-shot saving in quantum compression, even though it leaves the asymptotic rate of an i.i.d. source unchanged. At every fixed error in (0,1)(0,1)(0,1), we exhibit sources whose unassisted compression cost is arbitrarily large, yet a single qubit suffices with classical communication and no preshared entanglement. We establish this separation by determining the exact optimal source fidelity for compression through an mmm-dimensional noiseless quantum channel, with and without free classical communication, while preserving correlations with an inaccessible reference. Without classical assistance, the optimal fidelity is exactly the Ky Fan norm ∥ρ∥(m)\|ρ\|_{(m)}∥ρ∥(m)​, the sum of the mmm largest eigenvalues of the source state. With classical assistance, we obtain an explicit spectral threshold formula and a protocol attaining it. Classical communication strictly improves fidelity whenever mmm is smaller than the source rank. The corresponding compression costs are two smoothed versions of the log-rank entropy, also called max-entropy: trace-distance smoothing under local operations and quadratic smoothing under LOCC. For i.i.d. copies of a fixed source with positive entropy variance, however, the two costs have identical first-, second-, and third-order asymptotic terms. For nonlattice spectra, we determine the constant-order advantage: classical communication saves log⁡2(e)−1\log_2(e)-1log2​(e)−1 bits per block asymptotically, and the ratio of assisted to unassisted minimum communication dimensions converges to 2/e2/e2/e.
Quantum information decoupling is a pillar of quantum information theory, underlying quantum communication, error correction, and information recovery. However, its existing formulations rely on random unitary operations tied to finite-dimensional assumptions on quantum systems. Here we establish a decoupling framework for arbitrary separable, possibly infinite-dimensional systems. For finite-dimensional inputs and arbitrary separable reference/output systems, we derive error bounds on one-shot decoupling for completely positive maps in terms of sandwiched Rényi conditional entropies. For partial-trace decoupling with finite-dimensional references, the error exponent is optimal up to the known critical rate. To handle infinite-dimensional inputs, we assume finite entropy of the manipulated system. We construct finite-rank projections on independent and identically distributed (IID) states to restrict randomization to a projected finite-dimensional subspace, while ensuring high success probability by including auxiliary components in the discarded subsystem at asymptotically negligible cost. This leads to an infinite-dimensional IID partial-trace decoupling protocol achieving optimal asymptotic dimension rates. As an application, we construct an infinite-dimensional quantum-state-merging protocol, a mother protocol of quantum information theory. Under finite entropy of Alice's marginal, it achieves the same quantum-communication and total-cost rates as in finite dimensions, governed by mutual information and conditional entropy. These results show that the operational interpretation of entropic quantities through these achievable rates constitutes a universal principle beyond finite dimensions. More broadly, our framework provides foundational tools for exploring quantum information regardless of whether we model the physical world using finite- or infinite-dimensional spaces.
The fully quantum reverse Shannon theorem establishes the optimal rate of noiseless classical communication required for simulating the action of many instances of a noisy quantum channel on an arbitrary input state, while also allowing for an arbitrary amount of shared entanglement of an arbitrary form. Turning this theorem around establishes a strong converse for the entanglement-assisted classical capacity of any quantum channel. The present work proves the strong converse for entanglement-assisted capacity by a completely different approach. Namely, we exploit the recent entanglement-assisted “meta-converse” theorem of Matthews and Wehner, several properties of the recently established sandwiched Rényi relative entropy (also referred to as the quantum Rényi divergence), and the multiplicativity of completely bounded p-norms due to Devetak et al. The proof here demonstrates the extent to which the Arimoto approach can be helpful in proving strong converse theorems, it provides an operational relevance for the multiplicativity result of Devetak et al., and it adds to the growing body of evidence that the sandwiched Rényi relative entropy is the correct quantum generalization of the classical concept for all α > 1.