Complementarity relations for design-structured POVMs in terms of generalized entropies of order $\alpha\in(0,2)$

• URL: http://arxiv.org/abs/2107.14162v2
• Date: Wed, 11 Aug 2021 03:29:30 GMT
• Title: Complementarity relations for design-structured POVMs in terms of generalized entropies of order $\alpha\in(0,2)$
• Authors: Alexey E. Rastegin
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Information entropies give a genuine way to characterize quantitatively an incompatibility in quantum measurements. Together with the Shannon entropy, few families of parametrized entropies have found use in various questions. It is also known that a possibility to vary the parameter can often provide more restrictions on elements of probability distributions. In quantum information processing, one often deals with measurements having some special structure. Quantum designs are currently the subject of active research, whence the aim to formulate complementarity relations for related measurements occurs. Using generalized entropies of order $\alpha\in(0,2)$, we obtain uncertainty and certainty relations for POVMs assigned to a quantum design. The structure of quantum designs leads to several restrictions on generated probabilities. We show how to convert these restrictions into two-sided entropic estimates. One of the used ways is based on truncated expansions of the Taylor type. The recently found method to get two-sided entropic estimates uses polynomials with flexible coefficients. We illustrate the utility of this method with respect to both the R\'{e}nyi and Tsallis entropies. Possible applications of the derived complementarity relations are briefly discussed.

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)
• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
  Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application. We analyse the generation of random states in PQCs under restrictions on the qubits connectivities. We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
  arXiv  Detail & Related papers  (2024-05-03T17:32:55Z)
• 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)
• Local Intrinsic Dimensional Entropy [29.519376857728325]
  Most entropy measures depend on the spread of the probability distribution over the sample space $mathcalX|$. In this work, we question the role of cardinality and distribution spread in defining entropy measures for continuous spaces. We find that the average value of the local intrinsic dimension of a distribution, denoted as ID-Entropy, can serve as a robust entropy measure for continuous spaces.
  arXiv  Detail & Related papers  (2023-04-05T04:36:07Z)
• Analyzing Prospects for Quantum Advantage in Topological Data Analysis [35.423446067065576]
  We analyze and optimize an improved quantum algorithm for topological data analysis. We show that super-quadratic quantum speedups are only possible when targeting a multiplicative error approximation. We argue that quantum circuits with tens of billions of Toffoli can solve seemingly classically intractable instances.
  arXiv  Detail & Related papers  (2022-09-27T17:56:15Z)
• Persistent homology of quantum entanglement [0.0]
  We study the structure of entanglement entropy using persistent homology. The inverse quantum mutual information between pairs of sites is used as a distance metric to form a filtered simplicial complex. We also discuss the promising future applications of this modern computational approach, including its connection to the question of how spacetime could emerge from entanglement.
  arXiv  Detail & Related papers  (2021-10-19T19:23:39Z)
• R\'enyi divergence inequalities via interpolation, with applications to generalised entropic uncertainty relations [91.3755431537592]
  We investigate quantum R'enyi entropic quantities, specifically those derived from'sandwiched' divergence. We present R'enyi mutual information decomposition rules, a new approach to the R'enyi conditional entropy tripartite chain rules and a more general bipartite comparison.
  arXiv  Detail & Related papers  (2021-06-19T04:06:23Z)
• Q-Match: Iterative Shape Matching via Quantum Annealing [64.74942589569596]
  Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) This paper proposes Q-Match, a new iterative quantum method for QAPs inspired by the alpha-expansion algorithm. Q-Match can be applied for shape matching problems iteratively, on a subset of well-chosen correspondences, allowing us to scale to real-world problems.
  arXiv  Detail & Related papers  (2021-05-06T17:59:38Z)
• Estimating the Shannon entropy and (un)certainty relations for design-structured POVMs [0.0]
  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.
  arXiv  Detail & Related papers  (2020-09-28T10:00:47Z)
• 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)
• Quantum Statistical Complexity Measure as a Signalling of Correlation Transitions [55.41644538483948]
  We introduce a quantum version for the statistical complexity measure, in the context of quantum information theory, and use it as a signalling function of quantum order-disorder transitions. We apply our measure to two exactly solvable Hamiltonian models, namely: the $1D$-Quantum Ising Model and the Heisenberg XXZ spin-$1/2$ chain. We also compute this measure for one-qubit and two-qubit reduced states for the considered models, and analyse its behaviour across its quantum phase transitions for finite system sizes as well as in the thermodynamic limit by using Bethe ansatz.
  arXiv  Detail & Related papers  (2020-02-05T00:45:21Z)

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.