PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
July 8, 2024Physical review. A/Physical review, A2 citationsOpen Access

Maximal intrinsic randomness of a quantum state

View Full Paper
SMShuyang MengFCFionnuala CurranGSGabriel Senno

Key Points

Key points are not available for this paper at this time.

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 deviceindependent 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 ρ, 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 * min = -log 2 P * guess (ρ) with P * guess (ρ) = 1 d tr √ ρ 2 by performing suitable projective measurements.For the conditional von Neumann entropy, we find that the maximal value is H * = log 2 d -S(ρ), with S(ρ) the von Neumann entropy of ρ, while for the conditional max-entropy, we find the maximal value H * max = log 2 d + log 2 λmax(ρ), where λmax(ρ) is the largest eigenvalue of ρ.Optimal values for H * min , H * and H * max are achieved by measuring in any basis that is unbiased with respect to the eigenbasis of ρ, as well as by other, less intuitive, measurements.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Meng et al. (2024) studied this question.

synapsesocial.com/papers/68e61080b6db6435875a337dhttps://doi.org/10.1103/physreva.110.l010403
Ask AI
Helpful
Bookmark
Share
View Full Paper