Strong Converse Exponent for Entanglement-Assisted Communication

• URL: http://arxiv.org/abs/2209.00555v3
• Date: Thu, 27 Jun 2024 09:58:26 GMT
• Title: Strong Converse Exponent for Entanglement-Assisted Communication
• Authors: Ke Li, Yongsheng Yao,
• Abstract summary: We determine the exact strong converse exponent for entanglement-assisted classical communication of a quantum channel. It can be easily extended to deal with the transmission of quantum information under the assistance of entanglement or quantum feedback.
• Score: 5.8303977553652
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We determine the exact strong converse exponent for entanglement-assisted classical communication of a quantum channel. Our main contribution is the derivation of an upper bound for the strong converse exponent which is characterized by the sandwiched R\'enyi divergence. It turns out that this upper bound coincides with the lower bound of Gupta and Wilde (Commun. Math. Phys. 334:867-887, 2015). Thus, the strong converse exponent follows from the combination of these two bounds. Our result has two implications. Firstly, it implies that the exponential bound for the strong converse property of quantum-feedback-assisted classical communication, derived by Cooney, Mosonyi and Wilde (Commun. Math. Phys. 344:797-829, 2016), is optimal. This answers their open question in the affirmative. Hence, we have determined the exact strong converse exponent for this problem as well. Secondly, due to an observation of Leung and Matthews, it can be easily extended to deal with the transmission of quantum information under the assistance of entanglement or quantum feedback, yielding similar results. The above findings provide, for the first time, a complete operational interpretation to the channel's sandwiched R\'enyi information of order $\alpha > 1$.

Related papers

• Strong converse Exponents of Partially Smoothed Information Measures [5.371337604556312]
  We find that the strong converse exponents based on trace distance takes different forms between pure and classical states.<n>We derive the strong converse exponents for quantum data compression, intrinsic randomness extraction, and classical state splitting.
  arXiv  Detail & Related papers  (2025-05-09T13:44:28Z)
• On Strong Converse Theorems for Quantum Hypothesis Testing and Channel Coding [16.207627554776916]
  Strong converse theorems refer to the study of impossibility results in information theory. Mosonyi and Ogawa established a one-shot strong converse bound for quantum hypothesis testing. We show that the variational expression of measured R'enyi divergences is a direct consequence of H"older's inequality.
  arXiv  Detail & Related papers  (2024-03-20T13:34:23Z)
• Adversarial Quantum Machine Learning: An Information-Theoretic Generalization Analysis [39.889087719322184]
  We study the generalization properties of quantum classifiers adversarially trained against bounded-norm white-box attacks. We derive novel information-theoretic upper bounds on the generalization error of adversarially trained quantum classifiers.
  arXiv  Detail & Related papers  (2024-01-31T21:07:43Z)
• Robust spectral $\pi$ pairing in the random-field Floquet quantum Ising model [44.84660857803376]
  We study level pairings in the many-body spectrum of the random-field Floquet quantum Ising model. The robustness of $pi$ pairings against longitudinal disorder may be useful for quantum information processing.
  arXiv  Detail & Related papers  (2024-01-09T20:37:48Z)
• Dilute neutron star matter from neural-network quantum states [58.720142291102135]
  Low-density neutron matter is characterized by the formation of Cooper pairs and the onset of superfluidity. We model this density regime by capitalizing on the expressivity of the hidden-nucleon neural-network quantum states combined with variational Monte Carlo and reconfiguration techniques.
  arXiv  Detail & Related papers  (2022-12-08T17:55:25Z)
• Operational Interpretation of the Sandwiched Rényi Divergence of Order 1/2 to 1 as Strong Converse Exponents [5.8303977553652]
  We provide the sandwiched R'enyi divergence of order $alphain(frac12,1)$, as well as its induced quantum information quantities. Specifically, we consider (a) smoothing of the max-relative entropy, (b) quantum privacy amplification, and (c) quantum information decoupling. Results are given in terms of the sandwiched R'enyi divergence of order $alphain(frac12,1)$, and its induced quantum R'enyi conditional entropy and quantum R'enyi mutual information
  arXiv  Detail & Related papers  (2022-09-01T15:57:10Z)
• Exact solution of a family of staggered Heisenberg chains with conclusive pretty good quantum state transfer [68.8204255655161]
  We work out the exact solutions in the one-excitation subspace. We present numerical evidence that pretty good transmission is achieved by chains whose length is not a power of two.
  arXiv  Detail & Related papers  (2022-06-28T18:31:09Z)
• Cone-Restricted Information Theory [4.358456799125693]
  We show which results in quantum information theory rely upon the positive semidefinite cone and which can be generalized. We present parallel results for the extended conditional min-entropy. In doing so, we extend the notion of k-superpositive channels to superchannels.
  arXiv  Detail & Related papers  (2022-06-09T06:27:48Z)
• Total insecurity of communication via strong converse for quantum privacy amplification [7.741539072749043]
  We show that the eavesdropper can infer any sent messages with certainty, when given very limited extra information. We prove that in the strong converse region, the eavesdropper has an exponential advantage inferring the sent message correctly, compared to the achievability region.
  arXiv  Detail & Related papers  (2022-02-22T18:34:59Z)
• Reliable Simulation of Quantum Channels: the Error Exponent [5.8303977553652]
  We study the error exponent of quantum channel simulation, which characterizes the optimal speed of exponential convergence. We obtain an achievability bound for quantum channel simulation in the finite-blocklength setting.
  arXiv  Detail & Related papers  (2021-12-08T18:55:54Z)
• Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification [56.61325554836984]
  The max-relative entropy together with its smoothed version is a basic tool in quantum information theory. We derive the exact exponent for the decay of the small modification of the quantum state in smoothing the max-relative entropy based on purified distance.
  arXiv  Detail & Related papers  (2021-11-01T16:35:41Z)
• Permutation Enhances Classical Communication Assisted by Entangled States [67.12391801199688]
  We show that the capacity satisfies the strong converse property and thus the formula serves as a sharp dividing line between achievable and unachievable rates of communication. As examples, we derive analytically the classical capacity of various quantum channels of interests.
  arXiv  Detail & Related papers  (2020-01-07T01:49:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.