Cumulant Structures of Entanglement Entropy

• URL: http://arxiv.org/abs/2502.05371v1
• Date: Fri, 07 Feb 2025 22:54:02 GMT
• Title: Cumulant Structures of Entanglement Entropy
• Authors: Youyi Huang, Lu Wei,
• Abstract summary: We present a new method to derive exact cumulant expressions of any order of von Neumann entropy over Hilbert-Schmidt ensemble. The new method uncovers hidden cumulant structures that decouple each cumulant in a summation-free manner into its lower-order joint cumulants.
• Score: 1.1371158248557305
• License:
• Abstract: We present a new method to derive exact cumulant expressions of any order of von Neumann entropy over Hilbert-Schmidt ensemble. The new method uncovers hidden cumulant structures that decouple each cumulant in a summation-free manner into its lower-order joint cumulants involving families of ancillary statistics. Importantly, the new method is able to avoid the seemingly inevitable task of simplifying nested summations of increasing difficulty that prevents the existing method in the literature to obtain higher-order cumulants.

Related papers

• Small steps no more: Global convergence of stochastic gradient bandits for arbitrary learning rates [61.091122503406304]
  We show that the gradient bandit algorithm converges to a globally optimal policy almost surely using emphany constant learning rate. This result demonstrates that gradient algorithm continues to balance exploration and exploitation appropriately even in scenarios where standard smoothness and noise control assumptions break down.
  arXiv  Detail & Related papers  (2025-02-11T00:12:04Z)
• Marginal-constrained entropy accumulation theorem [0.0]
  We show that channel conditional entropies are equal to their regularized version, and more generally, additive across tensor products of channels. For the purposes of cryptography, applying our chain rule to sequences of channels yields a new variant of R'enyi entropy accumulation.
  arXiv  Detail & Related papers  (2025-02-04T18:37:34Z)
• A Unified Theory of Stochastic Proximal Point Methods without Smoothness [52.30944052987393]
  Proximal point methods have attracted considerable interest owing to their numerical stability and robustness against imperfect tuning. This paper presents a comprehensive analysis of a broad range of variations of the proximal point method (SPPM)
  arXiv  Detail & Related papers  (2024-05-24T21:09:19Z)
• Riemannian stochastic optimization methods avoid strict saddle points [68.80251170757647]
  We show that policies under study avoid strict saddle points / submanifolds with probability 1. This result provides an important sanity check as it shows that, almost always, the limit state of an algorithm can only be a local minimizer.
  arXiv  Detail & Related papers  (2023-11-04T11:12:24Z)
• A characterization of von Neumann entropy using functors [0.0]
  We propose a method for characterizing von Neumann entropy by extending their results to quantum systems. In this paper we consider a functor from a certain category to the monoid of non-negative real numbers with addition as a map from measure-preserving functions to non-negative real numbers.
  arXiv  Detail & Related papers  (2023-09-19T06:26:19Z)
• Unified Convergence Theory of Stochastic and Variance-Reduced Cubic Newton Methods [37.1630298053787]
  We propose a new framework, which we call the helper framework. It provides a unified view of the variance and second-order algorithms equipped with global complexity guarantees.
  arXiv  Detail & Related papers  (2023-02-23T12:18:28Z)
• Optimal Algorithms for Stochastic Complementary Composite Minimization [55.26935605535377]
  Inspired by regularization techniques in statistics and machine learning, we study complementary composite minimization. We provide novel excess risk bounds, both in expectation and with high probability. Our algorithms are nearly optimal, which we prove via novel lower complexity bounds for this class of problems.
  arXiv  Detail & Related papers  (2022-11-03T12:40:24Z)
• The Dynamics of Riemannian Robbins-Monro Algorithms [101.29301565229265]
  We propose a family of Riemannian algorithms generalizing and extending the seminal approximation framework of Robbins and Monro. Compared to their Euclidean counterparts, Riemannian algorithms are much less understood due to lack of a global linear structure on the manifold. We provide a general template of almost sure convergence results that mirrors and extends the existing theory for Euclidean Robbins-Monro schemes.
  arXiv  Detail & Related papers  (2022-06-14T12:30:11Z)
• Accelerating Primal-dual Methods for Regularized Markov Decision Processes [14.76029955314774]
  Entropy regularized Markov decision processes have been widely used in reinforcement learning. Standard first-order methods suffer from slow convergence due to the lack of strict convexity and concavity. New quadratically convexified primal-dual formulation enjoys global convergence guarantee and exponential convergence rate.
  arXiv  Detail & Related papers  (2022-02-21T19:38:33Z)
• Kurtosis of von Neumann entanglement entropy [2.88199186901941]
  We study the statistical behavior of entanglement in quantum bipartite systems under the Hilbert-Schmidt ensemble. The main contribution of the present work is the exact formula of the corresponding fourth cumulant that controls the tail behavior of the distribution.
  arXiv  Detail & Related papers  (2021-07-21T22:20:10Z)
• Maximum Entropy Reinforcement Learning with Mixture Policies [54.291331971813364]
  We construct a tractable approximation of the mixture entropy using MaxEnt algorithms. We show that it is closely related to the sum of marginal entropies. We derive an algorithmic variant of Soft Actor-Critic (SAC) to the mixture policy case and evaluate it on a series of continuous control tasks.
  arXiv  Detail & Related papers  (2021-03-18T11:23:39Z)

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.