Papers
Topics
Authors
Recent
Search
2000 character limit reached

Maximal intrinsic randomness of a quantum state

Published 28 Jul 2023 in quant-ph | (2307.15708v2)

Abstract: One of the most counterintuitive aspects of quantum theory is its claim that there is 'intrinsic' randomness in the physical world. Quantum information science has greatly progressed in the study of intrinsic, or secret, quantum randomness in the past decade. With much emphasis on device-independent and semi-device-independent bounds, one of the most basic questions has escaped attention: how much intrinsic randomness can be extracted from a given state $\rho$, and what measurements achieve this bound? We answer this question for three different randomness quantifiers: the conditional min-entropy, the conditional von Neumann entropy and the conditional max-entropy. For the first, we solve the min-max problem of finding the projective measurement that minimises the maximal guessing probability of an eavesdropper. The result is that one can guarantee an amount of conditional min-entropy $H*_{\textrm{min}}=-\log_2 P_{\textrm{guess}}{*}(\rho)$ with $P_{\textrm{guess}}{*}(\rho)=\frac{1}{d}(\textrm{tr} \sqrt{\rho})2$ by performing suitable projective measurements. For the conditional von Neumann entropy, we find that the maximal value is $H{*}= \log_{2}d-S(\rho)$, with $S(\rho)$ the von Neumann entropy of $\rho$, while for the conditional max-entropy, we find the maximal value $H{*}\textrm{max}=\log{2}d + \log_{2}\lambda_{\textrm{max}}(\rho)$, where $\lambda_{\textrm{max}}(\rho)$ is the largest eigenvalue of $\rho$. Optimal values for $H{*}_{\textrm{min}}$, $H{*}$ and $H{*}_\textrm{max}$ are achieved by measuring in any basis that is unbiased to the eigenbasis of $\rho$, as well as by other, less intuitive, measurements.

Citations (4)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.