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

From Symmetry to Secrecy: Covariant Classical--Quantum Wiretap Channels

Masahito Hayashi, Farzin Salek

quant-phcs.ITSubmitted Oct 2, 2026• Announced Oct 5, 2026• 1 citation
arXivHTMLPDF

Abstract

For classical--quantum wiretap channels with a transitive covariant input action, both output ensembles admit a description as unitary group orbits of fixed seed states. We use this structure to construct finite-block preprocessing schemes whose private information is an entropy difference evaluated at two distributions related by group convolution. Applying the construction to product groups allows correlations across any fixed number of channel uses. We give a sufficient condition for the associated uniform-input bound to equal the single-use private information. Constant-composition channel codes and universal$_2$ hashing achieve the resulting rates, with trace-distance leakage controlled by sandwiched Rényi information. For uniform outer randomization, the representation structure reduces the comparison-state optimization to Eve's invariant states. For the hybrid binary channel considered by Tikku, Berta and Renes, numerical optimization at three and four uses gives rates above our numerical estimate of the optimized noisy-repetition benchmark wherever that estimate is positive on the tested grid. The improvement comes from noise distributions beyond the family of independent physical flips and a symmetric logical flip. We also prove nonadditivity at an explicit channel parameter using a two-use encoder, an analytic single-use converse, and certified entropy bounds. Finally, we relate the hybrid model to binary phase-shift keying with a fixed receiver measurement.

AI Summary

The paper studies how input symmetry can organize correlated randomized encoders for classical–quantum wiretap channels, whose private information can be nonadditive. For a transitive finite-group action, both output ensembles are unitary orbits. Taking independent $V\sim P_3$ and $Z\sim P_1$ and transmitting $X=VZ$ gives the identity $I(V;B)-I(V;E)=\Delta(P_3*P_1)-\Delta(P_1)$, where $\Delta(P)$ is the difference of Bob’s and Eve’s average-output entropies. Applying this construction on $G^n$ permits correlated finite-block preprocessing. Uniform $P_3$ yields $\Delta(P_u)-\min_P\Delta(P)$, which equals the single-use private information if $P_u$ maximizes $\Delta$. Constant-composition cq coding and balanced universal$_2$ hashing achieve these rates with exponentially vanishing trace-distance leakage, using sandwiched Rényi bounds. Uniform outer randomization permits restricting the comparison-state optimization to invariant states. For the Tikku–Berta–Renes binary channel, with a BSC to Bob and pure states to Eve, three- and four-use numerical encoders improve on numerical estimates of optimized noisy repetition. Maximum absolute gains are $7.76\times10^{-6}$ and $2.06\times10^{-5}$ nats/use on the tested grid. An explicit two-use encoder at $p=0.1242$ rigorously achieves between $10^{-6}$ and $1.1\times10^{-6}$ nats/use while $C^{(1)}=0$, established through analytic convexity and rational entropy enclosures; nonadditivity for this model was already known. The encoder family is not proved generally optimal, and benchmark comparisons are numerical rather than certified global optimizations. The optical interpretation assumes Bob fixes a symbol-by-symbol measurement, not unrestricted collective quantum reception.

Little sign of AI-generated textIncremental

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

Related papers

Relative-Entropy Geometry and Convergence in Nonconvex Wiretap Optimization

Farzin Salek, Masahito Hayashi

We develop and analyze an entropic descent method for a nonconvex optimization problem on probability simplices arising in classical and quantum secure communication. The optimization variables describe a randomized encoder, allowing its input distribution and stochastic preprocessing to be optimized jointly. An exact relative-entropy identity yields a channel-independent majorization bound and an explicit mirror-descent iteration with a fixed unit step size. We establish quantitative descent, convergence of objective values, and stationarity of accumulation points on their support faces for arbitrary finite classical channels, without assuming degradedness or less noisiness. For strictly positive transition matrices, a square-root parametrization and a Kurdyka--Łojasiewicz argument establish finite length of the transformed trajectory and convergence of the entire sequence, including limits on the simplex boundary. For less-noisy channels, a restricted convex formulation admits global convergence with an explicit \(O(1/t)\) objective-error bound. We extend the relative-entropy construction to noncommuting quantum outputs and derive monotone alternating updates for covariant encoders, including correlated preprocessing over a fixed block. Numerical experiments compare the method with analytic benchmarks and constrained optimization, reveal multiple attracting values, and demonstrate strict improvements from stochastic preprocessing.

