Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification

• URL: http://arxiv.org/abs/2111.01075v3
• Date: Thu, 1 Jun 2023 15:33:41 GMT
• Title: Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification
• Authors: Ke Li, Yongsheng Yao, Masahito Hayashi
• Abstract summary: 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.
• Score: 56.61325554836984
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The max-relative entropy together with its smoothed version is a basic tool in quantum information theory. In this paper, we derive the exact exponent for the asymptotic decay of the small modification of the quantum state in smoothing the max-relative entropy based on purified distance. We then apply this result to the problem of privacy amplification against quantum side information, and we obtain an upper bound for the exponent of the asymptotic decreasing of the insecurity, measured using either purified distance or relative entropy. Our upper bound complements the earlier lower bound established by Hayashi, and the two bounds match when the rate of randomness extraction is above a critical value. Thus, for the case of high rate, we have determined the exact security exponent. Following this, we give examples and show that in the low-rate case, neither the upper bound nor the lower bound is tight in general. This exhibits a picture similar to that of the error exponent in channel coding. Lastly, we investigate the asymptotics of equivocation and its exponent under the security measure using the sandwiched R\'enyi divergence of order $s\in (1,2]$, which has not been addressed previously in the quantum setting.

Related papers

• The Limits of Pure Exploration in POMDPs: When the Observation Entropy is Enough [40.82741665804367]
  We study a simple approach of maximizing the entropy over observations in place true latent states. We show how knowledge of the latter can be exploited to compute a regularization of the observation entropy to improve principled performance.
  arXiv  Detail & Related papers  (2024-06-18T17:00:13Z)
• Entanglement entropy in quantum black holes [2.3301643766310374]
  We discuss the entanglement entropy for a massive Klein-Gordon field in two Schwarzschild-like quantum black hole spacetimes. We estimate the free parameters for such quantum metrics through a simple physical argument based on Heisenberg uncertainty principle. Our findings reveal a significant decrease in entropy compared to the area law near the origin for the quantum metrics.
  arXiv  Detail & Related papers  (2024-03-31T15:19:03Z)
• Analyzing Prospects for Quantum Advantage in Topological Data Analysis [35.423446067065576]
  We analyze and optimize an improved quantum algorithm for topological data analysis. We show that super-quadratic quantum speedups are only possible when targeting a multiplicative error approximation. We argue that quantum circuits with tens of billions of Toffoli can solve seemingly classically intractable instances.
  arXiv  Detail & Related papers  (2022-09-27T17:56:15Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Optimal Second-Order Rates for Quantum Soft Covering and Privacy Amplification [19.624719072006936]
  We study quantum soft covering and privacy amplification against quantum side information. For both tasks, we use trace distance to measure the closeness between the processed state and the ideal target state. Our results extend to the moderate deviation regime, which are the optimal rates when the trace distances vanish at sub-exponential speed.
  arXiv  Detail & Related papers  (2022-02-23T16:02:31Z)
• Sharp Bounds for Federated Averaging (Local SGD) and Continuous Perspective [49.17352150219212]
  Federated AveragingFedAvg, also known as Local SGD, is one of the most popular algorithms in Federated Learning (FL) We show how to analyze this quantity from the Differential Equation (SDE) perspective.
  arXiv  Detail & Related papers  (2021-11-05T22:16:11Z)
• Optimized quantum f-divergences [6.345523830122166]
  I introduce the optimized quantum f-divergence as a related generalization of quantum relative entropy. I prove that it satisfies the data processing inequality, and the method of proof relies upon the operator Jensen inequality. One benefit of this approach is that there is now a single, unified approach for establishing the data processing inequality for the Petz--Renyi and sandwiched Renyi relative entropies.
  arXiv  Detail & Related papers  (2021-03-31T04:15:52Z)
• Catalytic Transformations of Pure Entangled States [62.997667081978825]
  Entanglement entropy is the von Neumann entropy of quantum entanglement of pure states. The relation between entanglement entropy and entanglement distillation has been known only for the setting, and the meaning of entanglement entropy in the single-copy regime has so far remained open. Our results imply that entanglement entropy quantifies the amount of entanglement available in a bipartite pure state to be used for quantum information processing, giving results an operational meaning also in entangled single-copy setup.
  arXiv  Detail & Related papers  (2021-02-22T16:05:01Z)
• Tightening the tripartite quantum memory assisted entropic uncertainty relation [0.0]
  In quantum information theory, Shannon entropy has been used as an appropriate measure to express the uncertainty relation. One can extend the bipartite quantum memory assisted entropic uncertainty relation to tripartite quantum memory assisted uncertainty relation.
  arXiv  Detail & Related papers  (2020-05-05T12:51:25Z)
• Improved tripartite uncertainty relation with quantum memory [5.43508370077166]
  Uncertainty principle is a striking and fundamental feature in quantum mechanics. In quantum information theory, this uncertainty principle is popularly formulized in terms of entropy. We present an improvement of tripartite quantum-memory-assisted entropic uncertainty relation.
  arXiv  Detail & Related papers  (2020-04-09T03:54:51Z)

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.