Efficient approximation of regularized relative entropies and applications

• URL: http://arxiv.org/abs/2502.15659v1
• Date: Fri, 21 Feb 2025 18:29:45 GMT
• Title: Efficient approximation of regularized relative entropies and applications
• Authors: Kun Fang, Hamza Fawzi, Omar Fawzi,
• Abstract summary: We show that the regularized relative entropy can be efficiently approximated within an additive error by a quantum relative entropy program of size.<n>This applies to particular to the regularized relative entropy in adversarial quantum channel discrimination.<n>In particular, when the set of interest does not directly satisfy the required structural assumptions, it can be relaxed to one that does.
• Score: 11.59751616011475
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The quantum relative entropy is a fundamental quantity in quantum information science, characterizing the distinguishability between two quantum states. However, this quantity is not additive in general for correlated quantum states, necessitating regularization for precise characterization of the operational tasks of interest. Recently, we proposed the study of the regularized relative entropy between two sequences of sets of quantum states in [arXiv:2411.04035], which captures a general framework for a wide range of quantum information tasks. Here, we show that given suitable structural assumptions and efficient descriptions of the sets, the regularized relative entropy can be efficiently approximated within an additive error by a quantum relative entropy program of polynomial size. This applies in particular to the regularized relative entropy in adversarial quantum channel discrimination. Moreover, we apply the idea of efficient approximation to quantum resource theories. In particular, when the set of interest does not directly satisfy the required structural assumptions, it can be relaxed to one that does. This provides improved and efficient bounds for the entanglement cost of quantum states and channels, entanglement distillation and magic state distillation. Numerical results demonstrate improvements even for the first level of approximation.

Related papers

• Generalized quantum asymptotic equipartition [11.59751616011475]
  We prove that all operationally relevant divergences converge to the quantum relative entropy between two sets of quantum states.<n>We give three applications of this result: (i) The generalized AEP directly implies a new generalized quantum Stein's lemma for conducting quantum hypothesis testing between two sets of quantum states.<n>We derive a relative entropy accumulation theorem stating that the smoothed min-relative entropy between two sequential processes of quantum channels can be lower bounded by the sum of the regularized minimum output channel divergences.
  arXiv  Detail & Related papers  (2024-11-06T16:33:16Z)
• Exploiting Structure in Quantum Relative Entropy Programs [6.281229317487581]
  We show how common structures arising from applications in quantum information theory can be exploited to improve the efficiency of solving quantum relative entropy programs. Our numerical results show that these techniques improve computation times by up to several orders of magnitude, and allow previously intractable problems to be solved.
  arXiv  Detail & Related papers  (2024-06-28T21:37:45Z)
• Universality of critical dynamics with finite entanglement [68.8204255655161]
  We study how low-energy dynamics of quantum systems near criticality are modified by finite entanglement. Our result establishes the precise role played by entanglement in time-dependent critical phenomena.
  arXiv  Detail & Related papers  (2023-01-23T19:23:54Z)
• Overcoming entropic limitations on asymptotic state transformations through probabilistic protocols [12.461503242570641]
  We show that it is no longer the case when one allows protocols that may only succeed with some probability. We show that this is no longer the case when one allows protocols that may only succeed with some probability.
  arXiv  Detail & Related papers  (2022-09-07T18:00:00Z)
• 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)
• Entanglement catalysis for quantum states and noisy channels [41.94295877935867]
  We investigate properties of entanglement and its role for quantum communication. For transformations between bipartite pure states, we prove the existence of a universal catalyst. We further develop methods to estimate the number of singlets which can be established via a noisy quantum channel.
  arXiv  Detail & Related papers  (2022-02-10T18:36:25Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• 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)
• Bounding generalized relative entropies: Nonasymptotic quantum speed limits [0.0]
  Information theory has become an increasingly important research field to better understand quantum mechanics. Relative entropy quantifies how difficult is to tell apart two probability distributions, or even two quantum states. We show how this quantity changes under a quantum process.
  arXiv  Detail & Related papers  (2020-08-27T15:37:04Z)
• Entropic Uncertainty Relations and the Quantum-to-Classical transition [77.34726150561087]
  We aim to shed some light on the quantum-to-classical transition as seen through the analysis of uncertainty relations. We employ entropic uncertainty relations to show that it is only by the inclusion of imprecision in our model of macroscopic measurements that we can prepare a system with two simultaneously well-defined quantities.
  arXiv  Detail & Related papers  (2020-03-04T14:01:17Z)
• Quantum Statistical Complexity Measure as a Signalling of Correlation Transitions [55.41644538483948]
  We introduce a quantum version for the statistical complexity measure, in the context of quantum information theory, and use it as a signalling function of quantum order-disorder transitions. We apply our measure to two exactly solvable Hamiltonian models, namely: the $1D$-Quantum Ising Model and the Heisenberg XXZ spin-$1/2$ chain. We also compute this measure for one-qubit and two-qubit reduced states for the considered models, and analyse its behaviour across its quantum phase transitions for finite system sizes as well as in the thermodynamic limit by using Bethe ansatz.
  arXiv  Detail & Related papers  (2020-02-05T00:45:21Z)

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.