Monotonicity of the von Neumann Entropy under Quantum Convolution

• URL: http://arxiv.org/abs/2504.02206v1
• Date: Thu, 03 Apr 2025 01:45:45 GMT
• Title: Monotonicity of the von Neumann Entropy under Quantum Convolution
• Authors: Salman Beigi, Hami Mehrabi,
• Abstract summary: 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.
• Score: 3.130722489512822
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The quantum entropy power inequality, proven by K\"onig and Smith (2012), states that $\exp(S(\rho \boxplus \sigma)/m)\geq \frac 12 (\exp(S(\rho)/m) + \exp(S(\sigma)/m))$ for two $m$-mode bosonic quantum states $\rho$ and $\sigma$. One direct consequence of this inequality is that the sequence $\big\{ S(\rho^{\boxplus n}): n\geq 1 \big\}$ of von Neumann entropies of symmetric convolutions of $\rho$ has a monotonically increasing subsequence, namely, $S(\rho^{\boxplus 2^{k+1}})\geq S(\rho^{\boxplus 2^{k}})$. 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. Also, it is conjectured by Guha (2008) that the same holds in the quantum setting, and we have $S(\rho^{\boxplus n}) \geq S(\rho^{\boxplus (n-1)})$ for any $n$. In this paper, we resolve this conjecture by establishing this monotonicity. We in fact 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 $\rho_1, \cdots, \rho_n$ with the von Neumann entropy of the symmetric convolution of subsets of these quantum states. Additionally, 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.

Related papers

• Von Neumann Entropy and Quantum Algorithmic Randomness [0.0]
  A state $rho=(rho_n)_n=1infty$ is a sequence such that $rho_n$ is a density matrix on $n$ qubits.<n>The von Neumann entropy $H(d)$ of a density matrix $d$ is the Shannon entropy of its eigenvalue distribution.
  arXiv  Detail & Related papers  (2024-12-24T18:09:45Z)
• Slow Mixing of Quantum Gibbs Samplers [47.373245682678515]
  We present a quantum generalization of these tools through a generic bottleneck lemma.<n>This lemma focuses on quantum measures of distance, analogous to the classical Hamming distance but rooted in uniquely quantum principles.<n>We show how to lift classical slow mixing results in the presence of a transverse field using Poisson Feynman-Kac techniques.
  arXiv  Detail & Related papers  (2024-11-06T22:51:27Z)
• Continuity bounds for quantum entropies arising from a fundamental entropic inequality [9.23607423080658]
  We establish a tight upper bound for the difference in von Neumann entropies between two quantum states, $rho_1$ and $rho$.<n>This yields a novel entropic inequality that implies the well-known Audenaert-Fannes (AF) inequality.
  arXiv  Detail & Related papers  (2024-08-27T15:59:38Z)
• Efficient unitary designs and pseudorandom unitaries from permutations [35.66857288673615]
  We show that products exponentiated sums of $S(N)$ permutations with random phases match the first $2Omega(n)$ moments of the Haar measure. The heart of our proof is a conceptual connection between the large dimension (large-$N$) expansion in random matrix theory and the method.
  arXiv  Detail & Related papers  (2024-04-25T17:08:34Z)
• Dimension Independent Disentanglers from Unentanglement and Applications [55.86191108738564]
  We construct a dimension-independent k-partite disentangler (like) channel from bipartite unentangled input. We show that to capture NEXP, it suffices to have unentangled proofs of the form $| psi rangle = sqrta | sqrt1-a | psi_+ rangle where $| psi_+ rangle has non-negative amplitudes.
  arXiv  Detail & Related papers  (2024-02-23T12:22:03Z)
• Tip of the Quantum Entropy Cone [1.1606619391009658]
  Relations among von Neumann entropies of different parts of an $N$-partite quantum system have direct impact on our understanding of diverse situations. We show that while it is always possible to up-scale an entropy vector to arbitrary integer multiples it is not always possible to down-scale it to arbitrarily small size.
  arXiv  Detail & Related papers  (2023-05-31T21:37:24Z)
• Quantum Speedups for Zero-Sum Games via Improved Dynamic Gibbs Sampling [30.53587208999909]
  We give a quantum algorithm for computing an $epsilon$-approximate Nash equilibrium of a zero-sum game in a $m times n$ payoff matrix with bounded entries. Given a standard quantum oracle for accessing the payoff matrix our algorithm runs in time $widetildeO(sqrtm + ncdot epsilon-2.5 + epsilon-3)$ and outputs a classical representation of the $epsilon$-approximate Nash equilibrium.
  arXiv  Detail & Related papers  (2023-01-10T02:56:49Z)
• Asymptotic Equipartition Theorems in von Neumann algebras [24.1712628013996]
  We show that the smooth max entropy of i.i.d. states on a von Neumann algebra has an rate given by the quantum relative entropy. Our AEP not only applies to states, but also to quantum channels with appropriate restrictions.
  arXiv  Detail & Related papers  (2022-12-30T13:42:35Z)
• 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)
• A lower bound on the space overhead of fault-tolerant quantum computation [51.723084600243716]
  The threshold theorem is a fundamental result in the theory of fault-tolerant quantum computation. We prove an exponential upper bound on the maximal length of fault-tolerant quantum computation with amplitude noise.
  arXiv  Detail & Related papers  (2022-01-31T22:19:49Z)
• On quantum algorithms for the Schr\"odinger equation in the semi-classical regime [27.175719898694073]
  We consider Schr"odinger's equation in the semi-classical regime. Such a Schr"odinger equation finds many applications, including in Born-Oppenheimer molecular dynamics and Ehrenfest dynamics.
  arXiv  Detail & Related papers  (2021-12-25T20:01:54Z)
• An Optimal Separation of Randomized and Quantum Query Complexity [67.19751155411075]
  We prove that for every decision tree, the absolute values of the Fourier coefficients of a given order $ellsqrtbinomdell (1+log n)ell-1,$ sum to at most $cellsqrtbinomdell (1+log n)ell-1,$ where $n$ is the number of variables, $d$ is the tree depth, and $c>0$ is an absolute constant.
  arXiv  Detail & Related papers  (2020-08-24T06:50:57Z)

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.