Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userSymmetric distinguishability as a quantum resource
186
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We develop a resource theory of symmetric distinguishability, the fundamental objects of which are elementary quantum information sources, i.e., sources that emit one of two possible quantum states with given prior probabilities. Such a source can be represented by a classical-quantum state of a composite system $XA$, corresponding to an ensemble of two quantum states, with $X$ being classical and $A$ being quantum. We study the resource theory for two different classes of free operations: $(i)$ ${rm{CPTP}}_A$, which consists of quantum channels acting only on $A$, and $(ii)$ conditional doubly stochastic (CDS) maps acting on $XA$. We introduce the notion of symmetric distinguishability of an elementary source and prove that it is a monotone under both these classes of free operations. We study the tasks of distillation and dilution of symmetric distinguishability, both in the one-shot and asymptotic regimes. We prove that in the asymptotic regime, the optimal rate of converting one elementary source to another is equal to the ratio of their quantum Chernoff divergences, under both these classes of free operations. This imparts a new operational interpretation to the quantum Chernoff divergence. We also obtain interesting operational interpretations of the Thompson metric, in the context of the dilution of symmetric distinguishability.
rate research
Read More
This paper develops the resource theory of asymmetric distinguishability for quantum channels, generalizing the related resource theory for states [arXiv:1010.1030; arXiv:1905.11629]. The key constituents of the channel resource theory are quantum channel boxes, consisting of a pair of quantum channels, which can be manipulated for free by means of an arbitrary quantum superchannel (the most general physical transformation of a quantum channel). One main question of the resource theory is the approximate channel box transformation problem, in which the goal is to transform an initial channel box (or boxes) to a final channel box (or boxes), while allowing for an asymmetric error in the transformation. The channel resource theory is richer than its counterpart for states because there is a wider variety of ways in which this question can be framed, either in the one-shot or $n$-shot regimes, with the latter having parallel and sequential variants. As in our prior work [arXiv:1905.11629], we consider two special cases of the general channel box transformation problem, known as distinguishability distillation and dilution. For the one-shot case, we find that the optimal values of the various tasks are equal to the non-smooth or smooth channel min- or max-relative entropies, thus endowing all of these quantities with operational interpretations. In the asymptotic sequential setting, we prove that the exact distinguishability cost is equal to the channel max-relative entropy and the distillable distinguishability is equal to the amortized channel relative entropy of [arXiv:1808.01498]. This latter result can also be understood as a solution to Steins lemma for quantum channels in the sequential setting. Finally, the theory simplifies significantly for environment-seizable and classical--quantum channel boxes.
This paper systematically develops the resource theory of asymmetric distinguishability, as initiated roughly a decade ago [K. Matsumoto, arXiv:1010.1030 (2010)]. The key constituents of this resource theory are quantum boxes, consisting of a pair of quantum states, which can be manipulated for free by means of an arbitrary quantum channel. We introduce bits of asymmetric distinguishability as the basic currency in this resource theory, and we prove that it is a reversible resource theory in the asymptotic limit, with the quantum relative entropy being the fundamental rate of resource interconversion. The distillable distinguishability is the optimal rate at which a quantum box consisting of independent and identically distributed (i.i.d.) states can be converted to bits of asymmetric distinguishability, and the distinguishability cost is the optimal rate for the reverse transformation. Both of these quantities are equal to the quantum relative entropy. The exact one-shot distillable distinguishability is equal to the min-relative entropy, and the exact one-shot distinguishability cost is equal to the max-relative entropy. Generalizing these results, the approximate one-shot distillable distinguishability is equal to the smooth min-relative entropy, and the approximate one-shot distinguishability cost is equal to the smooth max-relative entropy. As a notable application of the former results, we prove that the optimal rate of asymptotic conversion from a pair of i.i.d. quantum states to another pair of i.i.d. quantum states is fully characterized by the ratio of their quantum relative entropies.
Quantum channel estimation and discrimination are fundamentally related information processing tasks of interest in quantum information science. In this paper, we analyze these tasks by employing the right logarithmic derivative Fisher information and the geometric Renyi relative entropy, respectively, and we also identify connections between these distinguishability measures. A key result of our paper is that a chain-rule property holds for the right logarithmic derivative Fisher information and the geometric Renyi relative entropy for the interval $alphain(0,1) $ of the Renyi parameter $alpha$. In channel estimation, these results imply a condition for the unattainability of Heisenberg scaling, while in channel discrimination, they lead to improved bounds on error rates in the Chernoff and Hoeffding error exponent settings. More generally, we introduce the amortized quantum Fisher information as a conceptual framework for analyzing general sequential protocols that estimate a parameter encoded in a quantum channel, and we use this framework, beyond the aforementioned application, to show that Heisenberg scaling is not possible when a parameter is encoded in a classical-quantum channel. We then identify a number of other conceptual and technical connections between the tasks of estimation and discrimination and the distinguishability measures involved in analyzing each. As part of this work, we present a detailed overview of the geometric Renyi relative entropy of quantum states and channels, as well as its properties, which may be of independent interest.
Quantum coherence is a useful resource that is consumed to accomplish several tasks that classical devices are hard to fulfill. Especially, it is considered to be the origin of quantum speedup for many computational algorithms. In this work, we interpret the computational time cost of boson sampling with partially distinguishable photons from the perspective of coherence resource theory. With incoherent operations that preserve the diagonal elements of quantum states up to permutation, which we name emph{permuted genuinely incoherent operation} (pGIO), we present some evidence that the decrease of coherence corresponds to a computationally less complex system of partially distinguishable boson sampling. Our result shows that coherence is one of crucial resources for the computational time cost of boson sampling. We expect our work presents an insight to understand the quantum complexity of the linear optical network system.
Just recently, complementarity relations (CRs) have been derived from the basic rules of Quantum Mechanics. The complete CRs are equalities involving quantum coherence, $C$, quantum entanglement, and predictability, $P$. While the first two are already quantified in the resource theory framework, such a characterization lacks for the last. In this article, we start showing that, for a system prepared in a state $rho$, $P$ of $rho$, with reference to an observable $X$, is equal to $C$, with reference to observables mutually unbiased (MU) to $X$, of the state $Phi_{X}(rho)$, which is obtained from a non-revealing von Neumann measurement (NRvNM) of $X$. We also show that $P^X(rho)>C^{Y}(Phi_{X}(rho))$ for observables not MU. Afterwards, we provide quantum circuits for implementing NRvNMs and use these circuits to experimentally test these (in)equalities using the IBMs quantum computers. Furthermore, we give a resource theory for predictability, identifying its free quantum states and free quantum operations and discussing some predictability monotones. Besides, after applying one of these predictability monotones to study bipartite systems, we discuss the relation among the resource theories of quantum coherence, predictability, and purity.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
