اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدExperimental multi-state quantum discrimination through a Quantum network
80
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The need of discriminating between different quantum states is a fundamental issue in Quantum Information and Communication. The actual realization of generally optimal strategies in this task is often limited by the need of supplemental resources and very complex receivers. We have experimentally implemented two discrimination schemes in a minimum-error scenario based on a receiver featured by a network structure and a dynamical processing of information. The first protocol implemented in our experiment, directly inspired to a recent theoretical proposal, achieves binary optimal discrimination, while the second one provides a novel approach to multi-state quantum discrimination, relying on the dynamical features of the network-like receiver. This strategy exploits the arrival time degree of freedom as an encoding variable, achieving optimal results, without the need for supplemental systems or devices. Our results further reveal the potential of dynamical approaches to Quantum State Discrimination tasks, providing a possible starting point for efficient alternatives to current experimental strategies.
قيم البحث
اقرأ أيضاً
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.
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.
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.
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.
Photonic quantum networking relies on entanglement distribution between distant nodes, typically realized by swapping procedures. However, entanglement swapping is a demanding task in practice, mainly because of limited effectiveness of entangled pho
ton sources and Bell-state measurements necessary to realize the process. Here we experimentally activate a remote distribution of two-photon polarization entanglement which supersedes the need for initial entangled pairs and traditional Bell-state measurements. This alternative procedure is accomplished thanks to the controlled spatial indistinguishability of four independent photons in three separated nodes of the network, which enables us to perform localized product-state measurements on the central node acting as a trigger. This experiment proves that the inherent indistinguishability of identical particles supplies new standards for feasible quantum communication in multinode photonic quantum networks.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