quant-pharXiv:2610.18785•Oct 14, 2026•0 citations

From Permutation Symmetry to Communication Bounds and Additivity

Zahra Baghali Khanian, Debbie Leung, Graeme Smith

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.

quant-pharXiv:2610.02176•Oct 2, 2026•0 citations

An exponential strong converse for private communication over degradable quantum channels

Mark M. Wilde

We prove an exponential strong converse for the unassisted private capacity of every finite-dimensional degradable quantum channel. We use a single error criterion: the infidelity between the actual message-estimate-environment state and an ideal state consisting of uniformly distributed, perfectly correlated messages that are independent of the environment. At every rate strictly above the channel's maximum coherent information, the optimized fidelity to this ideal state decays exponentially in the number of channel uses. The same bound holds when the ideal environment state is fixed to the actual environment marginal. The proof applies to arbitrary mixed-state encoders and arbitrary collective decoders. Its main operator ingredient is an overlap bound for privacy tests: two receiver placements with a common subsystem of dimension $d_C$ have overlap at most $d_C/M$, where $M$ is the key size, independently of both shield dimensions. We combine this bound with the signed averaging construction presented in arXiv:2608.01308 and a single-filter reduction to symmetric states. A Gaussian filter replaces the common receiver subsystem by a system of controlled dimension from which the original correlations can be approximately recovered using quantum side information. The filter preserves exact exchange symmetry, and a uniform smooth-entropy estimate bounds its output dimension for arbitrary correlated channel inputs. We also obtain an exponential strong converse at zero for antidegradable channels under the same joint criterion and, consequently, for the private capacity of the quantum erasure channel throughout its parameter range.

quant-pharXiv:2609.32515•Sep 29, 2026•2 citations

Classical communication through phase-sensitive thermal qubit noise

Zixuan He

