Entropy of Quantum Measurements
- URL: http://arxiv.org/abs/2210.15738v2
- Date: Tue, 1 Nov 2022 16:53:27 GMT
- Title: Entropy of Quantum Measurements
- Authors: Stan Gudder
- Abstract summary: In Section2, we provide bounds on $S_a(rho )$ and show that if $a+b$ is an effect, then $S_a+b(rho )ge S_a(rho )+S_b(rho )$.
In Section3, we employ $S_a(rho )$ to define the $rho$-entropy $S_A(rho )$ for an observable $A$.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: If $a$ is a quantum effect and $\rho$ is a state, we define the
$\rho$-entropy $S_a(\rho )$ which gives the amount of uncertainty that a
measurement of $a$ provides about $\rho$. The smaller $S_a(\rho )$ is, the more
information a measurement of $a$ gives about $\rho$. In Section~2, we provide
bounds on $S_a(\rho )$ and show that if $a+b$ is an effect, then $S_{a+b}(\rho
)\ge S_a(\rho )+S_b(\rho )$. We then prove a result concerning convex mixtures
of effects. We also consider sequential products of effects and their
$\rho$-entropies. In Section~3, we employ $S_a(\rho )$ to define the
$\rho$-entropy $S_A(\rho )$ for an observable $A$. We show that $S_A(\rho )$
directly provides the $\rho$-entropy $S_\iscript (\rho )$ for an instrument
$\iscript$. We establish bounds for $S_A(\rho )$ and prove characterizations
for when these bounds are obtained. These give simplified proofs of results
given in the literature. We also consider $\rho$-entropies for measurement
models, sequential products of observables and coarse-graining of observables.
Various examples that illustrate the theory are provided.
Related papers
- Measuring quantum relative entropy with finite-size effect [53.64687146666141]
We study the estimation of relative entropy $D(rho|sigma)$ when $sigma$ is known.
Our estimator attains the Cram'er-Rao type bound when the dimension $d$ is fixed.
arXiv Detail & Related papers (2024-06-25T06:07:20Z) - A Unified Framework for Uniform Signal Recovery in Nonlinear Generative
Compressed Sensing [68.80803866919123]
Under nonlinear measurements, most prior results are non-uniform, i.e., they hold with high probability for a fixed $mathbfx*$ rather than for all $mathbfx*$ simultaneously.
Our framework accommodates GCS with 1-bit/uniformly quantized observations and single index models as canonical examples.
We also develop a concentration inequality that produces tighter bounds for product processes whose index sets have low metric entropy.
arXiv Detail & Related papers (2023-09-25T17:54:19Z) - Conditional Effects, Observables and Instruments [0.0]
We define the probability that an effect occurs when the system is in a state $rho$ by $P_rho (a)= tr(rho a)$.
We then consider L"uders and Holevo operations.
We show that two observables $B$ and $C$ are jointly commuting if and only if there exists an atomic observable $A$ such that $B=(Bmid A)$ and $C=(Cmid A)$.
arXiv Detail & Related papers (2023-03-27T23:44:19Z) - Exact Fractional Inference via Re-Parametrization & Interpolation between Tree-Re-Weighted- and Belief Propagation- Algorithms [0.4527270266697462]
We show how to express $Z$ as a product, $forall lambda: Z=Z(lambda)tilde Z(lambda)$, where the multiplicative correction, $tilde Z(lambda)$, is an expectation over a node-independent probability distribution.
We also discuss the applicability of this approach to the problem of image de-noising.
arXiv Detail & Related papers (2023-01-25T00:50:28Z) - Enlarging the notion of additivity of resource quantifiers [62.997667081978825]
Given a quantum state $varrho$ and a quantifier $cal E(varrho), it is a hard task to determine $cal E(varrhootimes N)$.
We show that the one shot distillable entanglement of certain spherically symmetric states can be quantitatively approximated by such an augmented additivity.
arXiv Detail & Related papers (2022-07-31T00:23:10Z) - Simplest non-additive measures of quantum resources [77.34726150561087]
We study measures that can be described by $cal E(rhootimes N) =E(e;N) ne Ne$.
arXiv Detail & Related papers (2021-06-23T20:27:04Z) - Improved quantum data analysis [1.8416014644193066]
We give a quantum "Threshold Search" algorithm that requires only $O(log2 m)/epsilon2)$ samples of a $d$-dimensional state.
We also give an alternative Hypothesis Selection method using $tildeO((log3 m)/epsilon2)$ samples.
arXiv Detail & Related papers (2020-11-22T01:22:37Z) - Model-Free Reinforcement Learning: from Clipped Pseudo-Regret to Sample
Complexity [59.34067736545355]
Given an MDP with $S$ states, $A$ actions, the discount factor $gamma in (0,1)$, and an approximation threshold $epsilon > 0$, we provide a model-free algorithm to learn an $epsilon$-optimal policy.
For small enough $epsilon$, we show an improved algorithm with sample complexity.
arXiv Detail & Related papers (2020-06-06T13:34:41Z) - Quantum Coupon Collector [62.58209964224025]
We study how efficiently a $k$-element set $Ssubseteq[n]$ can be learned from a uniform superposition $|Srangle of its elements.
We give tight bounds on the number of quantum samples needed for every $k$ and $n$, and we give efficient quantum learning algorithms.
arXiv Detail & Related papers (2020-02-18T16:14:55Z)
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.