اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدResource theory of asymmetric distinguishability
152
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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.
قيم البحث
اقرأ أيضاً
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 ch
annel 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.
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.
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 int
erpret 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.
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 an
d 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.
A series of recent works has shown that placing communication channels in a coherent superposition of alternative configurations can boost their ability to transmit information. Instances of this phenomenon are the advantages arising from the use of
communication devices in a superposition of alternative causal orders, and those arising from the transmission of information along a superposition of alternative trajectories. The relation among these advantages has been the subject of recent debate, with some authors claiming that the advantages of the superposition of orders could be reproduced, and even surpassed, by other forms of superpositions. To shed light on this debate, we develop a general framework of resource theories of communication. In this framework, the resources are communication devices, and the allowed operations are (a) the placement of communication devices between the communicating parties, and (b) the connection of communication devices with local devices in the parties laboratories. The allowed operations are required to satisfy the minimal condition that they do not enable communication independently of the devices representing the initial resources. The resource-theoretic analysis reveals that the aforementioned criticisms on the superposition of causal orders were based on an uneven comparison between different types of quantum superpositions, exhibiting different operational features.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