When a thermal environment damps the two transverse components of a qubit differently, can entangling signals across many channel uses improve the classical communication rate? This article gives a complete coding answer for an explicit phase-sensitive class and determines the optimal exponential cost of transmitting above capacity. Physical model and communication permissions. The channel acts as \[\mathcal N\!\begin{pmatrix}\rho_0&X\\X^*&\rho_1\end{pmatrix}=\begin{pmatrix}a\rho_0+b\rho_1&kX+\ell X^*\\kX^*+\ell X&c\rho_0+d\rho_1\end{pmatrix}.\] All coefficients are nonnegative, \(a+c=b+d=1\), and the main class satisfies \[k\ge\ell\ge0,\qquad ad-bc=k^2-\ell^2,\qquad bc\ge\ell(k+\ell).\] The class contains actual squeezed thermal reservoirs, including nonunital channels that are not entanglement breaking. The coding model is unassisted and memoryless, without feedback; arbitrary entangled block codewords and collective decoding are allowed. The coefficient condition is a sufficient region, not a classification of every physically allowed squeezed bath. An exact capacity from one-use data. Write \(h_2\) for binary entropy in bits, \(q\) for the excited-state input population, and define \[t(q)=c+(d-c)q,\qquad s_x(q)=h_2\!\left(\frac{1+\sqrt{[1-2t(q)]^2+4(k+\ell)^2q(1-q)}}{2}\right).\] With \(\operatorname{co}s_x\) the lower convex envelope on \([0,1]\), the unrestricted capacity is \[C(\mathcal N)=\chi(\mathcal N)=\max_{0\le q\le1}\{h_2[t(q)]-(\operatorname{co}s_x)(q)\}.\] At most two opposite-real-phase signal pairs, hence at most four pure signals, attain the one-use optimum. The convex envelope retains optimization over all ensembles. Holevo information is additive with every finite-dimensional channel partner, so arbitrarily long entangled encodings cannot exceed this rate. The best success exponent above capacity. Let \(P_n^\star(R)\) be the optimal average success probability over all \(n\)-use codes with at least \(\lceil2^{nR}\rceil\) messages. For \(R>C(\mathcal N)\), \[E_{\rm sc}(R,\mathcal N)=\lim_{n\to\infty}-\frac1n\log_2P_n^\star(R)=\sup_{\alpha>1}\frac{\alpha-1}{\alpha}\,[R-\widetilde\chi_\alpha(\mathcal N)].\] Here \(\widetilde\chi_\alpha\) is the sandwiched Rényi information radius, reduced in the paper to a scalar reference/population optimization. It is strongly additive at every real \(\alpha>1\). Product codewords with collective decoding attain the asymptotic exponent, while the converse covers arbitrary entangled codewords. The finite-block inequality \(P_n^\star(R)\le2^{-nE_{\rm sc}}\) is an upper bound, not a finite-block equality. Why the reduction works. Normal and reversed positive block factors retain the same quantum source and admit a common scalar Gram bound. This yields maximum-output norm multiplicativity with arbitrary completely positive partners and unnormalized diagonal filters. Binary phase symmetry then suffices to make the information-radius reference diagonal, even though continuous phase covariance is absent. The same input-filter comparison also determines the formation cost of the specified diagonal-input Stinespring states across the output and the full purified environment. Relation to existing results. We independently obtained the additivity and strong-converse results for the axially symmetric Davies family that are also established by L. Eriksson, Capacities, strong-converse exponents and complementary simulation for qubit Davies channels, version 3, 26 October 2026. These results and their proofs are retained as a reference case. The phase-sensitive class and the full axial Davies class share the generalized-amplitude-damping boundary; neither is presented as a strict enlargement of the other. Fang's triangular norm-compression theorem and the general information-radius and coding theorems retain their attribution. The 16-page integrated article contains the full proofs, two figure groups and references. The figures separate the physical parameter region, the globally evaluated capacity formula and explicit finite-block success upper bounds.

•Oct 26, 2026•0 citations

Classical-quantum arbitrarily varying wiretap channel: Secret message transmission under jamming attacks

Holger Boche, Minglai Cai, Christian Deppe +1 more

We analyze arbitrarily varying classical-quantum wiretap channels. These channels are subject to two attacks at the same time: one passive (eavesdropping) and one active (jamming). We elaborate on our previous studies [H. Boche et al., Quantum Inf. Process. 15(11), 4853–4895 (2016) and H. Boche et al., Quantum Inf. Process. 16(1), 1–48 (2016)] by introducing a reduced class of allowable codes that fulfills a more stringent secrecy requirement than earlier definitions. In addition, we prove that non-symmetrizability of the legal link is sufficient for equality of the deterministic and the common randomness assisted secrecy capacities. Finally, we focus on analytic properties of both secrecy capacities: We completely characterize their discontinuity points and their super-activation properties.

arXiv:1702.03483•Journal of Mathematical Physics•Oct 1, 2017•19 citations

Classical-quantum arbitrarily varying wiretap channel: Secret message transmission under jamming attacks

Holger Boche, Minglai Cai, Christian Deppe +1 more

