Chain rules for quantum Rényi entropies

• URL: http://arxiv.org/abs/1410.5455v4
• Date: Mon, 23 Jun 2025 16:22:56 GMT
• Title: Chain rules for quantum Rényi entropies
• Authors: Frédéric Dupuis,
• Abstract summary: We prove analogues of the equation $H(AB|C) = H(A|BC) + H(B|C)$, which holds as an identity for the von Neumann conditional entropy.<n>In the case of the R'enyi entropy, this relation no longer holds as an equality, but survives as an inequality of the form $H_alpha(AB|C) geqslant H_beta(A|BC) + H_gamma(B|C)$.
• Score: 2.1756081703276
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present chain rules for a new definition of the quantum R\'enyi conditional entropy sometimes called the "sandwiched" R\'enyi conditional entropy. More precisely, we prove analogues of the equation $H(AB|C) = H(A|BC) + H(B|C)$, which holds as an identity for the von Neumann conditional entropy. In the case of the R\'enyi entropy, this relation no longer holds as an equality, but survives as an inequality of the form $H_{\alpha}(AB|C) \geqslant H_{\beta}(A|BC) + H_{\gamma}(B|C)$, where the parameters $\alpha, \beta, \gamma$ obey the relation $\frac{\alpha}{\alpha-1} = \frac{\beta}{\beta-1} + \frac{\gamma}{\gamma-1}$ and $(\alpha-1)(\beta-1)(\gamma-1) > 0$; if $(\alpha-1)(\beta-1)(\gamma-1) < 0$, the direction of the inequality is reversed.

Related papers

• Monotonicity of the von Neumann Entropy under Quantum Convolution [3.130722489512822]
  In the classical case, it has been shown that the whole sequence of entropies of the normalized sums of i.i.d.random variables is monotonically increasing.<n>We prove generalizations of the quantum entropy power inequality, enabling us to compare the von Neumann entropy of the $n$-fold symmetric convolution of $n$ arbitrary states.<n>We propose a quantum-classical version of this entropy power inequality, which helps us better understand the behavior of the von Neumann entropy under the convolution action between a quantum state and a classical random variable.
  arXiv  Detail & Related papers  (2025-04-03T01:45:45Z)
• Note on Von Neumann Entropy and the Ordering of Inverse Temperatures [0.0]
  von Neumann entropy is a monotonically increasing function of temperature.<n>rho_beta$ for a given Hamiltonian $H$ satisfies $S(rho_beta) geq S(rho_beta) iff beta_1 leq beta_2$.
  arXiv  Detail & Related papers  (2025-03-13T05:39:55Z)
• Convergence of TD(0) under Polynomial Mixing with Nonlinear Function Approximation [49.1574468325115]
  Temporal Difference Learning (TD(0)) is fundamental in reinforcement learning.<n>We provide the first high-probability, finite-sample analysis of vanilla TD(0) on mixing Markov data.
  arXiv  Detail & Related papers  (2025-02-08T22:01:02Z)
• Symmetry-enforced minimal entanglement and correlation in quantum spin chains [0.6906005491572401]
  We study the minimal entanglement and correlation enforced by the $SO(3)$ spin rotation symmetry and lattice translation symmetry in a quantum spin-$J$ chain.<n>We show that no state in a quantum spin-$J$ chain with these symmetries can have a vanishing correlation length.
  arXiv  Detail & Related papers  (2024-12-30T07:22:18Z)
• Universal chain rules from entropic triangle inequalities [1.8416014644193066]
  We lower bound the smooth min-entropy of an $n$-partite system in terms of, roughly speaking, equally strong entropies of the individual subsystems.<n>We also prove an approximate version of the entropy accumulation theorem, which relaxes the conditions required on the state to bound its smooth min-entropy.
  arXiv  Detail & Related papers  (2024-12-09T18:10:28Z)
• Hamiltonian simulation for low-energy states with optimal time dependence [45.02537589779136]
  We consider the task of simulating time evolution under a Hamiltonian $H$ within its low-energy subspace. We present a quantum algorithm that uses $O(tsqrtlambdaGamma + sqrtlambda/Gammalog (1/epsilon))$ queries to the block-encoding for any $Gamma$.
  arXiv  Detail & Related papers  (2024-04-04T17:58:01Z)
• On the $O(\rac{\sqrt{d}}{T^{1/4}})$ Convergence Rate of RMSProp and Its Momentum Extension Measured by $\ell_1$ Norm [54.28350823319057]
  This paper considers the RMSProp and its momentum extension and establishes the convergence rate of $frac1Tsum_k=1T.<n>Our convergence rate matches the lower bound with respect to all the coefficients except the dimension $d$.<n>Our convergence rate can be considered to be analogous to the $frac1Tsum_k=1T.
  arXiv  Detail & Related papers  (2024-02-01T07:21:32Z)
