اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDephasing-Covariant Operations Enable Asymptotic Reversibility of Quantum Resources
222
0
0.0
(
0
)
تأليف
Eric Chitambar
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study the power of dephasing-covariant operations in the resource theories of coherence and entanglement. These are quantum operations whose actions commute with a projective measurement. In the resource theory of coherence, we find that any two states are asymptotically interconvertible under dephasing-covariant operations. This provides a rare example of a resource theory in which asymptotic reversibility can be attained without needing the maximal set of resource non-generating operations. When extended to the resource theory of entanglement, the resultant operations share similarities with LOCC, such as prohibiting the increase of all Renyi $alpha$-entropies of entanglement under pure state transformations. However, we show these operations are still strong enough to enable asymptotic reversibility between any two maximally correlated mixed states, even in the multipartite setting.
قيم البحث
اقرأ أيضاً
We characterize the operational capabilities of quantum channels which can neither create nor detect quantum coherence vis-`a-vis efficiently manipulating coherence as a resource. We study the class of dephasing-covariant operations (DIO), unable to
detect the coherence of any input state, as well as introduce an operationally-motivated class of channels $rho$-DIO which is tailored to a specific input state. We first show that pure-state transformations under DIO are completely governed by majorization, establishing necessary and sufficient conditions for such transformations and adding to the list of operational paradigms where majorization plays a central role. We then show that $rho$-DIO are strictly more powerful: although they cannot detect the coherence of the input state $rho$, the operations $rho$-DIO can distill more coherence than DIO. However, the advantage disappears in the task of coherence dilution as well as generally in the asymptotic limit, where both sets of operations achieve the same rates in all transformations.
We analyze the asymptotic dynamics of quantum systems resulting from large numbers of iterations of random unitary operations. Although, in general, these quantum operations cannot be diagonalized it is shown that their resulting asymptotic dynamics
is described by a diagonalizable superoperator. We prove that this asymptotic dynamics takes place in a typically low dimensional attractor space which is independent of the probability distribution of the unitary operations applied. This vector space is spanned by all eigenvectors of the unitary operations involved which are associated with eigenvalues of unit modulus. Implications for possible asymptotic dynamics of iterated random unitary operations are presented and exemplified in an example involving random controlled-not operations acting on two qubits.
We study asymptotic state transformations in continuous variable quantum resource theories. In particular, we prove that monotones displaying lower semicontinuity and strong superadditivity can be used to bound asymptotic transformation rates in thes
e settings. This removes the need for asymptotic continuity, which cannot be defined in the traditional sense for infinite-dimensional systems. We consider three applications, to the resource theories of (I) optical nonclassicality, (II) entanglement, and (III) quantum thermodynamics. In cases (II) and (III), the employed monotones are the (infinite-dimensional) squashed entanglement and the free energy, respectively. For case (I), we consider the measured relative entropy of nonclassicality and prove it to be lower semicontinuous and strongly superadditive. Our technique then yields computable upper bounds on asymptotic transformation rates including those achievable under linear optical elements. We also prove a number of results which ensure the measured relative entropy of nonclassicality to be bounded on any physically meaningful state, and to be easily computable for some class of states of interest, e.g., Fock diagonal states. We conclude by applying our findings to the problem of cat state manipulation and noisy Fock state purification.
Given a protocol ${cal P}$ that implements multipartite quantum channel ${cal E}$ by repeated rounds of local operations and classical communication (LOCC), we construct an alternate LOCC protocol for ${cal E}$ in no more rounds than ${cal P}$ and no
more than a fixed, constant number of outcomes for each local measurement, the same constant number for every party and every round. We then obtain another upper bound on the number of outcomes that, under certain conditions, improves on the first. The latter bound shows that for LOCC channels that are extreme points of the convex set of all quantum channels, the parties can restrict the number of outcomes in their individual local measurements to no more than the square of their local Hilbert space dimension, $d_alpha$, suggesting a possible link between the required resources for LOCC and the convex structure of the set of all quantum channels. Our bounds on the number of outcomes indicating the need for only constant resources per round, independent of the number of rounds $r$ including when that number is infinite, are a stark contrast to the exponential $r$-dependence in the only previously published bound of which we are aware. If a lower bound is known on the number of product operators needed to represent the channel, we obtain a lower bound on the number of rounds required to implement the given channel by LOCC. Finally, we show that when the quantum channel is not required but only that a given task be implemented deterministically, then no more than $d_alpha^2$ outcomes are needed for each local measurement by party $alpha$.
The difficulty in manipulating quantum resources deterministically often necessitates the use of probabilistic protocols, but the characterization of their capabilities and limitations has been lacking. Here, we develop two general approaches to this
problem. First, we introduce a new resource monotone based on the Hilbert projective metric and we show that it obeys a very strong type of monotonicity: it can rule out all transformations, probabilistic or deterministic, between states in any quantum resource theory. This allows us to place fundamental limitations on state transformations and restrict the advantages that probabilistic protocols can provide over deterministic ones, significantly strengthening previous findings and extending recent no-go theorems. We apply our results to obtain a substantial improvement in lower bounds for the errors and overheads of probabilistic distillation protocols, directly applicable to tasks such as entanglement or magic state distillation, and computable through convex optimization. In broad classes of resources, we show that no better restrictions on probabilistic protocols are possible -- our monotone can provide a necessary and sufficient condition for probabilistic resource transformations, thus allowing us to quantify exactly the highest fidelity achievable in resource distillation tasks by means of any probabilistic manipulation protocol. Complementing this approach, we introduce a general method for bounding achievable probabilities in resource transformations through a family of convex optimization problems. We show it to tightly characterize single-shot probabilistic distillation in broad types of resource theories, allowing an exact analysis of the trade-offs between the probabilities and errors in distilling maximally resourceful states.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