We analyze arbitrarily varying classical-quantum wiretap channels. These channels are subject to two attacks at the same time: one passive (eavesdropping), and one active (jamming). We progress on previous works [5] and [6] by introducing a reduced class of allowed codes that fulfills a more stringent secrecy requirement than earlier definitions. In addition, we prove that non-symmetrizability of the legal link is sufficient for equality of the deterministic and the common randomness assisted secrecy capacities. At last, we focus on analytic properties of both secrecy capacities: We completely characterize their discontinuity points, and their super-activation properties.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2017•4 citations
For classical--quantum wiretap channels with a transitive covariant input action, both output ensembles admit a description as unitary group orbits of fixed seed states. We use this structure to construct finite-block preprocessing schemes whose private information is an entropy difference evaluated at two distributions related by group convolution. Applying the construction to product groups allows correlations across any fixed number of channel uses. We give a sufficient condition for the associated uniform-input bound to equal the single-use private information. Constant-composition channel codes and universal2_22​ hashing achieve the resulting rates, with trace-distance leakage controlled by sandwiched Rényi information. For uniform outer randomization, the representation structure reduces the comparison-state optimization to Eve's invariant states. For the hybrid binary channel considered by Tikku, Berta and Renes, numerical optimization at three and four uses gives rates above our numerical estimate of the optimized noisy-repetition benchmark wherever that estimate is positive on the tested grid. The improvement comes from noise distributions beyond the family of independent physical flips and a symmetric logical flip. We also prove nonadditivity at an explicit channel parameter using a two-use encoder, an analytic single-use converse, and certified entropy bounds. Finally, we relate the hybrid model to binary phase-shift keying with a fixed receiver measurement.
The paper studies how input symmetry can organize correlated randomized encoders for classical–quantum wiretap channels, whose private information can be nonadditive. For a transitive finite-group action, both output ensembles are unitary orbits. Taking independent V∼P3V\sim P_3V∼P3​ and Z∼P1Z\sim P_1Z∼P1​ and transmitting X=VZX=VZX=VZ gives the identity I(V;B)−I(V;E)=Δ(P3∗P1)−Δ(P1)I(V;B)-I(V;E)=\Delta(P_3*P_1)-\Delta(P_1)I(V;B)−I(V;E)=Δ(P3​∗P1​)−Δ(P1​), where Δ(P)\Delta(P)Δ(P) is the difference of Bob’s and Eve’s average-output entropies. Applying this construction on GnG^nGn permits correlated finite-block preprocessing. Uniform P3P_3P3​ yields Δ(Pu)−min⁡PΔ(P)\Delta(P_u)-\min_P\Delta(P)Δ(Pu​)−minP​Δ(P), which equals the single-use private information if PuP_uPu​ maximizes Δ\DeltaΔ.
Constant-composition cq coding and balanced universal2_22​ hashing achieve these rates with exponentially vanishing trace-distance leakage, using sandwiched Rényi bounds. Uniform outer randomization permits restricting the comparison-state optimization to invariant states.
For the Tikku–Berta–Renes binary channel, with a BSC to Bob and pure states to Eve, three- and four-use numerical encoders improve on numerical estimates of optimized noisy repetition. Maximum absolute gains are 7.76×10−67.76\times10^{-6}7.76×10−6 and 2.06×10−52.06\times10^{-5}2.06×10−5 nats/use on the tested grid. An explicit two-use encoder at p=0.1242p=0.1242p=0.1242 rigorously achieves between 10−610^{-6}10−6 and 1.1×10−61.1\times10^{-6}1.1×10−6 nats/use while C(1)=0C^{(1)}=0C(1)=0, established through analytic convexity and rational entropy enclosures; nonadditivity for this model was already known.
The encoder family is not proved generally optimal, and benchmark comparisons are numerical rather than certified global optimizations. The optical interpretation assumes Bob fixes a symbol-by-symbol measurement, not unrestricted collective quantum reception.
We develop and analyze an entropic descent method for a nonconvex optimization problem on probability simplices arising in classical and quantum secure communication. The optimization variables describe a randomized encoder, allowing its input distribution and stochastic preprocessing to be optimized jointly. An exact relative-entropy identity yields a channel-independent majorization bound and an explicit mirror-descent iteration with a fixed unit step size. We establish quantitative descent, convergence of objective values, and stationarity of accumulation points on their support faces for arbitrary finite classical channels, without assuming degradedness or less noisiness. For strictly positive transition matrices, a square-root parametrization and a Kurdyka--Łojasiewicz argument establish finite length of the transformed trajectory and convergence of the entire sequence, including limits on the simplex boundary. For less-noisy channels, a restricted convex formulation admits global convergence with an explicit O(1/t)O(1/t)O(1/t) objective-error bound. We extend the relative-entropy construction to noncommuting quantum outputs and derive monotone alternating updates for covariant encoders, including correlated preprocessing over a fixed block. Numerical experiments compare the method with analytic benchmarks and constrained optimization, reveal multiple attracting values, and demonstrate strict improvements from stochastic preprocessing.
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.
We prove an exponential strong converse for the unassisted private capacity of every finite-dimensional degradable quantum channel. We use a single error criterion: the infidelity between the actual message-estimate-environment state and an ideal state consisting of uniformly distributed, perfectly correlated messages that are independent of the environment. At every rate strictly above the channel's maximum coherent information, the optimized fidelity to this ideal state decays exponentially in the number of channel uses. The same bound holds when the ideal environment state is fixed to the actual environment marginal. The proof applies to arbitrary mixed-state encoders and arbitrary collective decoders. Its main operator ingredient is an overlap bound for privacy tests: two receiver placements with a common subsystem of dimension dCd_CdC​ have overlap at most dC/Md_C/MdC​/M, where MMM is the key size, independently of both shield dimensions. We combine this bound with the signed averaging construction presented in arXiv:2608.01308 and a single-filter reduction to symmetric states. A Gaussian filter replaces the common receiver subsystem by a system of controlled dimension from which the original correlations can be approximately recovered using quantum side information. The filter preserves exact exchange symmetry, and a uniform smooth-entropy estimate bounds its output dimension for arbitrary correlated channel inputs. We also obtain an exponential strong converse at zero for antidegradable channels under the same joint criterion and, consequently, for the private capacity of the quantum erasure channel throughout its parameter range.
When a thermal environment damps the two transverse components of a qubit differently, can entangling signals across many channel uses improve the classical communication rate? This article gives a complete coding answer for an explicit phase-sensitive class and determines the optimal exponential cost of transmitting above capacity. Physical model and communication permissions. The channel acts as N ⁣(ρ0XX∗ρ1)=(aρ0+bρ1kX+ℓX∗kX∗+ℓXcρ0+dρ1).\mathcal N\!\begin{pmatrix}\rho_0&X\\X^*&\rho_1\end{pmatrix}=\begin{pmatrix}a\rho_0+b\rho_1&kX+\ell X^*\\kX^*+\ell X&c\rho_0+d\rho_1\end{pmatrix}.N(ρ0​X∗​Xρ1​​)=(aρ0​+bρ1​kX∗+ℓX​kX+ℓX∗cρ0​+dρ1​​). All coefficients are nonnegative, a+c=b+d=1a+c=b+d=1a+c=b+d=1, and the main class satisfies k≥ℓ≥0,ad−bc=k2−ℓ2,bc≥ℓ(k+ℓ).k\ge\ell\ge0,\qquad ad-bc=k^2-\ell^2,\qquad bc\ge\ell(k+\ell).k≥ℓ≥0,ad−bc=k2−ℓ2,bc≥ℓ(k+ℓ). The class contains actual squeezed thermal reservoirs, including nonunital channels that are not entanglement breaking. The coding model is unassisted and memoryless, without feedback; arbitrary entangled block codewords and collective decoding are allowed. The coefficient condition is a sufficient region, not a classification of every physically allowed squeezed bath. An exact capacity from one-use data. Write h2h_2h2​ for binary entropy in bits, qqq for the excited-state input population, and define t(q)=c+(d−c)q,sx(q)=h2 ⁣(1+[1−2t(q)]2+4(k+ℓ)2q(1−q)2).t(q)=c+(d-c)q,\qquad s_x(q)=h_2\!\left(\frac{1+\sqrt{[1-2t(q)]^2+4(k+\ell)^2q(1-q)}}{2}\right).t(q)=c+(d−c)q,sx​(q)=h2​(21+[1−2t(q)]2+4(k+ℓ)2q(1−q)​​). With co⁡sx\operatorname{co}s_xcosx​ the lower convex envelope on [0,1][0,1][0,1], the unrestricted capacity is C(N)=χ(N)=max⁡0≤q≤1{h2[t(q)]−(co⁡sx)(q)}.C(\mathcal N)=\chi(\mathcal N)=\max_{0\le q\le1}\{h_2[t(q)]-(\operatorname{co}s_x)(q)\}.C(N)=χ(N)=max0≤q≤1​{h2​[t(q)]−(cosx​)(q)}. At most two opposite-real-phase signal pairs, hence at most four pure signals, attain the one-use optimum. The convex envelope retains optimization over all ensembles. Holevo information is additive with every finite-dimensional channel partner, so arbitrarily long entangled encodings cannot exceed this rate. The best success exponent above capacity. Let Pn⋆(R)P_n^\star(R)Pn⋆​(R) be the optimal average success probability over all nnn-use codes with at least ⌈2nR⌉\lceil2^{nR}\rceil⌈2nR⌉ messages. For R>C(N)R>C(\mathcal N)R>C(N), Esc(R,N)=lim⁡n→∞−1nlog⁡2Pn⋆(R)=sup⁡α>1α−1α [R−χ~α(N)].E_{\rm sc}(R,\mathcal N)=\lim_{n\to\infty}-\frac1n\log_2P_n^\star(R)=\sup_{\alpha>1}\frac{\alpha-1}{\alpha}\,[R-\widetilde\chi_\alpha(\mathcal N)].Esc​(R,N)=limn→∞​−n1​log2​Pn⋆​(R)=supα>1​αα−1​[R−χ​α​(N)]. Here χ~α\widetilde\chi_\alphaχ​α​ is the sandwiched Rényi information radius, reduced in the paper to a scalar reference/population optimization. It is strongly additive at every real α>1\alpha>1α>1. Product codewords with collective decoding attain the asymptotic exponent, while the converse covers arbitrary entangled codewords. The finite-block inequality Pn⋆(R)≤2−nEscP_n^\star(R)\le2^{-nE_{\rm sc}}Pn⋆​(R)≤2−nEsc​ is an upper bound, not a finite-block equality. Why the reduction works. Normal and reversed positive block factors retain the same quantum source and admit a common scalar Gram bound. This yields maximum-output norm multiplicativity with arbitrary completely positive partners and unnormalized diagonal filters. Binary phase symmetry then suffices to make the information-radius reference diagonal, even though continuous phase covariance is absent. The same input-filter comparison also determines the formation cost of the specified diagonal-input Stinespring states across the output and the full purified environment. Relation to existing results. We independently obtained the additivity and strong-converse results for the axially symmetric Davies family that are also established by L. Eriksson, Capacities, strong-converse exponents and complementary simulation for qubit Davies channels, version 3, 26 October 2026. These results and their proofs are retained as a reference case. The phase-sensitive class and the full axial Davies class share the generalized-amplitude-damping boundary; neither is presented as a strict enlargement of the other. Fang's triangular norm-compression theorem and the general information-radius and coding theorems retain their attribution. The 16-page integrated article contains the full proofs, two figure groups and references. The figures separate the physical parameter region, the globally evaluated capacity formula and explicit finite-block success upper bounds.
We analyze arbitrarily varying classical-quantum wiretap channels. These channels are subject to two attacks at the same time: one passive (eavesdropping) and one active (jamming). We elaborate on our previous studies [H. Boche et al., Quantum Inf. Process. 15(11), 4853–4895 (2016) and H. Boche et al., Quantum Inf. Process. 16(1), 1–48 (2016)] by introducing a reduced class of allowable codes that fulfills a more stringent secrecy requirement than earlier definitions. In addition, we prove that non-symmetrizability of the legal link is sufficient for equality of the deterministic and the common randomness assisted secrecy capacities. Finally, we focus on analytic properties of both secrecy capacities: We completely characterize their discontinuity points and their super-activation properties.
We analyze arbitrarily varying classical-quantum wiretap channels. These channels are subject to two attacks at the same time: one passive (eavesdropping), and one active (jamming). We progress on previous works [5] and [6] by introducing a reduced class of allowed codes that fulfills a more stringent secrecy requirement than earlier definitions. In addition, we prove that non-symmetrizability of the legal link is sufficient for equality of the deterministic and the common randomness assisted secrecy capacities. At last, we focus on analytic properties of both secrecy capacities: We completely characterize their discontinuity points, and their super-activation properties.