• Smooth min-entropy lower bounds for approximation chains [0.0]
  We prove a simple entropic triangle inequality, which allows us to bound the smooth min-entropy of a state in terms of the R'enyi entropy of an arbitrary auxiliary state. Using this triangle inequality, we create lower bounds for the smooth min-entropy of a state in terms of the entropies of its approximation chain in various scenarios.
  arXiv  Detail & Related papers  (2023-08-22T18:55:16Z)
• Quantum and classical low-degree learning via a dimension-free Remez inequality [52.12931955662553]
  We show a new way to relate functions on the hypergrid to their harmonic extensions over the polytorus. We show the supremum of a function $f$ over products of the cyclic group $exp(2pi i k/K)_k=1K$. We extend to new spaces a recent line of work citeEI22, CHP, VZ22 that gave similarly efficient methods for learning low-degrees on hypercubes and observables on qubits.
  arXiv  Detail & Related papers  (2023-01-04T04:15:40Z)
• A new operator extension of strong subadditivity of quantum entropy [12.547444644243544]
  Weak monotonicity asserts that $S(rho_AB) - S(rho_A) + S(rho_BC) - S(rho_C)geq 0$ for any tripartite density matrix $rho_ABC$. We prove an operator inequality, which, upon taking an expectation value with respect to the state $rho_ABC$, reduces to the weak monotonicity inequality.
  arXiv  Detail & Related papers  (2022-11-24T01:45:44Z)
• Geometric relative entropies and barycentric Rényi divergences [16.385815610837167]
  monotone quantum relative entropies define monotone R'enyi quantities whenever $P$ is a probability measure. We show that monotone quantum relative entropies define monotone R'enyi quantities whenever $P$ is a probability measure.
  arXiv  Detail & Related papers  (2022-07-28T17:58:59Z)
• Quantum Entanglement with Generalized Uncertainty Principle [0.0]
  We explore how the quantum entanglement is modified in the generalized uncertainty principle (GUP)-corrected quantum mechanics. It is shown that $cal E_gamma (rho_A)$ increases with increasing $alpha$ when $gamma = 2, 3, cdots$. The remarkable fact is that $cal E_EoF (rho_A)$ does not have first-order of $alpha$.
  arXiv  Detail & Related papers  (2022-03-13T03:25:46Z)
• Sublinear quantum algorithms for estimating von Neumann entropy [18.30551855632791]
  We study the problem of obtaining estimates to within a multiplicative factor $gamma>1$ of the Shannon entropy of probability distributions and the von Neumann entropy of mixed quantum states. We work with the quantum purified query access model, which can handle both classical probability distributions and mixed quantum states, and is the most general input model considered in the literature.
  arXiv  Detail & Related papers  (2021-11-22T12:00:45Z)
• On the Self-Penalization Phenomenon in Feature Selection [69.16452769334367]
  We describe an implicit sparsity-inducing mechanism based on over a family of kernels. As an application, we use this sparsity-inducing mechanism to build algorithms consistent for feature selection.
  arXiv  Detail & Related papers  (2021-10-12T09:36:41Z)
• Learning low-degree functions from a logarithmic number of random queries [77.34726150561087]
  We prove that for any integer $ninmathbbN$, $din1,ldots,n$ and any $varepsilon,deltain(0,1)$, a bounded function $f:-1,1nto[-1,1]$ of degree at most $d$ can be learned.
  arXiv  Detail & Related papers  (2021-09-21T13:19:04Z)
• Infinite-Horizon Offline Reinforcement Learning with Linear Function Approximation: Curse of Dimensionality and Algorithm [46.36534144138337]
  In this paper, we investigate the sample complexity of policy evaluation in offline reinforcement learning. Under the low distribution shift assumption, we show that there is an algorithm that needs at most $Oleft(maxleft fracleftVert thetapirightVert _24varepsilon4logfracddelta,frac1varepsilon2left(d+logfrac1deltaright)right right)$ samples to approximate the
  arXiv  Detail & Related papers  (2021-03-17T18:18:57Z)
• R\'{e}nyi and Tsallis entropies of the Dirichlet and Neumann one-dimensional quantum wells [0.0]
  Dirichlet and Neumann boundary conditions (BCs) of 1D quantum well are studied. For either BC the dependencies of the R'enyi position components on the parameter $alpha$ are the same for all orbitals. The gap between the thresholds $alpha_TH$ of the two BCs causes different behavior of the R'enyi uncertainty relations as functions of $alpha$.
  arXiv  Detail & Related papers  (2020-03-09T18:34:00Z)

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.