اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSequential state discrimination with quantum correlation
153
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The sequential unambiguous state discrimination (SSD) of two states prepared in arbitrary prior probabilities is studied, and compared with three strategies that allow classical communication. The deviation from equal probabilities contributes to the success in all the tasks considered. When one considers at least one of the parties succeeds, the protocol with probabilistic cloning is superior to others, which is not observed in the special case with equal prior probabilities. We also investigate the roles of quantum correlations in SSD, and show that the procedure requires discords but rejects entanglement. The left and right discords correspond to the part of information extracted by the first observer and the part left to his successor respectively. Their relative difference is extended by the imbalance of prior probabilities.
قيم البحث
اقرأ أيضاً
We study the procedure for sequential unambiguous state discrimination. A qubit is prepared in one of two possible states, and measured by two observers Bob and Charlie sequentially. A necessary condition for the state to be unambiguously discriminat
ed by Charlie is the absence of entanglement between the principal qubit, prepared by Alice, and Bobs auxiliary system. In general, the procedure for both Bob and Charlie to recognize between two nonorthogonal states conclusively relies on the availability of quantum discord which is precisely the quantum dissonance when the entanglement is absent. In Bobs measurement, the left discord is positively correlated with the information extracted by Bob, and the right discord enhances the information left to Charlie. When their product achieves its maximum the probability for both Bob and Charlie to identify the state achieves its optimal value.
Recently, a protocol for quantum state discrimination (QSD) in a multi-party scenario has been introduced [Phys. Rev. Lett. 111, 100501 (2013)]. In this protocol, Alice generates a quantum system in one of two pre-defined non-orthogonal qubit states,
and the goal is to send the generated state information to different parties without classical communication exchanged between them during the protocols session. The interesting feature is that, by resorting to sequential generalized measurements onto this single system, there is a non-vanishing probability that all observers identify the state prepared by Alice. Here, we present the experimental implementation of this protocol based on polarization single-photon states. Our scheme works over an optical network, and since QSD lies in the core of many protocols, it represents a step towards experimental multi-party quantum information processing.
In this paper we investigate the connection between quantum information theory and machine learning. In particular, we show how quantum state discrimination can represent a useful tool to address the standard classification problem in machine learnin
g. Previous studies have shown that the optimal quantum measurement theory developed in the context of quantum information theory and quantum communication can inspire a new binary classification algorithm that can achieve higher inference accuracy for various datasets. Here we propose a model for arbitrary multiclass classification inspired by quantum state discrimination, which is enabled by encoding the data in the space of linear operators on a Hilbert space. While our algorithm is quantum-inspired, it can be implemented on classical hardware, thereby permitting immediate applications.
In the present article, we develop a general framework for the description of an $N$-sequential state discrimination, where each of $N$ receivers always obtains a conclusive result. For this new state discrimination scenario, we derive two mutually e
quivalent general representations of the success probability and prove that if one of two states, pure or mixed, is prepared by a sender, then the optimal success probability is given by the Helstrom bound for any number $N$ of sequential receivers. Furthermore, we specify receivers indirect measurements resulting in the optimal $N$-sequential conclusive state discrimination protocol. The developed framework is true for any number $N$ of sequential receivers, any number of arbitrary quantum states, pure or mixed, to be discriminated, and all types of receivers quantum measurements. The new general results derived within the developed framework are important both from the theoretical point of view and for a successful multipartite quantum communication even in the presence of a quantum noise.
Quantum Stochastic Walks (QSW) allow for a generalization of both quantum and classical random walks by describing the dynamic evolution of an open quantum system on a network, with nodes corresponding to quantum states of a fixed basis. We consider
the problem of quantum state discrimination on such a system, and we solve it by optimizing the network topology weights. Finally, we test it on different quantum network topologies and compare it with optimal theoretical bounds.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
