Estimating the Shannon entropy and (un)certainty relations for design-structured POVMs

• URL: http://arxiv.org/abs/2009.13187v5
• Date: Tue, 28 Jun 2022 09:16:59 GMT
• Title: Estimating the Shannon entropy and (un)certainty relations for design-structured POVMs
• Authors: Alexey E. Rastegin
• Abstract summary: The main question is how to convert the imposed restrictions into two-sided estimates on the Shannon entropy. We propose a family of senses for estimating the Shannon entropy from below. It is shown that the derived estimates are applicable in quantum tomography and detecting steerability of quantum states.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Complementarity relations between various characterizations of a probability distribution are at the core of information theory. In particular, lower and upper bounds for the entropic function are of great importance. In applied topics, we often deal with situations, where the sums of certain powers of probabilities are known. The main question is how to convert the imposed restrictions into two-sided estimates on the Shannon entropy. It is addressed in two different ways. The more intuitive of them is based on truncated expansions of the Taylor type. Another method is based on the use of coefficients of the shifted Chebyshev polynomials. We propose here a family of polynomials for estimating the Shannon entropy from below. As a result, estimates are more uniform in the sense that errors do not become too large in particular points. The presented method is used for deriving uncertainty and certainty relations for positive operator-valued measures assigned to a quantum design. Quantum designs are currently the subject of active researches due to potential use in quantum information science. It is shown that the derived estimates are applicable in quantum tomography and detecting steerability of quantum states.

Related papers

• One-Shot Min-Entropy Calculation And Its Application To Quantum Cryptography [21.823963925581868]
  We develop a one-shot lower bound calculation technique for the min-entropy of a classical-quantum state. It gives an alternative tight finite-data analysis for the well-known BB84 quantum key distribution protocol. It provides a security proof for a novel source-independent continuous-variable quantum random number generation protocol.
  arXiv  Detail & Related papers  (2024-06-21T15:11:26Z)
• Uncertainty relations in terms of generalized entropies derived from information diagrams [0.0]
  Inequalities between entropies and the index of coincidence form a long-standing direction of researches in classical information theory. This paper is devoted to entropic uncertainty relations derived from information diagrams.
  arXiv  Detail & Related papers  (2023-05-29T10:41:28Z)
• Near-term quantum algorithm for computing molecular and materials properties based on recursive variational series methods [44.99833362998488]
  We propose a quantum algorithm to estimate the properties of molecules using near-term quantum devices. We test our method by computing the one-particle Green's function in the energy domain and the autocorrelation function in the time domain.
  arXiv  Detail & Related papers  (2022-06-20T16:33:23Z)
• 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)
• Why we should interpret density matrices as moment matrices: the case of (in)distinguishable particles and the emergence of classical reality [69.62715388742298]
  We introduce a formulation of quantum theory (QT) as a general probabilistic theory but expressed via quasi-expectation operators (QEOs) We will show that QT for both distinguishable and indistinguishable particles can be formulated in this way. We will show that finitely exchangeable probabilities for a classical dice are as weird as QT.
  arXiv  Detail & Related papers  (2022-03-08T14:47:39Z)
• Shannon theory beyond quantum: information content of a source [68.8204255655161]
  We extend the definition of information content to operational probabilistic theories. We prove relevant properties as the subadditivity, and the relation between purity and information content of a state.
  arXiv  Detail & Related papers  (2021-12-23T16:36:06Z)
• Stochastic approximate state conversion for entanglement and general quantum resource theories [41.94295877935867]
  An important problem in any quantum resource theory is to determine how quantum states can be converted into each other. Very few results have been presented on the intermediate regime between probabilistic and approximate transformations. We show that these bounds imply an upper bound on the rates for various classes of states under probabilistic transformations. We also show that the deterministic version of the single copy bounds can be applied for drawing limitations on the manipulation of quantum channels.
  arXiv  Detail & Related papers  (2021-11-24T17:29:43Z)
• Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification [56.61325554836984]
  The max-relative entropy together with its smoothed version is a basic tool in quantum information theory. We derive the exact exponent for the decay of the small modification of the quantum state in smoothing the max-relative entropy based on purified distance.
  arXiv  Detail & Related papers  (2021-11-01T16:35:41Z)
• Complementarity relations for design-structured POVMs in terms of generalized entropies of order $\alpha\in(0,2)$ [0.0]
  Information entropies give a genuine way to characterize quantitatively an incompatibility in quantum measurements. Quantum designs are currently the subject of active research. We show how to convert restrictions on generated probabilities into two-sided entropic estimates.
  arXiv  Detail & Related papers  (2021-07-29T16:31:32Z)
• 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)
• R\'{e}nyi formulation of uncertainty relations for POVMs assigned to a quantum design [0.0]
  Information entropies provide powerful and flexible way to express restrictions imposed by the uncertainty principle. In this paper, we obtain uncertainty relations in terms of min-entropies and R'enyi entropies for POVMs assigned to a quantum design.
  arXiv  Detail & Related papers  (2020-04-12T09:44:44Z)

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.