اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSequential State Discrimination and Requirement of Quantum Dissonance
372
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 discriminated 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.
قيم البحث
اقرأ أيضاً
A fundamental problem in quantum information is to explore what kind of quantum correlations is responsible for successful completion of a quantum information procedure. Here we study the roles of entanglement, discord, and dissonance needed for opti
mal quantum state discrimination when the latter is assisted with an auxiliary system. In such process, we present a more general joint unitary transformation than the existing results. The quantum entanglement between a principal qubit and an ancilla is found to be completely unnecessary, as it can be set to zero in the arbitrary case by adjusting the parameters in the general unitary without affecting the success probability. This result also shows that it is quantum dissonance that plays as a key role in assisted optimal state discrimination and not quantum entanglement. A necessary criterion for the necessity of quantum dissonance based on the linear entropy is also presented.
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.
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.
We provide a description of the problem of the discrimination of two quantum states in terms of receiver operation characteristics analysis, a prevalent approach in classical statistics. Receiveroperation characteristics diagrams provide an expressiv
e representation of the problem, in which quantities such as the fidelity and the trace distance also appear explicitly. In addition we introduce an alternative quantum generalization of the classical Bhattacharyya coefficient. We evaluate our quantum Bhattacharyya coefficient for certain situations and describe some of its properties. These properties make it applicable as another possible quantifier of the similarity of quantum states.
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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
