Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userSampling of min-entropy relative to quantum knowledge
51
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Let X_1, ..., X_n be a sequence of n classical random variables and consider a sample of r positions selected at random. Then, except with (exponentially in r) small probability, the min-entropy of the sample is not smaller than, roughly, a fraction r/n of the total min-entropy of all positions X_1, ..., X_n, which is optimal. Here, we show that this statement, originally proven by Vadhan [LNCS, vol. 2729, Springer, 2003] for the purely classical case, is still true if the min-entropy is measured relative to a quantum system. Because min-entropy quantifies the amount of randomness that can be extracted from a given random variable, our result can be used to prove the soundness of locally computable extractors in a context where side information might be quantum-mechanical. In particular, it implies that key agreement in the bounded-storage model (using a standard sample-and-hash protocol) is fully secure against quantum adversaries, thus solving a long-standing open problem.
rate research
Read More
The existence of a positive log-Sobolev constant implies a bound on the mixing time of a quantum dissipative evolution under the Markov approximation. For classical spin systems, such constant was proven to exist, under the assumption of a mixing condition in the Gibbs measure associated to their dynamics, via a quasi-factorization of the entropy in terms of the conditional entropy in some sub-$sigma$-algebras. In this work we analyze analogous quasi-factorization results in the quantum case. For that, we define the quantum conditional relative entropy and prove several quasi-factorization results for it. As an illustration of their potential, we use one of them to obtain a positive log-Sobolev constant for the heat-bath dynamics with product fixed point.
The property of superadditivity of the quantum relative entropy states that, in a bipartite system $mathcal{H}_{AB}=mathcal{H}_A otimes mathcal{H}_B$, for every density operator $rho_{AB}$ one has $ D( rho_{AB} || sigma_A otimes sigma_B ) ge D( rho_A || sigma_A ) +D( rho_B || sigma_B) $. In this work, we provide an extension of this inequality for arbitrary density operators $ sigma_{AB} $. More specifically, we prove that $ alpha (sigma_{AB})cdot D({rho_{AB}}||{sigma_{AB}}) ge D({rho_A}||{sigma_A})+D({rho_B}||{sigma_B})$ holds for all bipartite states $rho_{AB}$ and $sigma_{AB}$, where $alpha(sigma_{AB})= 1+2 || sigma_A^{-1/2} otimes sigma_B^{-1/2} , sigma_{AB} , sigma_A^{-1/2} otimes sigma_B^{-1/2} - mathbb{1}_{AB} ||_infty$.
Based on the resource theory for quantifying the coherence of quantum channels, we introduce a new coherence quantifier for quantum channels via maximum relative entropy. We prove that the maximum relative entropy for coherence of quantum channels is directly related to the maximally coherent channels under a particular class of superoperations, which results in an operational interpretation of the maximum relative entropy for coherence of quantum channels. We also introduce the conception of sub-superchannels and sub-superchannel discrimination. For any quantum channels, we show that the advantage of quantum channels in sub-superchannel discrimination can be exactly characterized by the maximum relative entropy of coherence for quantum channels. Similar to the maximum relative entropy of coherence for channels, the robustness of coherence for quantum channels has also been investigated. We show that the maximum relative entropy of coherence for channels provides new operational interpretations of robustness of coherence for quantum channels and illustrates the equivalence of the dephasing-covariant superchannels, incoherent superchannels, and strictly incoherent superchannels in these two operational tasks.
We provide a versatile upper bound on the number of maximally entangled qubits, or private bits, shared by two parties via a generic adaptive communication protocol over a quantum network when the use of classical communication is not restricted. Although our result follows the idea of Azuma et al. [Nat. Comm. 7, 13523 (2016)] of splitting the network into two parts, our approach relaxes their strong restriction, consisting of the use of a single entanglement measure in the quantification of the maximum amount of entanglement generated by the channels. In particular, in our bound the measure can be chosen on a channel-by-channel basis, in order to make it as tight as possible. This enables us to apply the relative entropy of entanglement, which often gives a state-of-the-art upper bound, on every Choi-simulable channel in the network, even when the other channels do not satisfy this property. We also develop tools to compute, or bound, the max-relative entropy of entanglement for channels that are invariant under phase rotations. In particular, we present an analytical formula for the max-relative entropy of entanglement of the qubit amplitude damping channel.
We introduce a measure of quantum non-Gaussianity (QNG) for those quantum states not accessible by a mixture of Gaussian states in terms of quantum relative entropy. Specifically, we employ a convex-roof extension using all possible mixed-state decompositions beyond the usual pure-state decompositions. We prove that this approach brings a QNG measure fulfilling the properties desired as a proper monotone under Gaussian channels and conditional Gaussian operations. As an illustration, we explicitly calculate QNG for the noisy single-photon states and demonstrate that QNG coincides with non-Gaussianity of the state itself when the single-photon fraction is sufficiently large.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
