Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Springer eBooks

Quantum Entropy Regularization

Richard N. Silver

Published Jan 1, 1999• 2 citations
Publisher
DOI
10.1007/978-94-011-4710-1_9

Related papers

Regularization of Quantum Relative Entropy in Finite Dimensions and Application to Entropy Production

K. Lendi, F. Farhadmotamed, A. J. van Wonderen

Journal of Statistical Physics•Sep 1, 1998•12 citations

Quantum Entropy

Dominik Janzing

Springer eBooks•Jan 1, 2009•0 citations

Based on Information Entropy: Quantum State Regularization

Jincheng Zhang

This paper introduces a novel approach to quantum state regularization based on information entropy. The core idea is to quantify information entropy and utilize it to define a regularization loss function that constrains the probability distribution of quantum states. This method aims to enhance the stability of quantum algorithms by mitigating the effects of decoherence and the vanishing-wave problem. The proposed technique leverages the gradient information derived from entropy to iteratively refine quantum states, steering them towards more robust and predictable behaviors. We demonstrate a theoretical framework for this approach and outline its potential applications in various quantum computation scenarios. The key contribution lies in establishing a deep connection between quantum state probability distributions and information entropy, a previously underutilized resource in regularization strategies. ---

•Sep 3, 2026•0 citations

Finite attainment and efficient computation of regularized quantum channel relative entropy

Yiwei Xu, Kun Fang

Quantum channel relative entropy can be nonadditive, making its regularization essential for asymptotic analysis. We study when the regularized value is attained at finite blocklength and how efficiently it can be approximated. For the first question, we establish a sharp dichotomy: the regularized value is either attained already at the single-copy level, implying additivity at every blocklength, or is never attained at any finite blocklength. Notably, a simple two-copy additivity test distinguishes between these alternatives for qubit channels and for channel pairs in arbitrary dimensions admitting an interior optimizer. We further show that both the interiority condition and finite nonattainment are generic, holding for almost every channel pair. For the second question, we establish explicit convergence rates for approximating the regularized channel relative entropy. For fixed channel dimensions, $\widetilde O(\varepsilon^{-3/2})$ channel copies suffice to approximate the regularized value to additive accuracy $\varepsilon$. Alternatively, a semidefinite hierarchy achieves the same accuracy at level $\widetilde O(\varepsilon^{-2})$, yielding a certified polynomial-time approximation. Together, these results reveal the intriguing structure and generic behavior of regularized channel relative entropy, sharpening our understanding of both its analytical and computational aspects.

quant-pharXiv:2611.02425•Nov 3, 2026•0 citations

Limitations on Dimensional Regularization in Renyi Entropy

Ning Bao, Temple He

Dimensional regularization is a common method used to regulate the UV divergence of field theoretic quantities. When it is used in the context of Renyi entropy, however, it is important to consider whether such a procedure eliminates the statistical interpretation thereof as a measure of entanglement of states living on a Hilbert space. We therefore examine the dimensionally regularized Renyi entropy of a 4d unitary CFT and show that it admits no underlying Hilbert space in the state-counting sense. This gives a concrete proof that dimensionally regularized Renyi entropy cannot always be obtained as a limit of the Renyi entropy of some finite-dimensional quantum system.

arXiv:1603.08531•Mar 28, 2016•1 citation

Quantum Entropy

François Chapeau‐Blondeau

Springer eBooks•Jan 1, 2026•0 citations
This paper introduces a novel approach to quantum state regularization based on information entropy. The core idea is to quantify information entropy and utilize it to define a regularization loss function that constrains the probability distribution of quantum states. This method aims to enhance the stability of quantum algorithms by mitigating the effects of decoherence and the vanishing-wave problem. The proposed technique leverages the gradient information derived from entropy to iteratively refine quantum states, steering them towards more robust and predictable behaviors. We demonstrate a theoretical framework for this approach and outline its potential applications in various quantum computation scenarios. The key contribution lies in establishing a deep connection between quantum state probability distributions and information entropy, a previously underutilized resource in regularization strategies. ---
Quantum channel relative entropy can be nonadditive, making its regularization essential for asymptotic analysis. We study when the regularized value is attained at finite blocklength and how efficiently it can be approximated. For the first question, we establish a sharp dichotomy: the regularized value is either attained already at the single-copy level, implying additivity at every blocklength, or is never attained at any finite blocklength. Notably, a simple two-copy additivity test distinguishes between these alternatives for qubit channels and for channel pairs in arbitrary dimensions admitting an interior optimizer. We further show that both the interiority condition and finite nonattainment are generic, holding for almost every channel pair. For the second question, we establish explicit convergence rates for approximating the regularized channel relative entropy. For fixed channel dimensions, O~(ε−3/2)\widetilde O(\varepsilon^{-3/2})O(ε−3/2) channel copies suffice to approximate the regularized value to additive accuracy ε\varepsilonε. Alternatively, a semidefinite hierarchy achieves the same accuracy at level O~(ε−2)\widetilde O(\varepsilon^{-2})O(ε−2), yielding a certified polynomial-time approximation. Together, these results reveal the intriguing structure and generic behavior of regularized channel relative entropy, sharpening our understanding of both its analytical and computational aspects.
Dimensional regularization is a common method used to regulate the UV divergence of field theoretic quantities. When it is used in the context of Renyi entropy, however, it is important to consider whether such a procedure eliminates the statistical interpretation thereof as a measure of entanglement of states living on a Hilbert space. We therefore examine the dimensionally regularized Renyi entropy of a 4d unitary CFT and show that it admits no underlying Hilbert space in the state-counting sense. This gives a concrete proof that dimensionally regularized Renyi entropy cannot always be obtained as a limit of the Renyi entropy of some finite-dimensional quantum system.